| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sdomnen | Structured version Visualization version GIF version | ||
| Description: Strict dominance implies non-equinumerosity. (Contributed by NM, 10-Jun-1998.) |
| Ref | Expression |
|---|---|
| sdomnen | ⊢ (𝐴 ≺ 𝐵 → ¬ 𝐴 ≈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brsdom 9039 | . 2 ⊢ (𝐴 ≺ 𝐵 ↔ (𝐴 ≼ 𝐵 ∧ ¬ 𝐴 ≈ 𝐵)) | |
| 2 | 1 | simprbi 503 | 1 ⊢ (𝐴 ≺ 𝐵 → ¬ 𝐴 ≈ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 class class class wbr 5108 ≈ cen 9008 ≼ cdom 9009 ≺ csdm 9010 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-v 3456 df-dif 4050 df-br 5109 df-sdom 9014 |
| This theorem is used by: bren2 9048 domdifsn 9117 sdomnsym 9159 domnsym 9160 sdomirr 9171 domnsymfi 9253 sucdom2 9256 php5 9264 phpeqd 9265 1sdom2dom 9283 pssinf 9291 f1finf1o 9302 isfinite2 9328 cardom 10106 pm54.43 10121 alephdom 10199 cdainflem 10305 ackbij1b 10355 isfin4p1 10432 fin23lem25 10441 fin67 10512 axcclem 10574 canthp1lem2 10777 gchinf 10781 pwfseqlem4 10786 tskssel 10881 1nprm 16898 en2top 23358 domalom 38595 pibt2 38608 rp-isfinite6 44841 ensucne0OLD 44853 iscard5 44859 omiscard 44866 |
| Copyright terms: Public domain | W3C validator |