| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > domen1 | Structured version Visualization version GIF version | ||
| Description: Equality-like theorem for equinumerosity and dominance. (Contributed by NM, 8-Nov-2003.) |
| Ref | Expression |
|---|---|
| domen1 | ⊢ (𝐴 ≈ 𝐵 → (𝐴 ≼ 𝐶 ↔ 𝐵 ≼ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ensym 8944 | . . 3 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ≈ 𝐴) | |
| 2 | endomtr 8953 | . . 3 ⊢ ((𝐵 ≈ 𝐴 ∧ 𝐴 ≼ 𝐶) → 𝐵 ≼ 𝐶) | |
| 3 | 1, 2 | sylan 581 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐴 ≼ 𝐶) → 𝐵 ≼ 𝐶) |
| 4 | endomtr 8953 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≼ 𝐶) | |
| 5 | 3, 4 | impbida 801 | 1 ⊢ (𝐴 ≈ 𝐵 → (𝐴 ≼ 𝐶 ↔ 𝐵 ≼ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 class class class wbr 5086 ≈ cen 8884 ≼ cdom 8885 |
| 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 2185 ax-ext 2709 ax-sep 5232 ax-pow 5303 ax-pr 5371 ax-un 7683 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-er 8637 df-en 8888 df-dom 8889 |
| This theorem is referenced by: unxpwdom2 9497 carddomi2 9888 djudom2 10100 djuinf 10105 djulepw 10109 pwdjudom 10131 gchpwdom 10587 hargch 10590 dis2ndc 23438 isinf2 37738 fisdomnn 42700 |
| Copyright terms: Public domain | W3C validator |