| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > bdayfinbnd | Structured version Visualization version GIF version | ||
| Description: Given a non-negative integer and a non-negative surreal of lesser or equal birthday, show that the surreal can be expressed as a dyadic fraction with an upper bound on the integer and exponent. This proof follows the proof from Mizar at https://mizar.uwb.edu.pl/version/current/html/surrealn.html. (Contributed by Scott Fenton, 26-Feb-2026.) |
| Ref | Expression |
|---|---|
| bdayfinbnd.1 | ⊢ (𝜑 → 𝑁 ∈ ℕ0s) |
| bdayfinbnd.2 | ⊢ (𝜑 → 𝑍 ∈ No) |
| bdayfinbnd.3 | ⊢ (𝜑 → (bday‘𝑍) ⊆ (bday‘𝑁)) |
| bdayfinbnd.4 | ⊢ (𝜑 → 0s ≤s 𝑍) |
| Ref | Expression |
|---|---|
| bdayfinbnd | ⊢ (𝜑 → (𝑍 = 𝑁 ∨ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑍 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bdayfinbnd.3 | . 2 ⊢ (𝜑 → (bday‘𝑍) ⊆ (bday‘𝑁)) | |
| 2 | bdayfinbnd.4 | . 2 ⊢ (𝜑 → 0s ≤s 𝑍) | |
| 3 | fveq2 6915 | . . . . . 6 ⊢ (𝑧 = 𝑍 → (bday‘𝑧) = (bday‘𝑍)) | |
| 4 | 3 | sseq1d 3943 | . . . . 5 ⊢ (𝑧 = 𝑍 → ((bday‘𝑧) ⊆ (bday‘𝑁) ↔ (bday‘𝑍) ⊆ (bday‘𝑁))) |
| 5 | breq2 5111 | . . . . 5 ⊢ (𝑧 = 𝑍 → ( 0s ≤s 𝑧 ↔ 0s ≤s 𝑍)) | |
| 6 | 4, 5 | anbi12d 644 | . . . 4 ⊢ (𝑧 = 𝑍 → (((bday‘𝑧) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑧) ↔ ((bday‘𝑍) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑍))) |
| 7 | eqeq1 2770 | . . . . 5 ⊢ (𝑧 = 𝑍 → (𝑧 = 𝑁 ↔ 𝑍 = 𝑁)) | |
| 8 | eqeq1 2770 | . . . . . . . 8 ⊢ (𝑧 = 𝑍 → (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ↔ 𝑍 = (𝑥 +s (𝑦 /su (2s↑s𝑝))))) | |
| 9 | 8 | 3anbi1d 1471 | . . . . . . 7 ⊢ (𝑧 = 𝑍 → ((𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁) ↔ (𝑍 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁))) |
| 10 | 9 | rexbidv 3193 | . . . . . 6 ⊢ (𝑧 = 𝑍 → (∃𝑝 ∈ ℕ0s (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁) ↔ ∃𝑝 ∈ ℕ0s (𝑍 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁))) |
| 11 | 10 | 2rexbidv 3231 | . . . . 5 ⊢ (𝑧 = 𝑍 → (∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁) ↔ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑍 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁))) |
| 12 | 7, 11 | orbi12d 932 | . . . 4 ⊢ (𝑧 = 𝑍 → ((𝑧 = 𝑁 ∨ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁)) ↔ (𝑍 = 𝑁 ∨ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑍 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁)))) |
| 13 | 6, 12 | imbi12d 347 | . . 3 ⊢ (𝑧 = 𝑍 → ((((bday‘𝑧) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑧) → (𝑧 = 𝑁 ∨ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁))) ↔ (((bday‘𝑍) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑍) → (𝑍 = 𝑁 ∨ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑍 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁))))) |
| 14 | bdayfinbnd.1 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ0s) | |
| 15 | bdayfinbndlem2 28913 | . . . 4 ⊢ (𝑁 ∈ ℕ0s → ∀𝑧 ∈ No (((bday‘𝑧) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑧) → (𝑧 = 𝑁 ∨ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁)))) | |
| 16 | 14, 15 | syl 18 | . . 3 ⊢ (𝜑 → ∀𝑧 ∈ No (((bday‘𝑧) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑧) → (𝑧 = 𝑁 ∨ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁)))) |
| 17 | bdayfinbnd.2 | . . 3 ⊢ (𝜑 → 𝑍 ∈ No) | |
| 18 | 13, 16, 17 | rspcdva 3580 | . 2 ⊢ (𝜑 → (((bday‘𝑍) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑍) → (𝑍 = 𝑁 ∨ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑍 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁)))) |
| 19 | 1, 2, 18 | mp2and 712 | 1 ⊢ (𝜑 → (𝑍 = 𝑁 ∨ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑍 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 ∧ w3a 1104 = wceq 1572 ∈ wcel 2150 ∀wral 3083 ∃wrex 3093 ⊆ wss 3899 class class class wbr 5107 ‘cfv 6565 (class class class)co 7450 Nocsur 28056 <s clts 28057 bdaycbday 28058 ≤s cles 28160 0s c0s 28250 +s cadds 28404 /su cdivs 28632 ℕ0scn0s 28757 2sc2s 28855 ↑scexps 28857 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-dc 10562 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4840 df-ot 4863 df-uni 4872 df-int 4912 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-se 5611 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-isom 6574 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-2o 8514 df-oadd 8517 df-nadd 8712 df-en 9011 df-dom 9012 df-fin 9014 df-no 28059 df-lts 28060 df-bday 28061 df-les 28161 df-slts 28203 df-cuts 28205 df-0s 28252 df-1s 28253 df-made 28272 df-old 28273 df-left 28275 df-right 28276 df-norec 28383 df-norec2 28394 df-adds 28405 df-negs 28466 df-subs 28467 df-muls 28552 df-divs 28633 df-ons 28697 df-seqs 28729 df-n0s 28759 df-nns 28760 df-zs 28824 df-2s 28856 df-exps 28858 |
| This theorem is used by: bdayfinlem 28931 |
| Copyright terms: Public domain | W3C validator |