| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ensdomtr | Structured version Visualization version GIF version | ||
| Description: Transitivity of equinumerosity and strict dominance. (Contributed by NM, 26-Oct-2003.) (Revised by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| ensdomtr | ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐵 ≺ 𝐶) → 𝐴 ≺ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | endom 8918 | . 2 ⊢ (𝐴 ≈ 𝐵 → 𝐴 ≼ 𝐵) | |
| 2 | domsdomtr 9042 | . 2 ⊢ ((𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝐶) → 𝐴 ≺ 𝐶) | |
| 3 | 1, 2 | sylan 581 | 1 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐵 ≺ 𝐶) → 𝐴 ≺ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 class class class wbr 5097 ≈ cen 8882 ≼ cdom 8883 ≺ csdm 8884 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2183 ax-ext 2707 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ral 3051 df-rex 3060 df-rab 3399 df-v 3441 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-opab 5160 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-er 8635 df-en 8886 df-dom 8887 df-sdom 8888 |
| This theorem is referenced by: sdomen1 9051 sucxpdom 9163 isfinite2 9200 pm54.43 9915 infxpenlem 9925 alephnbtwn2 9984 alephordi 9986 alephsucdom 9991 pwsdompw 10115 infunsdom1 10124 cflim2 10175 fin23lem27 10240 cfpwsdom 10497 inawinalem 10602 inar1 10688 tskcard 10694 tskuni 10696 rpnnen 16154 resdomq 16171 aleph1re 16172 aleph1irr 16173 1nprm 16608 ensucne0OLD 43808 |
| Copyright terms: Public domain | W3C validator |