| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rextpg | Structured version Visualization version GIF version | ||
| Description: Convert a restricted existential 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 4668 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓 ∨ 𝜒))) |
| 4 | 3 | orbi1d 930 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∨ ∃𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓 ∨ 𝜒) ∨ ∃𝑥 ∈ {𝐶}𝜑))) |
| 5 | raltpg.3 | . . . . . 6 ⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜃)) | |
| 6 | 5 | rexsng 4647 | . . . . 5 ⊢ (𝐶 ∈ 𝑋 → (∃𝑥 ∈ {𝐶}𝜑 ↔ 𝜃)) |
| 7 | 6 | orbi2d 929 | . . . 4 ⊢ (𝐶 ∈ 𝑋 → (((𝜓 ∨ 𝜒) ∨ ∃𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓 ∨ 𝜒) ∨ 𝜃))) |
| 8 | 4, 7 | sylan9bb 519 | . . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ 𝐶 ∈ 𝑋) → ((∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∨ ∃𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓 ∨ 𝜒) ∨ 𝜃))) |
| 9 | 8 | 3impa 1127 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → ((∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∨ ∃𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓 ∨ 𝜒) ∨ 𝜃))) |
| 10 | df-tp 4599 | . . . 4 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶}) | |
| 11 | 10 | rexeqi 3325 | . . 3 ⊢ (∃𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ ∃𝑥 ∈ ({𝐴, 𝐵} ∪ {𝐶})𝜑) |
| 12 | rexun 4152 | . . 3 ⊢ (∃𝑥 ∈ ({𝐴, 𝐵} ∪ {𝐶})𝜑 ↔ (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∨ ∃𝑥 ∈ {𝐶}𝜑)) | |
| 13 | 11, 12 | bitri 278 | . 2 ⊢ (∃𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∨ ∃𝑥 ∈ {𝐶}𝜑)) |
| 14 | df-3or 1104 | . 2 ⊢ ((𝜓 ∨ 𝜒 ∨ 𝜃) ↔ ((𝜓 ∨ 𝜒) ∨ 𝜃)) | |
| 15 | 9, 13, 14 | 3bitr4g 317 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∃𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (𝜓 ∨ 𝜒 ∨ 𝜃))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∨ w3o 1102 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∃wrex 3092 ∪ cun 3906 {csn 4594 {cpr 4596 {ctp 4598 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-ral 3083 df-rex 3093 df-v 3460 df-un 3913 df-sn 4595 df-pr 4597 df-tp 4599 |
| This theorem is used by: rextp 4677 fr3nr 7780 nb3grprlem2 29768 frgr3vlem2 30662 3vfriswmgr 30666 |
| Copyright terms: Public domain | W3C validator |