| 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 9157). (Contributed by BTernaryTau, 25-Nov-2024.) |
| Ref | Expression |
|---|---|
| sdomdomtrfi | ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≺ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sdomdom 9035 | . . 3 ⊢ (𝐴 ≺ 𝐵 → 𝐴 ≼ 𝐵) | |
| 2 | domtrfil 9235 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≼ 𝐶) | |
| 3 | 1, 2 | syl3an2 1182 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≼ 𝐶) |
| 4 | simp1 1154 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐴 ≈ 𝐶) → 𝐴 ∈ Fin) | |
| 5 | ensymfib 9227 | . . . . . . . . . 10 ⊢ (𝐴 ∈ Fin → (𝐴 ≈ 𝐶 ↔ 𝐶 ≈ 𝐴)) | |
| 6 | 5 | biimpa 482 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≈ 𝐶) → 𝐶 ≈ 𝐴) |
| 7 | 6 | 3adant2 1149 | . . . . . . . 8 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐴 ≈ 𝐶) → 𝐶 ≈ 𝐴) |
| 8 | endom 9034 | . . . . . . . . 9 ⊢ (𝐶 ≈ 𝐴 → 𝐶 ≼ 𝐴) | |
| 9 | domtrfir 9237 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐶 ≼ 𝐴) → 𝐵 ≼ 𝐴) | |
| 10 | 8, 9 | syl3an3 1183 | . . . . . . . 8 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐶 ≈ 𝐴) → 𝐵 ≼ 𝐴) |
| 11 | 7, 10 | syld3an3 1437 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐴 ≈ 𝐶) → 𝐵 ≼ 𝐴) |
| 12 | domfi 9232 | . . . . . . . 8 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐴) → 𝐵 ∈ Fin) | |
| 13 | domnsymfi 9243 | . . . . . . . 8 ⊢ ((𝐵 ∈ Fin ∧ 𝐵 ≼ 𝐴) → ¬ 𝐴 ≺ 𝐵) | |
| 14 | 12, 13 | sylancom 600 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐴) → ¬ 𝐴 ≺ 𝐵) |
| 15 | 4, 11, 14 | syl2anc 596 | . . . . . 6 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐴 ≈ 𝐶) → ¬ 𝐴 ≺ 𝐵) |
| 16 | 15 | 3expia 1139 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶) → (𝐴 ≈ 𝐶 → ¬ 𝐴 ≺ 𝐵)) |
| 17 | 16 | con2d 135 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶) → (𝐴 ≺ 𝐵 → ¬ 𝐴 ≈ 𝐶)) |
| 18 | 17 | 3impia 1135 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐴 ≺ 𝐵) → ¬ 𝐴 ≈ 𝐶) |
| 19 | 18 | 3com23 1144 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≼ 𝐶) → ¬ 𝐴 ≈ 𝐶) |
| 20 | brsdom 9029 | . 2 ⊢ (𝐴 ≺ 𝐶 ↔ (𝐴 ≼ 𝐶 ∧ ¬ 𝐴 ≈ 𝐶)) | |
| 21 | 3, 19, 20 | sylanbrc 595 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≺ 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 ∈ wcel 2147 class class class wbr 5106 ≈ cen 8998 ≼ cdom 8999 ≺ csdm 9000 Fincfn 9001 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pr 5395 ax-un 7775 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-om 7902 df-1o 8504 df-en 9002 df-dom 9003 df-sdom 9004 df-fin 9005 |
| This theorem is used by: php3 9252 sucdom 9263 findcard3 9302 infsdomnn 9321 fodomfib 9348 fisdomnn 43488 |
| Copyright terms: Public domain | W3C validator |