MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  exopxfr Structured version   Visualization version   GIF version

Theorem exopxfr 5820
Description: Transfer ordered-pair existence from/to single variable existence. (Contributed by NM, 26-Feb-2014.) (Proof shortened by Mario Carneiro, 31-Aug-2015.)
Hypothesis
Ref Expression
exopxfr.1 (𝑥 = ⟨𝑦, 𝑧⟩ → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
exopxfr (∃𝑥 ∈ (V × V)𝜑 ↔ ∃𝑦∃𝑧𝜓)
Distinct variable groups:   𝑦,𝑧,𝜑   𝜓,𝑥   𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦, 𝑧)

Proof of Theorem exopxfr
StepHypRef Expression
1 exopxfr.1 . . 3 (𝑥 = ⟨𝑦, 𝑧⟩ → (𝜑 ↔ 𝜓))
21rexxp 5818 . 2 (∃𝑥 ∈ (V × V)𝜑 ↔ ∃𝑦 ∈ V ∃𝑧 ∈ V 𝜓)
3 rexv 3477 . 2 (∃𝑦 ∈ V ∃𝑧 ∈ V 𝜓 ↔ ∃𝑦∃𝑧 ∈ V 𝜓)
4 rexv 3477 . . 3 (∃𝑧 ∈ V 𝜓 ↔ ∃𝑧𝜓)
54exbii 1880 . 2 (∃𝑦∃𝑧 ∈ V 𝜓 ↔ ∃𝑦∃𝑧𝜓)
62, 3, 53bitri 300 1 (∃𝑥 ∈ (V × V)𝜑 ↔ ∃𝑦∃𝑧𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569  ∃wex 1811  ∃wrex 3086  Vcvv 3450  ⟨cop 4834   × cxp 5648
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-iun 4952  df-opab 5167  df-xp 5656  df-rel 5657
This theorem is used by:  exopxfr2  5821
  Copyright terms: Public domain W3C validator