| 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 ∧ 𝑇 ≠ ∅) → 2o ≺ 𝑇) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tsk2 10713 | . 2 ⊢ ((𝑇 ∈ Tarski ∧ 𝑇 ≠ ∅) → 2o ∈ 𝑇) | |
| 2 | tsksdom 10704 | . 2 ⊢ ((𝑇 ∈ Tarski ∧ 2o ∈ 𝑇) → 2o ≺ 𝑇) | |
| 3 | 1, 2 | syldan 599 | 1 ⊢ ((𝑇 ∈ Tarski ∧ 𝑇 ≠ ∅) → 2o ≺ 𝑇) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 398 ∈ wcel 2136 ≠ wne 2951 ∅c0 4280 class class class wbr 5094 2oc2o 8419 ≺ csdm 8915 Tarskictsk 10696 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-ral 3071 df-rex 3081 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-ord 6338 df-on 6339 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-1o 8425 df-2o 8426 df-er 8666 df-en 8917 df-dom 8918 df-sdom 8919 df-tsk 10697 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |