| 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 4608 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶))) | |
| 2 | elsng 4599 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐷} ↔ 𝐴 = 𝐷)) | |
| 3 | 1, 2 | orbi12d 931 | . 2 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ∈ {𝐵, 𝐶} ∨ 𝐴 ∈ {𝐷}) ↔ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶) ∨ 𝐴 = 𝐷))) |
| 4 | df-tp 4590 | . . . 4 ⊢ {𝐵, 𝐶, 𝐷} = ({𝐵, 𝐶} ∪ {𝐷}) | |
| 5 | 4 | eleq2i 2857 | . . 3 ⊢ (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ 𝐴 ∈ ({𝐵, 𝐶} ∪ {𝐷})) |
| 6 | elun 4109 | . . 3 ⊢ (𝐴 ∈ ({𝐵, 𝐶} ∪ {𝐷}) ↔ (𝐴 ∈ {𝐵, 𝐶} ∨ 𝐴 ∈ {𝐷})) | |
| 7 | 5, 6 | bitri 278 | . 2 ⊢ (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ (𝐴 ∈ {𝐵, 𝐶} ∨ 𝐴 ∈ {𝐷})) |
| 8 | df-3or 1102 | . 2 ⊢ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷) ↔ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶) ∨ 𝐴 = 𝐷)) | |
| 9 | 3, 7, 8 | 3bitr4g 317 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∨ wo 860 ∨ w3o 1100 = wceq 1563 ∈ wcel 2145 ∪ cun 3905 {csn 4585 {cpr 4587 {ctp 4589 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-tru 1566 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-v 3459 df-un 3912 df-sn 4586 df-pr 4588 df-tp 4590 |
| This theorem is referenced by: eldiftp 4649 eltpi 4650 eltp 4651 el7g 4652 tpid1g 4731 tpid2g 4733 tpid3g 4734 f1dom3fv3dif 7256 f1dom3el3dif 7257 lcmftp 16684 estrreslem2 18184 1cubr 26965 zabsle1 27418 nb3grprlem1 29639 cos9thpiminplylem1 34089 |
| Copyright terms: Public domain | W3C validator |