ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  rexprg GIF version

Theorem rexprg 3450
Description: Convert a quantification over a pair to a disjunction. (Contributed by NM, 17-Sep-2011.) (Revised by Mario Carneiro, 23-Apr-2015.)
Hypotheses
Ref Expression
ralprg.1 (𝑥 = 𝐴 → (𝜑𝜓))
ralprg.2 (𝑥 = 𝐵 → (𝜑𝜒))
Assertion
Ref Expression
rexprg ((𝐴𝑉𝐵𝑊) → (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓𝜒)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜓,𝑥   𝜒,𝑥
Allowed substitution hints:   𝜑(𝑥)   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem rexprg
StepHypRef Expression
1 df-pr 3410 . . . 4 {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
21rexeqi 2527 . . 3 (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ ∃𝑥 ∈ ({𝐴} ∪ {𝐵})𝜑)
3 rexun 3151 . . 3 (∃𝑥 ∈ ({𝐴} ∪ {𝐵})𝜑 ↔ (∃𝑥 ∈ {𝐴}𝜑 ∨ ∃𝑥 ∈ {𝐵}𝜑))
42, 3bitri 177 . 2 (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (∃𝑥 ∈ {𝐴}𝜑 ∨ ∃𝑥 ∈ {𝐵}𝜑))
5 ralprg.1 . . . . 5 (𝑥 = 𝐴 → (𝜑𝜓))
65rexsng 3440 . . . 4 (𝐴𝑉 → (∃𝑥 ∈ {𝐴}𝜑𝜓))
76orbi1d 715 . . 3 (𝐴𝑉 → ((∃𝑥 ∈ {𝐴}𝜑 ∨ ∃𝑥 ∈ {𝐵}𝜑) ↔ (𝜓 ∨ ∃𝑥 ∈ {𝐵}𝜑)))
8 ralprg.2 . . . . 5 (𝑥 = 𝐵 → (𝜑𝜒))
98rexsng 3440 . . . 4 (𝐵𝑊 → (∃𝑥 ∈ {𝐵}𝜑𝜒))
109orbi2d 714 . . 3 (𝐵𝑊 → ((𝜓 ∨ ∃𝑥 ∈ {𝐵}𝜑) ↔ (𝜓𝜒)))
117, 10sylan9bb 443 . 2 ((𝐴𝑉𝐵𝑊) → ((∃𝑥 ∈ {𝐴}𝜑 ∨ ∃𝑥 ∈ {𝐵}𝜑) ↔ (𝜓𝜒)))
124, 11syl5bb 185 1 ((𝐴𝑉𝐵𝑊) → (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓𝜒)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 101  wb 102  wo 639   = wceq 1259  wcel 1409  wrex 2324  cun 2943  {csn 3403  {cpr 3404
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038
This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-rex 2329  df-v 2576  df-sbc 2788  df-un 2950  df-sn 3409  df-pr 3410
This theorem is referenced by:  rextpg  3452  rexpr  3454
  Copyright terms: Public domain W3C validator