| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sdomen1 | Structured version Visualization version GIF version | ||
| Description: Equality-like theorem for equinumerosity and strict dominance. (Contributed by NM, 8-Nov-2003.) |
| Ref | Expression |
|---|---|
| sdomen1 | ⊢ (𝐴 ≈ 𝐵 → (𝐴 ≺ 𝐶 ↔ 𝐵 ≺ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ensym 9008 | . . 3 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ≈ 𝐴) | |
| 2 | ensdomtr 9110 | . . 3 ⊢ ((𝐵 ≈ 𝐴 ∧ 𝐴 ≺ 𝐶) → 𝐵 ≺ 𝐶) | |
| 3 | 1, 2 | sylan 592 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐴 ≺ 𝐶) → 𝐵 ≺ 𝐶) |
| 4 | ensdomtr 9110 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐵 ≺ 𝐶) → 𝐴 ≺ 𝐶) | |
| 5 | 3, 4 | impbida 813 | 1 ⊢ (𝐴 ≈ 𝐵 → (𝐴 ≺ 𝐶 ↔ 𝐵 ≺ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 class class class wbr 5102 ≈ cen 8948 ≺ csdm 8950 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-pow 5326 ax-pr 5390 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-er 8695 df-en 8952 df-dom 8953 df-sdom 8954 |
| This theorem is used by: isfiniteg 9270 djufi 10236 alephval2 10628 engch 10684 |
| Copyright terms: Public domain | W3C validator |