| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > domnsymfi | Structured version Visualization version GIF version | ||
| Description: If a set dominates a finite set, it cannot also be strictly dominated by the finite set. This theorem is proved without using the Axiom of Power Sets (unlike domnsym 9098). (Contributed by BTernaryTau, 22-Nov-2024.) |
| Ref | Expression |
|---|---|
| domnsymfi | ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≼ 𝐵) → ¬ 𝐵 ≺ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brdom2 8985 | . 2 ⊢ (𝐴 ≼ 𝐵 ↔ (𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵)) | |
| 2 | sdomnen 8984 | . . . . 5 ⊢ (𝐴 ≺ 𝐵 → ¬ 𝐴 ≈ 𝐵) | |
| 3 | 2 | adantl 487 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵) → ¬ 𝐴 ≈ 𝐵) |
| 4 | sdomdom 8983 | . . . . . . 7 ⊢ (𝐴 ≺ 𝐵 → 𝐴 ≼ 𝐵) | |
| 5 | sdomdom 8983 | . . . . . . . 8 ⊢ (𝐵 ≺ 𝐴 → 𝐵 ≼ 𝐴) | |
| 6 | sbthfi 9190 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐴 ∧ 𝐴 ≼ 𝐵) → 𝐵 ≈ 𝐴) | |
| 7 | ensymfib 9175 | . . . . . . . . . 10 ⊢ (𝐴 ∈ Fin → (𝐴 ≈ 𝐵 ↔ 𝐵 ≈ 𝐴)) | |
| 8 | 7 | 3ad2ant1 1151 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐴 ∧ 𝐴 ≼ 𝐵) → (𝐴 ≈ 𝐵 ↔ 𝐵 ≈ 𝐴)) |
| 9 | 6, 8 | mpbird 260 | . . . . . . . 8 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐴 ∧ 𝐴 ≼ 𝐵) → 𝐴 ≈ 𝐵) |
| 10 | 5, 9 | syl3an2 1182 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≺ 𝐴 ∧ 𝐴 ≼ 𝐵) → 𝐴 ≈ 𝐵) |
| 11 | 4, 10 | syl3an3 1183 | . . . . . 6 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≺ 𝐴 ∧ 𝐴 ≺ 𝐵) → 𝐴 ≈ 𝐵) |
| 12 | 11 | 3com23 1144 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≺ 𝐴) → 𝐴 ≈ 𝐵) |
| 13 | 12 | 3expa 1136 | . . . 4 ⊢ (((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵) ∧ 𝐵 ≺ 𝐴) → 𝐴 ≈ 𝐵) |
| 14 | 3, 13 | mtand 828 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵) → ¬ 𝐵 ≺ 𝐴) |
| 15 | sdomnen 8984 | . . . 4 ⊢ (𝐵 ≺ 𝐴 → ¬ 𝐵 ≈ 𝐴) | |
| 16 | 7 | biimpa 482 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≈ 𝐵) → 𝐵 ≈ 𝐴) |
| 17 | 15, 16 | nsyl3 139 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≈ 𝐵) → ¬ 𝐵 ≺ 𝐴) |
| 18 | 14, 17 | jaodan 972 | . 2 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵)) → ¬ 𝐵 ≺ 𝐴) |
| 19 | 1, 18 | sylan2b 606 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≼ 𝐵) → ¬ 𝐵 ≺ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 ∈ wcel 2146 class class class wbr 5111 ≈ cen 8946 ≼ cdom 8947 ≺ csdm 8948 Fincfn 8949 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-un 7742 |
| 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 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-om 7869 df-1o 8459 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 |
| This theorem is used by: sdomdomtrfi 9192 domsdomtrfi 9193 nndomog 9204 onomeneq 9205 |
| Copyright terms: Public domain | W3C validator |