| 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 9030 | . . 3 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ≈ 𝐴) | |
| 2 | endomtr 9039 | . . 3 ⊢ ((𝐵 ≈ 𝐴 ∧ 𝐴 ≼ 𝐶) → 𝐵 ≼ 𝐶) | |
| 3 | 1, 2 | sylan 592 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐴 ≼ 𝐶) → 𝐵 ≼ 𝐶) |
| 4 | endomtr 9039 | . 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 5103 ≈ cen 8970 ≼ cdom 8971 |
| 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 2733 ax-sep 5249 ax-pow 5327 ax-pr 5391 ax-un 7751 |
| 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 2565 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-er 8717 df-en 8974 df-dom 8975 |
| This theorem is used by: unxpwdom2 9582 carddomi2 10051 djudom2 10262 djuinf 10267 djulepw 10271 pwdjudom 10293 gchpwdom 10755 hargch 10758 dis2ndc 23779 isinf2 38328 fisdomnn 43295 |
| Copyright terms: Public domain | W3C validator |