| 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 4603 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶))) | |
| 2 | elsng 4594 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐷} ↔ 𝐴 = 𝐷)) | |
| 3 | 1, 2 | orbi12d 918 | . 2 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ∈ {𝐵, 𝐶} ∨ 𝐴 ∈ {𝐷}) ↔ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶) ∨ 𝐴 = 𝐷))) |
| 4 | df-tp 4585 | . . . 4 ⊢ {𝐵, 𝐶, 𝐷} = ({𝐵, 𝐶} ∪ {𝐷}) | |
| 5 | 4 | eleq2i 2828 | . . 3 ⊢ (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ 𝐴 ∈ ({𝐵, 𝐶} ∪ {𝐷})) |
| 6 | elun 4105 | . . 3 ⊢ (𝐴 ∈ ({𝐵, 𝐶} ∪ {𝐷}) ↔ (𝐴 ∈ {𝐵, 𝐶} ∨ 𝐴 ∈ {𝐷})) | |
| 7 | 5, 6 | bitri 275 | . 2 ⊢ (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ (𝐴 ∈ {𝐵, 𝐶} ∨ 𝐴 ∈ {𝐷})) |
| 8 | df-3or 1087 | . 2 ⊢ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷) ↔ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶) ∨ 𝐴 = 𝐷)) | |
| 9 | 3, 7, 8 | 3bitr4g 314 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∨ wo 847 ∨ w3o 1085 = wceq 1541 ∈ wcel 2113 ∪ cun 3899 {csn 4580 {cpr 4582 {ctp 4584 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-v 3442 df-un 3906 df-sn 4581 df-pr 4583 df-tp 4585 |
| This theorem is referenced by: eldiftp 4644 eltpi 4645 eltp 4646 el7g 4647 tpid1g 4726 tpid2g 4728 tpid3g 4729 f1dom3fv3dif 7214 f1dom3el3dif 7215 lcmftp 16563 estrreslem2 18061 1cubr 26808 zabsle1 27263 nb3grprlem1 29453 cos9thpiminplylem1 33939 |
| Copyright terms: Public domain | W3C validator |