| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > zz12s | Structured version Visualization version GIF version | ||
| Description: A surreal integer is a dyadic fraction. (Contributed by Scott Fenton, 7-Aug-2025.) |
| Ref | Expression |
|---|---|
| zz12s | ⊢ (𝐴 ∈ ℤs → 𝐴 ∈ ℤs[1/2]) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2no 28810 | . . . . . 6 ⊢ 2s ∈ No | |
| 2 | exps0 28818 | . . . . . 6 ⊢ (2s ∈ No → (2s↑s 0s ) = 1s ) | |
| 3 | 1, 2 | ax-mp 5 | . . . . 5 ⊢ (2s↑s 0s ) = 1s |
| 4 | 3 | oveq2i 7431 | . . . 4 ⊢ (𝐴 /su (2s↑s 0s )) = (𝐴 /su 1s ) |
| 5 | zno 28773 | . . . . 5 ⊢ (𝐴 ∈ ℤs → 𝐴 ∈ No) | |
| 6 | 5 | divs1d 28596 | . . . 4 ⊢ (𝐴 ∈ ℤs → (𝐴 /su 1s ) = 𝐴) |
| 7 | 4, 6 | eqtr2id 2808 | . . 3 ⊢ (𝐴 ∈ ℤs → 𝐴 = (𝐴 /su (2s↑s 0s ))) |
| 8 | 0n0s 28720 | . . . 4 ⊢ 0s ∈ ℕ0s | |
| 9 | oveq1 7427 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 /su (2s↑s𝑦)) = (𝐴 /su (2s↑s𝑦))) | |
| 10 | 9 | eqeq2d 2771 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝐴 = (𝑥 /su (2s↑s𝑦)) ↔ 𝐴 = (𝐴 /su (2s↑s𝑦)))) |
| 11 | oveq2 7428 | . . . . . . 7 ⊢ (𝑦 = 0s → (2s↑s𝑦) = (2s↑s 0s )) | |
| 12 | 11 | oveq2d 7436 | . . . . . 6 ⊢ (𝑦 = 0s → (𝐴 /su (2s↑s𝑦)) = (𝐴 /su (2s↑s 0s ))) |
| 13 | 12 | eqeq2d 2771 | . . . . 5 ⊢ (𝑦 = 0s → (𝐴 = (𝐴 /su (2s↑s𝑦)) ↔ 𝐴 = (𝐴 /su (2s↑s 0s )))) |
| 14 | 10, 13 | rspc2ev 3588 | . . . 4 ⊢ ((𝐴 ∈ ℤs ∧ 0s ∈ ℕ0s ∧ 𝐴 = (𝐴 /su (2s↑s 0s ))) → ∃𝑥 ∈ ℤs ∃𝑦 ∈ ℕ0s 𝐴 = (𝑥 /su (2s↑s𝑦))) |
| 15 | 8, 14 | mp3an2 1478 | . . 3 ⊢ ((𝐴 ∈ ℤs ∧ 𝐴 = (𝐴 /su (2s↑s 0s ))) → ∃𝑥 ∈ ℤs ∃𝑦 ∈ ℕ0s 𝐴 = (𝑥 /su (2s↑s𝑦))) |
| 16 | 7, 15 | mpdan 700 | . 2 ⊢ (𝐴 ∈ ℤs → ∃𝑥 ∈ ℤs ∃𝑦 ∈ ℕ0s 𝐴 = (𝑥 /su (2s↑s𝑦))) |
| 17 | elz12s 28863 | . 2 ⊢ (𝐴 ∈ ℤs[1/2] ↔ ∃𝑥 ∈ ℤs ∃𝑦 ∈ ℕ0s 𝐴 = (𝑥 /su (2s↑s𝑦))) | |
| 18 | 16, 17 | sylibr 237 | 1 ⊢ (𝐴 ∈ ℤs → 𝐴 ∈ ℤs[1/2]) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 ∃wrex 3086 (class class class)co 7420 Nocsur 28002 0s c0s 28196 1s c1s 28197 /su cdivs 28578 ℕ0scn0s 28703 ℤsczs 28769 2sc2s 28801 ↑scexps 28803 ℤs[1/2]cz12s 28805 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-ot 4858 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-2o 8480 df-nadd 8678 df-no 28005 df-lts 28006 df-bday 28007 df-les 28107 df-slts 28149 df-cuts 28151 df-0s 28198 df-1s 28199 df-made 28218 df-old 28219 df-left 28221 df-right 28222 df-norec 28329 df-norec2 28340 df-adds 28351 df-negs 28412 df-subs 28413 df-muls 28498 df-divs 28579 df-seqs 28675 df-n0s 28705 df-nns 28706 df-zs 28770 df-2s 28802 df-exps 28804 df-z12s 28806 |
| This theorem is used by: bdayfinlem 28877 |
| Copyright terms: Public domain | W3C validator |