Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rextp | GIF version |
Description: Convert a quantification over a triple to a disjunction. (Contributed by Mario Carneiro, 23-Apr-2015.) |
Ref | Expression |
---|---|
raltp.1 | ⊢ 𝐴 ∈ V |
raltp.2 | ⊢ 𝐵 ∈ V |
raltp.3 | ⊢ 𝐶 ∈ V |
raltp.4 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
raltp.5 | ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒)) |
raltp.6 | ⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜃)) |
Ref | Expression |
---|---|
rextp | ⊢ (∃𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (𝜓 ∨ 𝜒 ∨ 𝜃)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | raltp.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | raltp.2 | . 2 ⊢ 𝐵 ∈ V | |
3 | raltp.3 | . 2 ⊢ 𝐶 ∈ V | |
4 | raltp.4 | . . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
5 | raltp.5 | . . 3 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒)) | |
6 | raltp.6 | . . 3 ⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜃)) | |
7 | 4, 5, 6 | rextpg 3577 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → (∃𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (𝜓 ∨ 𝜒 ∨ 𝜃))) |
8 | 1, 2, 3, 7 | mp3an 1315 | 1 ⊢ (∃𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (𝜓 ∨ 𝜒 ∨ 𝜃)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 ∨ w3o 961 = wceq 1331 ∈ wcel 1480 ∃wrex 2417 Vcvv 2686 {ctp 3529 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 |
This theorem depends on definitions: df-bi 116 df-3or 963 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-rex 2422 df-v 2688 df-sbc 2910 df-un 3075 df-sn 3533 df-pr 3534 df-tp 3535 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |