Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rextpg | GIF version |
Description: Convert a quantification over a triple to a disjunction. (Contributed by Mario Carneiro, 23-Apr-2015.) |
Ref | Expression |
---|---|
ralprg.1 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
ralprg.2 | ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒)) |
raltpg.3 | ⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜃)) |
Ref | Expression |
---|---|
rextpg | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∃𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (𝜓 ∨ 𝜒 ∨ 𝜃))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ralprg.1 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
2 | ralprg.2 | . . . . . 6 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒)) | |
3 | 1, 2 | rexprg 3641 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓 ∨ 𝜒))) |
4 | 3 | orbi1d 791 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∨ ∃𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓 ∨ 𝜒) ∨ ∃𝑥 ∈ {𝐶}𝜑))) |
5 | raltpg.3 | . . . . . 6 ⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜃)) | |
6 | 5 | rexsng 3630 | . . . . 5 ⊢ (𝐶 ∈ 𝑋 → (∃𝑥 ∈ {𝐶}𝜑 ↔ 𝜃)) |
7 | 6 | orbi2d 790 | . . . 4 ⊢ (𝐶 ∈ 𝑋 → (((𝜓 ∨ 𝜒) ∨ ∃𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓 ∨ 𝜒) ∨ 𝜃))) |
8 | 4, 7 | sylan9bb 462 | . . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ 𝐶 ∈ 𝑋) → ((∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∨ ∃𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓 ∨ 𝜒) ∨ 𝜃))) |
9 | 8 | 3impa 1194 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → ((∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∨ ∃𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓 ∨ 𝜒) ∨ 𝜃))) |
10 | df-tp 3597 | . . . 4 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶}) | |
11 | 10 | rexeqi 2675 | . . 3 ⊢ (∃𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ ∃𝑥 ∈ ({𝐴, 𝐵} ∪ {𝐶})𝜑) |
12 | rexun 3313 | . . 3 ⊢ (∃𝑥 ∈ ({𝐴, 𝐵} ∪ {𝐶})𝜑 ↔ (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∨ ∃𝑥 ∈ {𝐶}𝜑)) | |
13 | 11, 12 | bitri 184 | . 2 ⊢ (∃𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∨ ∃𝑥 ∈ {𝐶}𝜑)) |
14 | df-3or 979 | . 2 ⊢ ((𝜓 ∨ 𝜒 ∨ 𝜃) ↔ ((𝜓 ∨ 𝜒) ∨ 𝜃)) | |
15 | 9, 13, 14 | 3bitr4g 223 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∃𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (𝜓 ∨ 𝜒 ∨ 𝜃))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 708 ∨ w3o 977 ∧ w3a 978 = wceq 1353 ∈ wcel 2146 ∃wrex 2454 ∪ cun 3125 {csn 3589 {cpr 3590 {ctp 3591 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 709 ax-5 1445 ax-7 1446 ax-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-8 1502 ax-10 1503 ax-11 1504 ax-i12 1505 ax-bndl 1507 ax-4 1508 ax-17 1524 ax-i9 1528 ax-ial 1532 ax-i5r 1533 ax-ext 2157 |
This theorem depends on definitions: df-bi 117 df-3or 979 df-3an 980 df-tru 1356 df-nf 1459 df-sb 1761 df-clab 2162 df-cleq 2168 df-clel 2171 df-nfc 2306 df-rex 2459 df-v 2737 df-sbc 2961 df-un 3131 df-sn 3595 df-pr 3596 df-tp 3597 |
This theorem is referenced by: rextp 3647 |
Copyright terms: Public domain | W3C validator |