| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > n0cutlt | Structured version Visualization version GIF version | ||
| Description: A non-negative surreal integer is the simplest number greater than all previous non-negative surreal integers. (Contributed by Scott Fenton, 7-Nov-2025.) |
| Ref | Expression |
|---|---|
| n0cutlt | ⊢ (𝐴 ∈ ℕ0s → 𝐴 = ({𝑥 ∈ ℕ0s ∣ 𝑥 <s 𝐴} |s ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0on 28540 | . . 3 ⊢ (𝐴 ∈ ℕ0s → 𝐴 ∈ Ons) | |
| 2 | oncutlt 28468 | . . 3 ⊢ (𝐴 ∈ Ons → 𝐴 = ({𝑥 ∈ Ons ∣ 𝑥 <s 𝐴} |s ∅)) | |
| 3 | 1, 2 | syl 18 | . 2 ⊢ (𝐴 ∈ ℕ0s → 𝐴 = ({𝑥 ∈ Ons ∣ 𝑥 <s 𝐴} |s ∅)) |
| 4 | onltn0s 28562 | . . . . . . . . 9 ⊢ ((𝑥 ∈ Ons ∧ 𝐴 ∈ ℕ0s ∧ 𝑥 <s 𝐴) → 𝑥 ∈ ℕ0s) | |
| 5 | 4 | 3expib 1139 | . . . . . . . 8 ⊢ (𝑥 ∈ Ons → ((𝐴 ∈ ℕ0s ∧ 𝑥 <s 𝐴) → 𝑥 ∈ ℕ0s)) |
| 6 | 5 | com12 33 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0s ∧ 𝑥 <s 𝐴) → (𝑥 ∈ Ons → 𝑥 ∈ ℕ0s)) |
| 7 | n0on 28540 | . . . . . . 7 ⊢ (𝑥 ∈ ℕ0s → 𝑥 ∈ Ons) | |
| 8 | 6, 7 | impbid1 228 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ0s ∧ 𝑥 <s 𝐴) → (𝑥 ∈ Ons ↔ 𝑥 ∈ ℕ0s)) |
| 9 | 8 | ex 417 | . . . . 5 ⊢ (𝐴 ∈ ℕ0s → (𝑥 <s 𝐴 → (𝑥 ∈ Ons ↔ 𝑥 ∈ ℕ0s))) |
| 10 | 9 | pm5.32rd 588 | . . . 4 ⊢ (𝐴 ∈ ℕ0s → ((𝑥 ∈ Ons ∧ 𝑥 <s 𝐴) ↔ (𝑥 ∈ ℕ0s ∧ 𝑥 <s 𝐴))) |
| 11 | 10 | rabbidva2 3417 | . . 3 ⊢ (𝐴 ∈ ℕ0s → {𝑥 ∈ Ons ∣ 𝑥 <s 𝐴} = {𝑥 ∈ ℕ0s ∣ 𝑥 <s 𝐴}) |
| 12 | 11 | oveq1d 7427 | . 2 ⊢ (𝐴 ∈ ℕ0s → ({𝑥 ∈ Ons ∣ 𝑥 <s 𝐴} |s ∅) = ({𝑥 ∈ ℕ0s ∣ 𝑥 <s 𝐴} |s ∅)) |
| 13 | 3, 12 | eqtrd 2797 | 1 ⊢ (𝐴 ∈ ℕ0s → 𝐴 = ({𝑥 ∈ ℕ0s ∣ 𝑥 <s 𝐴} |s ∅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1569 ∈ wcel 2142 {crab 3415 ∅c0 4285 class class class wbr 5108 (class class class)co 7412 <s clts 27816 |s ccuts 27963 Onscons 28455 ℕ0scn0s 28516 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-ac2 10453 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4595 df-ot 4597 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-se 5614 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-2o 8452 df-nadd 8650 df-er 8692 df-map 8824 df-en 8942 df-dom 8943 df-fin 8945 df-card 9932 df-acn 9935 df-ac 10107 df-no 27818 df-lts 27819 df-bday 27820 df-les 27920 df-slts 27962 df-cuts 27964 df-0s 28011 df-1s 28012 df-made 28031 df-old 28032 df-new 28033 df-left 28034 df-right 28035 df-norec 28142 df-norec2 28153 df-adds 28164 df-negs 28225 df-subs 28226 df-ons 28456 df-n0s 28518 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |