| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eltpg | Structured version Visualization version GIF version | ||
| Description: Members of an unordered triple of classes. (Contributed by FL, 2-Feb-2014.) (Proof shortened by Mario Carneiro, 11-Feb-2015.) |
| Ref | Expression |
|---|---|
| eltpg | ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elprg 4610 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶))) | |
| 2 | elsng 4601 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐷} ↔ 𝐴 = 𝐷)) | |
| 3 | 1, 2 | orbi12d 932 | . 2 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ∈ {𝐵, 𝐶} ∨ 𝐴 ∈ {𝐷}) ↔ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶) ∨ 𝐴 = 𝐷))) |
| 4 | df-tp 4592 | . . . 4 ⊢ {𝐵, 𝐶, 𝐷} = ({𝐵, 𝐶} ∪ {𝐷}) | |
| 5 | 4 | eleq2i 2854 | . . 3 ⊢ (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ 𝐴 ∈ ({𝐵, 𝐶} ∪ {𝐷})) |
| 6 | elun 4103 | . . 3 ⊢ (𝐴 ∈ ({𝐵, 𝐶} ∪ {𝐷}) ↔ (𝐴 ∈ {𝐵, 𝐶} ∨ 𝐴 ∈ {𝐷})) | |
| 7 | 5, 6 | bitri 278 | . 2 ⊢ (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ (𝐴 ∈ {𝐵, 𝐶} ∨ 𝐴 ∈ {𝐷})) |
| 8 | df-3or 1104 | . 2 ⊢ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷) ↔ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶) ∨ 𝐴 = 𝐷)) | |
| 9 | 3, 7, 8 | 3bitr4g 317 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∨ wo 861 ∨ w3o 1102 = wceq 1570 ∈ wcel 2145 ∪ cun 3900 {csn 4587 {cpr 4589 {ctp 4591 |
| 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 2147 ax-9 2155 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-v 3455 df-un 3907 df-sn 4588 df-pr 4590 df-tp 4592 |
| This theorem is used by: eldiftp 4651 eltpi 4652 eltp 4653 el7g 4654 tpid1g 4733 tpid2g 4735 tpid3g 4736 f1dom3fv3dif 7269 f1dom3el3dif 7270 lcmftp 16732 estrreslem2 18232 1cubr 27087 zabsle1 27540 nb3grprlem1 29848 cos9thpiminplylem1 34300 |
| Copyright terms: Public domain | W3C validator |