| 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 9212 when both are natural numbers. (Contributed by NM, 17-Jun-1998.) Generalize from nndomo 9212. (Revised by RP, 5-Nov-2023.) Avoid ax-pow 5327. (Revised by BTernaryTau, 29-Nov-2024.) |
| Ref | Expression |
|---|---|
| nndomog | ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ On) → (𝐴 ≼ 𝐵 ↔ 𝐴 ⊆ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnfi 9162 | . . . . . . 7 ⊢ (𝐴 ∈ ω → 𝐴 ∈ Fin) | |
| 2 | domnsymfi 9194 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≼ 𝐵) → ¬ 𝐵 ≺ 𝐴) | |
| 3 | 1, 2 | sylan 592 | . . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≼ 𝐵) → ¬ 𝐵 ≺ 𝐴) |
| 4 | 3 | ex 418 | . . . . 5 ⊢ (𝐴 ∈ ω → (𝐴 ≼ 𝐵 → ¬ 𝐵 ≺ 𝐴)) |
| 5 | php2 9202 | . . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ⊊ 𝐴) → 𝐵 ≺ 𝐴) | |
| 6 | 5 | ex 418 | . . . . 5 ⊢ (𝐴 ∈ ω → (𝐵 ⊊ 𝐴 → 𝐵 ≺ 𝐴)) |
| 7 | 4, 6 | nsyld 157 | . . . 4 ⊢ (𝐴 ∈ ω → (𝐴 ≼ 𝐵 → ¬ 𝐵 ⊊ 𝐴)) |
| 8 | 7 | adantr 486 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ On) → (𝐴 ≼ 𝐵 → ¬ 𝐵 ⊊ 𝐴)) |
| 9 | nnord 7869 | . . . 4 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
| 10 | eloni 6362 | . . . 4 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
| 11 | ordtri1 6386 | . . . . 5 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ 𝐴)) | |
| 12 | ordelpss 6380 | . . . . . . 7 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (𝐵 ∈ 𝐴 ↔ 𝐵 ⊊ 𝐴)) | |
| 13 | 12 | ancoms 464 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐵 ∈ 𝐴 ↔ 𝐵 ⊊ 𝐴)) |
| 14 | 13 | notbid 321 | . . . . 5 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (¬ 𝐵 ∈ 𝐴 ↔ ¬ 𝐵 ⊊ 𝐴)) |
| 15 | 11, 14 | bitrd 282 | . . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ⊊ 𝐴)) |
| 16 | 9, 10, 15 | syl2an 608 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ⊊ 𝐴)) |
| 17 | 8, 16 | sylibrd 262 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ On) → (𝐴 ≼ 𝐵 → 𝐴 ⊆ 𝐵)) |
| 18 | ssdomfi2 9191 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ On ∧ 𝐴 ⊆ 𝐵) → 𝐴 ≼ 𝐵) | |
| 19 | 18 | 3expia 1139 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 → 𝐴 ≼ 𝐵)) |
| 20 | 1, 19 | sylan 592 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 → 𝐴 ≼ 𝐵)) |
| 21 | 17, 20 | impbid 215 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ On) → (𝐴 ≼ 𝐵 ↔ 𝐴 ⊆ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2145 ⊆ wss 3899 ⊊ wpss 3900 class class class wbr 5103 Ord word 6351 Oncon0 6352 ωcom 7861 ≼ cdom 8950 ≺ csdm 8951 Fincfn 8952 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7735 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-om 7862 df-1o 8455 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 |
| This theorem is used by: onomeneq 9208 nndomo 9212 harsucnn 10036 |
| Copyright terms: Public domain | W3C validator |