| 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 4650 | . 2 ⊢ (𝐴 ∈ {𝐵, 𝐶, 𝐷} → (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷))) | |
| 2 | 1 | ibi 267 | 1 ⊢ (𝐴 ∈ {𝐵, 𝐶, 𝐷} → (𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ w3o 1085 = wceq 1540 ∈ wcel 2109 {ctp 4593 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-tru 1543 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-v 3449 df-un 3919 df-sn 4590 df-pr 4592 df-tp 4594 |
| This theorem is referenced by: fvf1tp 13751 tpfo 14465 prm23lt5 16785 perfectlem2 27141 zabsle1 27207 sgnmulsgn 32767 sgnmulsgp 32768 gsumtp 32998 cyc3co2 33097 kur14lem7 35199 omcl3g 43323 fmtnofz04prm 47578 perfectALTVlem2 47723 gpgprismgr4cycllem7 48091 pgnbgreunbgrlem3 48108 pgnbgreunbgrlem6 48114 |
| Copyright terms: Public domain | W3C validator |