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

Theorem rexpr 4610
 Description: Convert a restricted existential quantification over a pair to a disjunction. (Contributed by NM, 3-Jun-2007.) (Revised by Mario Carneiro, 23-Apr-2015.)
Hypotheses
Ref Expression
ralpr.1 𝐴 ∈ V
ralpr.2 𝐵 ∈ V
ralpr.3 (𝑥 = 𝐴 → (𝜑𝜓))
ralpr.4 (𝑥 = 𝐵 → (𝜑𝜒))
Assertion
Ref Expression
rexpr (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓𝜒))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜓,𝑥   𝜒,𝑥
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem rexpr
StepHypRef Expression
1 ralpr.1 . 2 𝐴 ∈ V
2 ralpr.2 . 2 𝐵 ∈ V
3 ralpr.3 . . 3 (𝑥 = 𝐴 → (𝜑𝜓))
4 ralpr.4 . . 3 (𝑥 = 𝐵 → (𝜑𝜒))
53, 4rexprg 4606 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓𝜒)))
61, 2, 5mp2an 691 1 (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓𝜒))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∨ wo 844   = wceq 1538   ∈ wcel 2115  ∃wrex 3127  Vcvv 3471  {cpr 4542 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-12 2178  ax-ext 2793 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-ex 1782  df-nf 1786  df-sb 2071  df-clab 2800  df-cleq 2814  df-clel 2892  df-rex 3132  df-v 3473  df-sbc 3750  df-un 3915  df-sn 4541  df-pr 4543 This theorem is referenced by:  xpsdsval  22966  poimir  34968
 Copyright terms: Public domain W3C validator