| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eltpi | Structured version Visualization version GIF version | ||
| Description: A member of an unordered triple of classes is one of them. (Contributed by Mario Carneiro, 11-Feb-2015.) |
| Ref | Expression |
|---|---|
| eltpi | ⊢ (𝐴 ∈ {𝐵, 𝐶, 𝐷} → (𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eltpg 4657 | . 2 ⊢ (𝐴 ∈ {𝐵, 𝐶, 𝐷} → (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷))) | |
| 2 | 1 | ibi 270 | 1 ⊢ (𝐴 ∈ {𝐵, 𝐶, 𝐷} → (𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∨ w3o 1102 = wceq 1570 ∈ wcel 2146 {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-tru 1573 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-v 3460 df-un 3913 df-sn 4595 df-pr 4597 df-tp 4599 |
| This theorem is used by: fvf1tp 13842 tpfo 14557 sgnmulsgn 15172 prm23lt5 16899 perfectlem2 27431 zabsle1 27497 sgnmulsgp 33213 gsumtp 33415 cyc3co2 33491 kur14lem7 35725 omcl3g 44102 fmtnofz04prm 48370 perfectALTVlem2 48528 gpgprismgr4cycllem7 48907 pgnbgreunbgrlem3 48924 pgnbgreunbgrlem6 48930 crosspalti 50689 crossp3i 50690 |
| Copyright terms: Public domain | W3C validator |