HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem bm1.3ii 2702
Description: Convert implication to equivalence using Aussonderung. Similar to Theorem 1.3ii of [BellMachover] p. 463.
Hypothesis
Ref Expression
bm1.3ii.1 xy(φyx)
Assertion
Ref Expression
bm1.3ii xy(yxφ)
Distinct variable groups:   φ,x   x,y

Proof of Theorem bm1.3ii
StepHypRef Expression
1 bm1.3ii.1 . . . . 5 xy(φyx)
2 elequ2 1135 . . . . . . . 8 (x = z → (yxyz))
32imbi2d 611 . . . . . . 7 (x = z → ((φyx) ↔ (φyz)))
43albidv 1276 . . . . . 6 (x = z → (∀y(φyx) ↔ ∀y(φyz)))
54cbvexv 1313 . . . . 5 (∃xy(φyx) ↔ ∃zy(φyz))
61, 5mpbi 189 . . . 4 zy(φyz)
7 ax-sep 2699 . . . 4 xy(yx ↔ (yzφ))
86, 7pm3.2i 285 . . 3 (∃zy(φyz) ⋀ ∃xy(yx ↔ (yzφ)))
98exan 1104 . 2 z(∀y(φyz) ⋀ ∃xy(yx ↔ (yzφ)))
10 19.42v 1306 . . . 4 (∃x(∀y(φyz) ⋀ ∀y(yx ↔ (yzφ))) ↔ (∀y(φyz) ⋀ ∃xy(yx ↔ (yzφ))))
11 19.26 1065 . . . . . 6 (∀y((φyz) ⋀ (yx ↔ (yzφ))) ↔ (∀y(φyz) ⋀ ∀y(yx ↔ (yzφ))))
12 bimsc1 749 . . . . . . 7 (((φyz) ⋀ (yx ↔ (yzφ))) → (yxφ))
131219.20i 990 . . . . . 6 (∀y((φyz) ⋀ (yx ↔ (yzφ))) → ∀y(yxφ))
1411, 13sylbir 201 . . . . 5 ((∀y(φyz) ⋀ ∀y(yx ↔ (yzφ))) → ∀y(yxφ))
151419.22i 1038 . . . 4 (∃x(∀y(φyz) ⋀ ∀y(yx ↔ (yzφ))) → ∃xy(yxφ))
1610, 15sylbir 201 . . 3 ((∀y(φyz) ⋀ ∃xy(yx ↔ (yzφ))) → ∃xy(yxφ))
171619.23aiv 1293 . 2 (∃z(∀y(φyz) ⋀ ∃xy(yx ↔ (yzφ))) → ∃xy(yxφ))
189, 17ax-mp 7 1 xy(yxφ)
Colors of variables: wff set class
Syntax hints:   → wi 3   ↔ wb 146   ⋀ wa 223  ∀wal 952   = wceq 954   ∈ wcel 956  ∃wex 978
This theorem is referenced by:  axpow2 2740  pwex 2741  zfpair2 2776  axun2 2867  uniex2 2868
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-12 966  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-sep 2699
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979
Copyright terms: Public domain