Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rexpr | Structured version Visualization version GIF version |
Description: Convert an existential quantification over a pair to a disjunction. (Contributed by NM, 3-Jun-2007.) (Revised by Mario Carneiro, 23-Apr-2015.) |
Ref | Expression |
---|---|
ralpr.1 | ⊢ 𝐴 ∈ V |
ralpr.2 | ⊢ 𝐵 ∈ V |
ralpr.3 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
ralpr.4 | ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒)) |
Ref | Expression |
---|---|
rexpr | ⊢ (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓 ∨ 𝜒)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ralpr.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | ralpr.2 | . 2 ⊢ 𝐵 ∈ V | |
3 | ralpr.3 | . . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
4 | ralpr.4 | . . 3 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒)) | |
5 | 3, 4 | rexprg 4182 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓 ∨ 𝜒))) |
6 | 1, 2, 5 | mp2an 704 | 1 ⊢ (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓 ∨ 𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∨ wo 382 = wceq 1475 ∈ wcel 1977 ∃wrex 2897 Vcvv 3173 {cpr 4127 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-rex 2902 df-v 3175 df-sbc 3403 df-un 3545 df-sn 4126 df-pr 4128 |
This theorem is referenced by: xpsdsval 21996 poimir 32612 |
Copyright terms: Public domain | W3C validator |