Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sdom0 | Structured version Visualization version GIF version |
Description: The empty set does not strictly dominate any set. (Contributed by NM, 26-Oct-2003.) |
Ref | Expression |
---|---|
sdom0 | ⊢ ¬ 𝐴 ≺ ∅ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | relsdom 8611 | . . . 4 ⊢ Rel ≺ | |
2 | 1 | brrelex1i 5590 | . . 3 ⊢ (𝐴 ≺ ∅ → 𝐴 ∈ V) |
3 | 0domg 8751 | . . 3 ⊢ (𝐴 ∈ V → ∅ ≼ 𝐴) | |
4 | 2, 3 | syl 17 | . 2 ⊢ (𝐴 ≺ ∅ → ∅ ≼ 𝐴) |
5 | domnsym 8750 | . . 3 ⊢ (∅ ≼ 𝐴 → ¬ 𝐴 ≺ ∅) | |
6 | 5 | con2i 141 | . 2 ⊢ (𝐴 ≺ ∅ → ¬ ∅ ≼ 𝐴) |
7 | 4, 6 | pm2.65i 197 | 1 ⊢ ¬ 𝐴 ≺ ∅ |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∈ wcel 2112 Vcvv 3398 ∅c0 4223 class class class wbr 5039 ≼ cdom 8602 ≺ csdm 8603 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 ax-sep 5177 ax-nul 5184 ax-pow 5243 ax-pr 5307 ax-un 7501 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ral 3056 df-rex 3057 df-rab 3060 df-v 3400 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-pw 4501 df-sn 4528 df-pr 4530 df-op 4534 df-uni 4806 df-br 5040 df-opab 5102 df-id 5440 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-ima 5549 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-er 8369 df-en 8605 df-dom 8606 df-sdom 8607 |
This theorem is referenced by: domunsn 8774 sdomsdomcardi 9552 canthp1lem1 10231 canthp1lem2 10232 rankcf 10356 |
Copyright terms: Public domain | W3C validator |