| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sdomen2 | Structured version Visualization version GIF version | ||
| Description: Equality-like theorem for equinumerosity and strict dominance. (Contributed by NM, 8-Nov-2003.) |
| Ref | Expression |
|---|---|
| sdomen2 | ⊢ (𝐴 ≈ 𝐵 → (𝐶 ≺ 𝐴 ↔ 𝐶 ≺ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sdomentr 9095 | . . 3 ⊢ ((𝐶 ≺ 𝐴 ∧ 𝐴 ≈ 𝐵) → 𝐶 ≺ 𝐵) | |
| 2 | 1 | ancoms 463 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≺ 𝐴) → 𝐶 ≺ 𝐵) |
| 3 | ensym 8996 | . . 3 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ≈ 𝐴) | |
| 4 | sdomentr 9095 | . . . 4 ⊢ ((𝐶 ≺ 𝐵 ∧ 𝐵 ≈ 𝐴) → 𝐶 ≺ 𝐴) | |
| 5 | 4 | ancoms 463 | . . 3 ⊢ ((𝐵 ≈ 𝐴 ∧ 𝐶 ≺ 𝐵) → 𝐶 ≺ 𝐴) |
| 6 | 3, 5 | sylan 591 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≺ 𝐵) → 𝐶 ≺ 𝐴) |
| 7 | 2, 6 | impbida 812 | 1 ⊢ (𝐴 ≈ 𝐵 → (𝐶 ≺ 𝐴 ↔ 𝐶 ≺ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 class class class wbr 5109 ≈ cen 8936 ≺ csdm 8938 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 |
| This theorem is referenced by: djuxpdom 10165 alephval2 10552 engch 10608 canthp1lem2 10633 hargch 10653 alephgch 10654 ovoliunnfl 38313 |
| Copyright terms: Public domain | W3C validator |