MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  z12shalf Structured version   Visualization version   GIF version

Theorem z12shalf 28848
Description: Half of a dyadic is a dyadic. (Contributed by Scott Fenton, 11-Dec-2025.)
Assertion
Ref Expression
z12shalf (𝐴 ∈ ℤs[1/2] → (𝐴 /su 2s) ∈ ℤs[1/2])

Proof of Theorem z12shalf
Dummy variables 𝑎 𝑏 𝑛 𝑚 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elz12s 28840 . 2 (𝐴 ∈ ℤs[1/2] ↔ ∃𝑎 ∈ ℤs ∃𝑛 ∈ ℕ0s 𝐴 = (𝑎 /su (2s↑s𝑛)))
2 2no 28787 . . . . . . . 8 2s ∈ No
3 exps1 28796 . . . . . . . 8 (2s ∈ No → (2s↑s 1s ) = 2s)
42, 3ax-mp 5 . . . . . . 7 (2s↑s 1s ) = 2s
54oveq2i 7423 . . . . . 6 ((𝑎 /su (2s↑s𝑛)) /su (2s↑s 1s )) = ((𝑎 /su (2s↑s𝑛)) /su 2s)
6 zno 28750 . . . . . . . . . 10 (𝑎 ∈ ℤs → 𝑎 ∈ No )
76adantr 486 . . . . . . . . 9 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 𝑎 ∈ No )
8 simpr 490 . . . . . . . . 9 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 𝑛 ∈ ℕ0s)
9 1n0s 28716 . . . . . . . . . 10 1s ∈ ℕ0s
109a1i 11 . . . . . . . . 9 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 1s ∈ ℕ0s)
117, 8, 10pw2divscan4d 28812 . . . . . . . 8 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s𝑛)) = (((2s↑s 1s ) ·s 𝑎) /su (2s↑s(𝑛 +s 1s ))))
124, 2eqeltri 2857 . . . . . . . . . 10 (2s↑s 1s ) ∈ No
1312a1i 11 . . . . . . . . 9 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (2s↑s 1s ) ∈ No )
14 peano2n0s 28698 . . . . . . . . . 10 (𝑛 ∈ ℕ0s → (𝑛 +s 1s ) ∈ ℕ0s)
1514adantl 487 . . . . . . . . 9 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑛 +s 1s ) ∈ ℕ0s)
1613, 7, 15pw2divsassd 28811 . . . . . . . 8 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (((2s↑s 1s ) ·s 𝑎) /su (2s↑s(𝑛 +s 1s ))) = ((2s↑s 1s ) ·s (𝑎 /su (2s↑s(𝑛 +s 1s )))))
1711, 16eqtr2d 2797 . . . . . . 7 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((2s↑s 1s ) ·s (𝑎 /su (2s↑s(𝑛 +s 1s )))) = (𝑎 /su (2s↑s𝑛)))
187, 8pw2divscld 28807 . . . . . . . 8 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s𝑛)) ∈ No )
197, 15pw2divscld 28807 . . . . . . . 8 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s(𝑛 +s 1s ))) ∈ No )
2018, 19, 10pw2divmulsd 28808 . . . . . . 7 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (((𝑎 /su (2s↑s𝑛)) /su (2s↑s 1s )) = (𝑎 /su (2s↑s(𝑛 +s 1s ))) ↔ ((2s↑s 1s ) ·s (𝑎 /su (2s↑s(𝑛 +s 1s )))) = (𝑎 /su (2s↑s𝑛))))
2117, 20mpbird 260 . . . . . 6 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((𝑎 /su (2s↑s𝑛)) /su (2s↑s 1s )) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
225, 21eqtr3id 2810 . . . . 5 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((𝑎 /su (2s↑s𝑛)) /su 2s) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
23 oveq1 7419 . . . . . . . 8 (𝑏 = 𝑎 → (𝑏 /su (2s↑s𝑚)) = (𝑎 /su (2s↑s𝑚)))
2423eqeq2d 2772 . . . . . . 7 (𝑏 = 𝑎 → ((𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑏 /su (2s↑s𝑚)) ↔ (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑎 /su (2s↑s𝑚))))
25 oveq2 7420 . . . . . . . . 9 (𝑚 = (𝑛 +s 1s ) → (2s↑s𝑚) = (2s↑s(𝑛 +s 1s )))
2625oveq2d 7428 . . . . . . . 8 (𝑚 = (𝑛 +s 1s ) → (𝑎 /su (2s↑s𝑚)) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
2726eqeq2d 2772 . . . . . . 7 (𝑚 = (𝑛 +s 1s ) → ((𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑎 /su (2s↑s𝑚)) ↔ (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑎 /su (2s↑s(𝑛 +s 1s )))))
28 simpl 488 . . . . . . 7 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 𝑎 ∈ ℤs)
29 eqidd 2762 . . . . . . 7 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
3024, 27, 28, 15, 292rspcedvdw 3590 . . . . . 6 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ∃𝑏 ∈ ℤs ∃𝑚 ∈ ℕ0s (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑏 /su (2s↑s𝑚)))
31 elz12s 28840 . . . . . 6 ((𝑎 /su (2s↑s(𝑛 +s 1s ))) ∈ ℤs[1/2] ↔ ∃𝑏 ∈ ℤs ∃𝑚 ∈ ℕ0s (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑏 /su (2s↑s𝑚)))
3230, 31sylibr 237 . . . . 5 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s(𝑛 +s 1s ))) ∈ ℤs[1/2])
3322, 32eqeltrd 2861 . . . 4 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((𝑎 /su (2s↑s𝑛)) /su 2s) ∈ ℤs[1/2])
34 oveq1 7419 . . . . 5 (𝐴 = (𝑎 /su (2s↑s𝑛)) → (𝐴 /su 2s) = ((𝑎 /su (2s↑s𝑛)) /su 2s))
3534eleq1d 2846 . . . 4 (𝐴 = (𝑎 /su (2s↑s𝑛)) → ((𝐴 /su 2s) ∈ ℤs[1/2] ↔ ((𝑎 /su (2s↑s𝑛)) /su 2s) ∈ ℤs[1/2]))
3633, 35syl5ibrcom 250 . . 3 ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝐴 = (𝑎 /su (2s↑s𝑛)) → (𝐴 /su 2s) ∈ ℤs[1/2]))
3736rexlimivv 3205 . 2 (∃𝑎 ∈ ℤs ∃𝑛 ∈ ℕ0s 𝐴 = (𝑎 /su (2s↑s𝑛)) → (𝐴 /su 2s) ∈ ℤs[1/2])
381, 37sylbi 220 1 (𝐴 ∈ ℤs[1/2] → (𝐴 /su 2s) ∈ ℤs[1/2])
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  (class class class)co 7412   No csur 27979   1s c1s 28174   +s cadds 28327   ·s cmuls 28474   /su cdivs 28555  ℕ0scn0s 28680  ℤsczs 28746  2sc2s 28778  ↑scexps 28780  ℤs[1/2]cz12s 28782
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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  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-tp 4589  df-op 4591  df-ot 4593  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8460  df-2o 8461  df-oadd 8464  df-nadd 8659  df-no 27982  df-lts 27983  df-bday 27984  df-les 28084  df-slts 28126  df-cuts 28128  df-0s 28175  df-1s 28176  df-made 28195  df-old 28196  df-left 28198  df-right 28199  df-norec 28306  df-norec2 28317  df-adds 28328  df-negs 28389  df-subs 28390  df-muls 28475  df-divs 28556  df-seqs 28652  df-n0s 28682  df-nns 28683  df-zs 28747  df-2s 28779  df-exps 28781  df-z12s 28783
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator