| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nndomog | Structured version Visualization version GIF version | ||
| Description: Cardinal ordering agrees with ordinal number ordering when the smaller number is a natural number. Compare with nndomo 9188 when both are natural numbers. (Contributed by NM, 17-Jun-1998.) Generalize from nndomo 9188. (Revised by RP, 5-Nov-2023.) Avoid ax-pow 5324. (Revised by BTernaryTau, 29-Nov-2024.) |
| Ref | Expression |
|---|---|
| nndomog | ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ On) → (𝐴 ≼ 𝐵 ↔ 𝐴 ⊆ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnfi 9138 | . . . . . . 7 ⊢ (𝐴 ∈ ω → 𝐴 ∈ Fin) | |
| 2 | domnsymfi 9170 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≼ 𝐵) → ¬ 𝐵 ≺ 𝐴) | |
| 3 | 1, 2 | sylan 589 | . . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≼ 𝐵) → ¬ 𝐵 ≺ 𝐴) |
| 4 | 3 | ex 416 | . . . . 5 ⊢ (𝐴 ∈ ω → (𝐴 ≼ 𝐵 → ¬ 𝐵 ≺ 𝐴)) |
| 5 | php2 9178 | . . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ⊊ 𝐴) → 𝐵 ≺ 𝐴) | |
| 6 | 5 | ex 416 | . . . . 5 ⊢ (𝐴 ∈ ω → (𝐵 ⊊ 𝐴 → 𝐵 ≺ 𝐴)) |
| 7 | 4, 6 | nsyld 156 | . . . 4 ⊢ (𝐴 ∈ ω → (𝐴 ≼ 𝐵 → ¬ 𝐵 ⊊ 𝐴)) |
| 8 | 7 | adantr 484 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ On) → (𝐴 ≼ 𝐵 → ¬ 𝐵 ⊊ 𝐴)) |
| 9 | nnord 7856 | . . . 4 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
| 10 | eloni 6358 | . . . 4 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
| 11 | ordtri1 6381 | . . . . 5 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ 𝐴)) | |
| 12 | ordelpss 6376 | . . . . . . 7 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (𝐵 ∈ 𝐴 ↔ 𝐵 ⊊ 𝐴)) | |
| 13 | 12 | ancoms 462 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐵 ∈ 𝐴 ↔ 𝐵 ⊊ 𝐴)) |
| 14 | 13 | notbid 320 | . . . . 5 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (¬ 𝐵 ∈ 𝐴 ↔ ¬ 𝐵 ⊊ 𝐴)) |
| 15 | 11, 14 | bitrd 281 | . . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ⊊ 𝐴)) |
| 16 | 9, 10, 15 | syl2an 605 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ⊊ 𝐴)) |
| 17 | 8, 16 | sylibrd 261 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ On) → (𝐴 ≼ 𝐵 → 𝐴 ⊆ 𝐵)) |
| 18 | ssdomfi2 9167 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ On ∧ 𝐴 ⊆ 𝐵) → 𝐴 ≼ 𝐵) | |
| 19 | 18 | 3expia 1135 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 → 𝐴 ≼ 𝐵)) |
| 20 | 1, 19 | sylan 589 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 → 𝐴 ≼ 𝐵)) |
| 21 | 17, 20 | impbid 214 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ On) → (𝐴 ≼ 𝐵 ↔ 𝐴 ⊆ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∈ wcel 2144 ⊆ wss 3906 ⊊ wpss 3907 class class class wbr 5102 Ord word 6347 Oncon0 6348 ωcom 7848 ≼ cdom 8927 ≺ csdm 8928 Fincfn 8929 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pr 5392 ax-un 7720 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3079 df-rex 3089 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5544 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-we 5604 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-om 7849 df-1o 8439 df-en 8930 df-dom 8931 df-sdom 8932 df-fin 8933 |
| This theorem is referenced by: onomeneq 9184 nndomo 9188 harsucnn 9958 |
| Copyright terms: Public domain | W3C validator |