| 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 28838 | . . . . . 6 ⊢ 2s ∈ No | |
| 2 | exps0 28846 | . . . . . 6 ⊢ (2s ∈ No → (2s↑s 0s ) = 1s ) | |
| 3 | 1, 2 | ax-mp 5 | . . . . 5 ⊢ (2s↑s 0s ) = 1s |
| 4 | 3 | oveq2i 7457 | . . . 4 ⊢ (𝐴 /su (2s↑s 0s )) = (𝐴 /su 1s ) |
| 5 | zno 28801 | . . . . 5 ⊢ (𝐴 ∈ ℤs → 𝐴 ∈ No) | |
| 6 | 5 | divs1d 28624 | . . . 4 ⊢ (𝐴 ∈ ℤs → (𝐴 /su 1s ) = 𝐴) |
| 7 | 4, 6 | eqtr2id 2811 | . . 3 ⊢ (𝐴 ∈ ℤs → 𝐴 = (𝐴 /su (2s↑s 0s ))) |
| 8 | 0n0s 28748 | . . . 4 ⊢ 0s ∈ ℕ0s | |
| 9 | oveq1 7453 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 /su (2s↑s𝑦)) = (𝐴 /su (2s↑s𝑦))) | |
| 10 | 9 | eqeq2d 2774 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝐴 = (𝑥 /su (2s↑s𝑦)) ↔ 𝐴 = (𝐴 /su (2s↑s𝑦)))) |
| 11 | oveq2 7454 | . . . . . . 7 ⊢ (𝑦 = 0s → (2s↑s𝑦) = (2s↑s 0s )) | |
| 12 | 11 | oveq2d 7462 | . . . . . 6 ⊢ (𝑦 = 0s → (𝐴 /su (2s↑s𝑦)) = (𝐴 /su (2s↑s 0s ))) |
| 13 | 12 | eqeq2d 2774 | . . . . 5 ⊢ (𝑦 = 0s → (𝐴 = (𝐴 /su (2s↑s𝑦)) ↔ 𝐴 = (𝐴 /su (2s↑s 0s )))) |
| 14 | 10, 13 | rspc2ev 3592 | . . . 4 ⊢ ((𝐴 ∈ ℤs ∧ 0s ∈ ℕ0s ∧ 𝐴 = (𝐴 /su (2s↑s 0s ))) → ∃𝑥 ∈ ℤs ∃𝑦 ∈ ℕ0s 𝐴 = (𝑥 /su (2s↑s𝑦))) |
| 15 | 8, 14 | mp3an2 1479 | . . 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 28891 | . 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 1570 ∈ wcel 2147 ∃wrex 3090 (class class class)co 7446 Nocsur 28030 0s c0s 28224 1s c1s 28225 /su cdivs 28606 ℕ0scn0s 28731 ℤsczs 28797 2sc2s 28829 ↑scexps 28831 ℤs[1/2]cz12s 28833 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-ot 4862 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-se 5610 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-om 7905 df-1st 8028 df-2nd 8029 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-1o 8507 df-2o 8508 df-nadd 8706 df-no 28033 df-lts 28034 df-bday 28035 df-les 28135 df-slts 28177 df-cuts 28179 df-0s 28226 df-1s 28227 df-made 28246 df-old 28247 df-left 28249 df-right 28250 df-norec 28357 df-norec2 28368 df-adds 28379 df-negs 28440 df-subs 28441 df-muls 28526 df-divs 28607 df-seqs 28703 df-n0s 28733 df-nns 28734 df-zs 28798 df-2s 28830 df-exps 28832 df-z12s 28834 |
| This theorem is used by: bdayfinlem 28905 |
| Copyright terms: Public domain | W3C validator |