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 4622 | . 2 ⊢ (𝐴 ∈ {𝐵, 𝐶, 𝐷} → (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷))) | |
2 | 1 | ibi 269 | 1 ⊢ (𝐴 ∈ {𝐵, 𝐶, 𝐷} → (𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∨ w3o 1082 = wceq 1533 ∈ wcel 2110 {ctp 4570 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-v 3496 df-un 3940 df-sn 4567 df-pr 4569 df-tp 4571 |
This theorem is referenced by: prm23lt5 16150 perfectlem2 25805 zabsle1 25871 cyc3co2 30782 sgnmulsgn 31807 sgnmulsgp 31808 kur14lem7 32459 fmtnofz04prm 43738 perfectALTVlem2 43886 |
Copyright terms: Public domain | W3C validator |