| 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 9031). (Contributed by BTernaryTau, 22-Nov-2024.) |
| Ref | Expression |
|---|---|
| domnsymfi | ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≼ 𝐵) → ¬ 𝐵 ≺ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brdom2 8919 | . 2 ⊢ (𝐴 ≼ 𝐵 ↔ (𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵)) | |
| 2 | sdomnen 8918 | . . . . 5 ⊢ (𝐴 ≺ 𝐵 → ¬ 𝐴 ≈ 𝐵) | |
| 3 | 2 | adantl 481 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵) → ¬ 𝐴 ≈ 𝐵) |
| 4 | sdomdom 8917 | . . . . . . 7 ⊢ (𝐴 ≺ 𝐵 → 𝐴 ≼ 𝐵) | |
| 5 | sdomdom 8917 | . . . . . . . 8 ⊢ (𝐵 ≺ 𝐴 → 𝐵 ≼ 𝐴) | |
| 6 | sbthfi 9123 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐴 ∧ 𝐴 ≼ 𝐵) → 𝐵 ≈ 𝐴) | |
| 7 | ensymfib 9108 | . . . . . . . . . 10 ⊢ (𝐴 ∈ Fin → (𝐴 ≈ 𝐵 ↔ 𝐵 ≈ 𝐴)) | |
| 8 | 7 | 3ad2ant1 1133 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐴 ∧ 𝐴 ≼ 𝐵) → (𝐴 ≈ 𝐵 ↔ 𝐵 ≈ 𝐴)) |
| 9 | 6, 8 | mpbird 257 | . . . . . . . 8 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐴 ∧ 𝐴 ≼ 𝐵) → 𝐴 ≈ 𝐵) |
| 10 | 5, 9 | syl3an2 1164 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≺ 𝐴 ∧ 𝐴 ≼ 𝐵) → 𝐴 ≈ 𝐵) |
| 11 | 4, 10 | syl3an3 1165 | . . . . . 6 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≺ 𝐴 ∧ 𝐴 ≺ 𝐵) → 𝐴 ≈ 𝐵) |
| 12 | 11 | 3com23 1126 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≺ 𝐴) → 𝐴 ≈ 𝐵) |
| 13 | 12 | 3expa 1118 | . . . 4 ⊢ (((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵) ∧ 𝐵 ≺ 𝐴) → 𝐴 ≈ 𝐵) |
| 14 | 3, 13 | mtand 815 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≺ 𝐵) → ¬ 𝐵 ≺ 𝐴) |
| 15 | sdomnen 8918 | . . . 4 ⊢ (𝐵 ≺ 𝐴 → ¬ 𝐵 ≈ 𝐴) | |
| 16 | 7 | biimpa 476 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≈ 𝐵) → 𝐵 ≈ 𝐴) |
| 17 | 15, 16 | nsyl3 138 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≈ 𝐵) → ¬ 𝐵 ≺ 𝐴) |
| 18 | 14, 17 | jaodan 959 | . 2 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵)) → ¬ 𝐵 ≺ 𝐴) |
| 19 | 1, 18 | sylan2b 594 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≼ 𝐵) → ¬ 𝐵 ≺ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 ∈ wcel 2113 class class class wbr 5098 ≈ cen 8880 ≼ cdom 8881 ≺ csdm 8882 Fincfn 8883 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-om 7809 df-1o 8397 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 |
| This theorem is referenced by: sdomdomtrfi 9125 domsdomtrfi 9126 nndomog 9137 onomeneq 9138 |
| Copyright terms: Public domain | W3C validator |