| 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 9037 | . . 3 ⊢ ((𝐶 ≺ 𝐴 ∧ 𝐴 ≈ 𝐵) → 𝐶 ≺ 𝐵) | |
| 2 | 1 | ancoms 458 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≺ 𝐴) → 𝐶 ≺ 𝐵) |
| 3 | ensym 8938 | . . 3 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ≈ 𝐴) | |
| 4 | sdomentr 9037 | . . . 4 ⊢ ((𝐶 ≺ 𝐵 ∧ 𝐵 ≈ 𝐴) → 𝐶 ≺ 𝐴) | |
| 5 | 4 | ancoms 458 | . . 3 ⊢ ((𝐵 ≈ 𝐴 ∧ 𝐶 ≺ 𝐵) → 𝐶 ≺ 𝐴) |
| 6 | 3, 5 | sylan 580 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≺ 𝐵) → 𝐶 ≺ 𝐴) |
| 7 | 2, 6 | impbida 800 | 1 ⊢ (𝐴 ≈ 𝐵 → (𝐶 ≺ 𝐴 ↔ 𝐶 ≺ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 class class class wbr 5096 ≈ cen 8878 ≺ csdm 8880 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 |
| This theorem is referenced by: djuxpdom 10094 alephval2 10481 engch 10537 canthp1lem2 10562 hargch 10582 alephgch 10583 ovoliunnfl 37802 |
| Copyright terms: Public domain | W3C validator |