Database
CLASSICAL FIRST-ORDER LOGIC WITH EQUALITY
Predicate calculus with equality: Tarski's system S2 (1 rule, 6 schemes)
Axiom scheme ax-4 (Quantified Implication)
19.29x
Next ⟩
19.35
Metamath Proof Explorer
Ascii
Unicode
Theorem
19.29x
Description:
Variation of
19.29
with mixed quantification.
(Contributed by
NM
, 11-Feb-2005)
Ref
Expression
Assertion
19.29x
⊢
∃
x
∀
y
φ
∧
∀
x
∃
y
ψ
→
∃
x
∃
y
φ
∧
ψ
Proof
Step
Hyp
Ref
Expression
1
19.29r
⊢
∃
x
∀
y
φ
∧
∀
x
∃
y
ψ
→
∃
x
∀
y
φ
∧
∃
y
ψ
2
19.29
⊢
∀
y
φ
∧
∃
y
ψ
→
∃
y
φ
∧
ψ
3
2
eximi
⊢
∃
x
∀
y
φ
∧
∃
y
ψ
→
∃
x
∃
y
φ
∧
ψ
4
1
3
syl
⊢
∃
x
∀
y
φ
∧
∀
x
∃
y
ψ
→
∃
x
∃
y
φ
∧
ψ