Prompt:
In first-order logic, symbolize the following propositions using the given predicates.
Strictly follow these notation rules:
- Universal Quantifier: Ax (for all x)
- Existential Quantifier: Ex (there exists x)
- Logical Connectives: & (and), | (or), ⇒ (implies), ∼ (not)
- Predicate format: Use capitalized letters with variables (e.g., F(x), G(x,y))
- 0-ary predicates must use constants (e.g., F(a), G(b,c))

Problem 1: If c is F then a is F
Predicates:
- F(a): a has property F
- F(c): c has property F

Problem 2: Using universal domain: All birds fly.
Predicates:
- F(x): x is a birds
- G(x): x fly

Problem 3: Using universal domain: All prime numbers are even.
Predicates:
- F(x): x is a prime numbers
- G(x): x are even

Problem 4: No humans can fly. (Using universal domain)
Predicates:
- F(x): x is human
- G(x): x can fly

Provide answers in [[answer1;answer2;...]] format exactly as required.

If c is F then a is F

Answer: F(c)⇒F(a)

Using universal domain: All birds fly.

Answer: Ax(F(x)⇒G(x))

Answer: Ax(F(x)⇒G(x))

Answer: Ax(F(x)⇒∼G(x))