| 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 9098). (Contributed by BTernaryTau, 25-Nov-2024.) |
| Ref | Expression |
|---|---|
| sdomdomtrfi | ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≺ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sdomdom 8977 | . . 3 ⊢ (𝐴 ≺ 𝐵 → 𝐴 ≼ 𝐵) | |
| 2 | domtrfil 9176 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≼ 𝐶) | |
| 3 | 1, 2 | syl3an2 1180 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≼ 𝐶) |
| 4 | simp1 1152 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐴 ≈ 𝐶) → 𝐴 ∈ Fin) | |
| 5 | ensymfib 9168 | . . . . . . . . . 10 ⊢ (𝐴 ∈ Fin → (𝐴 ≈ 𝐶 ↔ 𝐶 ≈ 𝐴)) | |
| 6 | 5 | biimpa 481 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≈ 𝐶) → 𝐶 ≈ 𝐴) |
| 7 | 6 | 3adant2 1147 | . . . . . . . 8 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐴 ≈ 𝐶) → 𝐶 ≈ 𝐴) |
| 8 | endom 8976 | . . . . . . . . 9 ⊢ (𝐶 ≈ 𝐴 → 𝐶 ≼ 𝐴) | |
| 9 | domtrfir 9178 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐶 ≼ 𝐴) → 𝐵 ≼ 𝐴) | |
| 10 | 8, 9 | syl3an3 1181 | . . . . . . . 8 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐶 ≈ 𝐴) → 𝐵 ≼ 𝐴) |
| 11 | 7, 10 | syld3an3 1434 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐴 ≈ 𝐶) → 𝐵 ≼ 𝐴) |
| 12 | domfi 9173 | . . . . . . . 8 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐴) → 𝐵 ∈ Fin) | |
| 13 | domnsymfi 9184 | . . . . . . . 8 ⊢ ((𝐵 ∈ Fin ∧ 𝐵 ≼ 𝐴) → ¬ 𝐴 ≺ 𝐵) | |
| 14 | 12, 13 | sylancom 599 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐴) → ¬ 𝐴 ≺ 𝐵) |
| 15 | 4, 11, 14 | syl2anc 595 | . . . . . 6 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐴 ≈ 𝐶) → ¬ 𝐴 ≺ 𝐵) |
| 16 | 15 | 3expia 1137 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶) → (𝐴 ≈ 𝐶 → ¬ 𝐴 ≺ 𝐵)) |
| 17 | 16 | con2d 135 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶) → (𝐴 ≺ 𝐵 → ¬ 𝐴 ≈ 𝐶)) |
| 18 | 17 | 3impia 1133 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐶 ∧ 𝐴 ≺ 𝐵) → ¬ 𝐴 ≈ 𝐶) |
| 19 | 18 | 3com23 1142 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≼ 𝐶) → ¬ 𝐴 ≈ 𝐶) |
| 20 | brsdom 8971 | . 2 ⊢ (𝐴 ≺ 𝐶 ↔ (𝐴 ≼ 𝐶 ∧ ¬ 𝐴 ≈ 𝐶)) | |
| 21 | 3, 19, 20 | sylanbrc 594 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≺ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∧ w3a 1101 ∈ wcel 2149 class class class wbr 5111 ≈ cen 8940 ≼ cdom 8941 ≺ csdm 8942 Fincfn 8943 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5259 ax-nul 5271 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5112 df-opab 5176 df-tr 5221 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-om 7863 df-1o 8453 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 |
| This theorem is referenced by: php3 9193 sucdom 9204 findcard3 9243 infsdomnn 9261 fodomfib 9288 fisdomnn 42937 |
| Copyright terms: Public domain | W3C validator |