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 4633 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓 ∨ 𝜒))) |
4 | 3 | orbi1d 913 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∨ ∃𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓 ∨ 𝜒) ∨ ∃𝑥 ∈ {𝐶}𝜑))) |
5 | raltpg.3 | . . . . . 6 ⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜃)) | |
6 | 5 | rexsng 4614 | . . . . 5 ⊢ (𝐶 ∈ 𝑋 → (∃𝑥 ∈ {𝐶}𝜑 ↔ 𝜃)) |
7 | 6 | orbi2d 912 | . . . 4 ⊢ (𝐶 ∈ 𝑋 → (((𝜓 ∨ 𝜒) ∨ ∃𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓 ∨ 𝜒) ∨ 𝜃))) |
8 | 4, 7 | sylan9bb 512 | . . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ 𝐶 ∈ 𝑋) → ((∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∨ ∃𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓 ∨ 𝜒) ∨ 𝜃))) |
9 | 8 | 3impa 1106 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → ((∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∨ ∃𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓 ∨ 𝜒) ∨ 𝜃))) |
10 | df-tp 4572 | . . . 4 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶}) | |
11 | 10 | rexeqi 3414 | . . 3 ⊢ (∃𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ ∃𝑥 ∈ ({𝐴, 𝐵} ∪ {𝐶})𝜑) |
12 | rexun 4166 | . . 3 ⊢ (∃𝑥 ∈ ({𝐴, 𝐵} ∪ {𝐶})𝜑 ↔ (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∨ ∃𝑥 ∈ {𝐶}𝜑)) | |
13 | 11, 12 | bitri 277 | . 2 ⊢ (∃𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (∃𝑥 ∈ {𝐴, 𝐵}𝜑 ∨ ∃𝑥 ∈ {𝐶}𝜑)) |
14 | df-3or 1084 | . 2 ⊢ ((𝜓 ∨ 𝜒 ∨ 𝜃) ↔ ((𝜓 ∨ 𝜒) ∨ 𝜃)) | |
15 | 9, 13, 14 | 3bitr4g 316 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∃𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (𝜓 ∨ 𝜒 ∨ 𝜃))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 843 ∨ w3o 1082 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ∃wrex 3139 ∪ cun 3934 {csn 4567 {cpr 4569 {ctp 4571 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rex 3144 df-v 3496 df-sbc 3773 df-un 3941 df-sn 4568 df-pr 4570 df-tp 4572 |
This theorem is referenced by: rextp 4642 fr3nr 7494 nb3grprlem2 27163 frgr3vlem2 28053 3vfriswmgr 28057 |
Copyright terms: Public domain | W3C validator |