| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sdomdomtrfi | Structured version Visualization version GIF version | ||
| Description: Transitivity of strict dominance and dominance when 𝐴 is finite, proved without using the Axiom of Power Sets (unlike sdomdomtr 9042). (Contributed by BTernaryTau, 25-Nov-2024.) |
| Ref | Expression |
|---|---|
| sdomdomtrfi | ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≺ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sdomdom 8921 | . . 3 ⊢ (𝐴 ≺ 𝐵 → 𝐴 ≼ 𝐵) | |
| 2 | domtrfil 9120 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≼ 𝐶) | |
| 3 | 1, 2 | syl3an2 1171 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≼ 𝐶) |
| 4 | simp1 1143 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐴 ≈ 𝐶) → 𝐴 ∈ Fin) | |
| 5 | ensymfib 9112 | . . . . . . . . . 10 ⊢ (𝐴 ∈ Fin → (𝐴 ≈ 𝐶 ↔ 𝐶 ≈ 𝐴)) | |
| 6 | 5 | biimpa 478 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≈ 𝐶) → 𝐶 ≈ 𝐴) |
| 7 | 6 | 3adant2 1138 | . . . . . . . 8 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐴 ≈ 𝐶) → 𝐶 ≈ 𝐴) |
| 8 | endom 8920 | . . . . . . . . 9 ⊢ (𝐶 ≈ 𝐴 → 𝐶 ≼ 𝐴) | |
| 9 | domtrfir 9122 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐶 ≼ 𝐴) → 𝐵 ≼ 𝐴) | |
| 10 | 8, 9 | syl3an3 1172 | . . . . . . . 8 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐶 ≈ 𝐴) → 𝐵 ≼ 𝐴) |
| 11 | 7, 10 | syld3an3 1418 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐴 ≈ 𝐶) → 𝐵 ≼ 𝐴) |
| 12 | domfi 9117 | . . . . . . . 8 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐴) → 𝐵 ∈ Fin) | |
| 13 | domnsymfi 9128 | . . . . . . . 8 ⊢ ((𝐵 ∈ Fin ∧ 𝐵 ≼ 𝐴) → ¬ 𝐴 ≺ 𝐵) | |
| 14 | 12, 13 | sylancom 595 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐴) → ¬ 𝐴 ≺ 𝐵) |
| 15 | 4, 11, 14 | syl2anc 591 | . . . . . 6 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐴 ≈ 𝐶) → ¬ 𝐴 ≺ 𝐵) |
| 16 | 15 | 3expia 1128 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶) → (𝐴 ≈ 𝐶 → ¬ 𝐴 ≺ 𝐵)) |
| 17 | 16 | con2d 134 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶) → (𝐴 ≺ 𝐵 → ¬ 𝐴 ≈ 𝐶)) |
| 18 | 17 | 3impia 1124 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐴 ≺ 𝐵) → ¬ 𝐴 ≈ 𝐶) |
| 19 | 18 | 3com23 1133 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≼ 𝐶) → ¬ 𝐴 ≈ 𝐶) |
| 20 | brsdom 8915 | . 2 ⊢ (𝐴 ≺ 𝐶 ↔ (𝐴 ≼ 𝐶 ∧ ¬ 𝐴 ≈ 𝐶)) | |
| 21 | 3, 19, 20 | sylanbrc 590 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≺ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 ∧ w3a 1093 ∈ wcel 2121 class class class wbr 5075 ≈ cen 8884 ≼ cdom 8885 ≺ csdm 8886 Fincfn 8887 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5221 ax-nul 5231 ax-pr 5365 ax-un 7682 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-br 5076 df-opab 5138 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-om 7811 df-1o 8399 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 |
| This theorem is referenced by: php3 9137 sucdom 9148 findcard3 9187 infsdomnn 9205 fodomfib 9233 fisdomnn 42743 |
| Copyright terms: Public domain | W3C validator |