![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 2domtsk | Structured version Visualization version GIF version |
Description: If a Tarski class is not empty, it has more than two elements. (Contributed by FL, 22-Feb-2011.) |
Ref | Expression |
---|---|
2domtsk | ⊢ ((𝑇 ∈ Tarski ∧ 𝑇 ≠ ∅) → 2𝑜 ≺ 𝑇) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tsk2 9466 | . 2 ⊢ ((𝑇 ∈ Tarski ∧ 𝑇 ≠ ∅) → 2𝑜 ∈ 𝑇) | |
2 | tsksdom 9457 | . 2 ⊢ ((𝑇 ∈ Tarski ∧ 2𝑜 ∈ 𝑇) → 2𝑜 ≺ 𝑇) | |
3 | 1, 2 | syldan 486 | 1 ⊢ ((𝑇 ∈ Tarski ∧ 𝑇 ≠ ∅) → 2𝑜 ≺ 𝑇) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∈ wcel 1977 ≠ wne 2780 ∅c0 3874 class class class wbr 4583 2𝑜c2o 7441 ≺ csdm 7840 Tarskictsk 9449 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-ord 5643 df-on 5644 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-1o 7447 df-2o 7448 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-tsk 9450 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |