Theorem z12shalf 28871

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.

Step	Hyp	Ref	Expression
1		elz12s 28863	. 2 ⊢ (𝐴 ∈ ℤs[1/2] ↔ ∃𝑎 ∈ ℤs ∃𝑛 ∈ ℕ0s 𝐴 = (𝑎 /su (2s↑s𝑛)))
2		2no 28810	. . . . . . . 8 ⊢ 2s ∈ No
3		exps1 28819	. . . . . . . 8 ⊢ (2s ∈ No → (2s↑s 1s ) = 2s)
4	2, 3	ax-mp 5	. . . . . . 7 ⊢ (2s↑s 1s ) = 2s
5	4	oveq2i 7431	. . . . . 6 ⊢ ((𝑎 /su (2s↑s𝑛)) /su (2s↑s 1s )) = ((𝑎 /su (2s↑s𝑛)) /su 2s)
6		zno 28773	. . . . . . . . . 10 ⊢ (𝑎 ∈ ℤs → 𝑎 ∈ No)
7	6	adantr 486	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 𝑎 ∈ No)
8		simpr 490	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 𝑛 ∈ ℕ0s)
9		1n0s 28739	. . . . . . . . . 10 ⊢ 1s ∈ ℕ0s
10	9	a1i 11	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 1s ∈ ℕ0s)
11	7, 8, 10	pw2divscan4d 28835	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s𝑛)) = (((2s↑s 1s ) ·s 𝑎) /su (2s↑s(𝑛 +s 1s ))))
12	4, 2	eqeltri 2856	. . . . . . . . . 10 ⊢ (2s↑s 1s ) ∈ No
13	12	a1i 11	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (2s↑s 1s ) ∈ No)
14		peano2n0s 28721	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ0s → (𝑛 +s 1s ) ∈ ℕ0s)
15	14	adantl 487	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑛 +s 1s ) ∈ ℕ0s)
16	13, 7, 15	pw2divsassd 28834	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (((2s↑s 1s ) ·s 𝑎) /su (2s↑s(𝑛 +s 1s ))) = ((2s↑s 1s ) ·s (𝑎 /su (2s↑s(𝑛 +s 1s )))))
17	11, 16	eqtr2d 2796	. . . . . . 7 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((2s↑s 1s ) ·s (𝑎 /su (2s↑s(𝑛 +s 1s )))) = (𝑎 /su (2s↑s𝑛)))
18	7, 8	pw2divscld 28830	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s𝑛)) ∈ No)
19	7, 15	pw2divscld 28830	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s(𝑛 +s 1s ))) ∈ No)
20	18, 19, 10	pw2divmulsd 28831	. . . . . . 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𝑛))))
21	17, 20	mpbird 260	. . . . . 6 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((𝑎 /su (2s↑s𝑛)) /su (2s↑s 1s )) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
22	5, 21	eqtr3id 2809	. . . . 5 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((𝑎 /su (2s↑s𝑛)) /su 2s) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
23		oveq1 7427	. . . . . . . 8 ⊢ (𝑏 = 𝑎 → (𝑏 /su (2s↑s𝑚)) = (𝑎 /su (2s↑s𝑚)))
24	23	eqeq2d 2771	. . . . . . 7 ⊢ (𝑏 = 𝑎 → ((𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑏 /su (2s↑s𝑚)) ↔ (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑎 /su (2s↑s𝑚))))
25		oveq2 7428	. . . . . . . . 9 ⊢ (𝑚 = (𝑛 +s 1s ) → (2s↑s𝑚) = (2s↑s(𝑛 +s 1s )))
26	25	oveq2d 7436	. . . . . . . 8 ⊢ (𝑚 = (𝑛 +s 1s ) → (𝑎 /su (2s↑s𝑚)) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
27	26	eqeq2d 2771	. . . . . . 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 2761	. . . . . . 7 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
30	24, 27, 28, 15, 29	2rspcedvdw 3589	. . . . . 6 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ∃𝑏 ∈ ℤs ∃𝑚 ∈ ℕ0s (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑏 /su (2s↑s𝑚)))
31		elz12s 28863	. . . . . 6 ⊢ ((𝑎 /su (2s↑s(𝑛 +s 1s ))) ∈ ℤs[1/2] ↔ ∃𝑏 ∈ ℤs ∃𝑚 ∈ ℕ0s (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑏 /su (2s↑s𝑚)))
32	30, 31	sylibr 237	. . . . 5 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s(𝑛 +s 1s ))) ∈ ℤs[1/2])
33	22, 32	eqeltrd 2860	. . . 4 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((𝑎 /su (2s↑s𝑛)) /su 2s) ∈ ℤs[1/2])
34		oveq1 7427	. . . . 5 ⊢ (𝐴 = (𝑎 /su (2s↑s𝑛)) → (𝐴 /su 2s) = ((𝑎 /su (2s↑s𝑛)) /su 2s))
35	34	eleq1d 2845	. . . 4 ⊢ (𝐴 = (𝑎 /su (2s↑s𝑛)) → ((𝐴 /su 2s) ∈ ℤs[1/2] ↔ ((𝑎 /su (2s↑s𝑛)) /su 2s) ∈ ℤs[1/2]))
36	33, 35	syl5ibrcom 250	. . 3 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝐴 = (𝑎 /su (2s↑s𝑛)) → (𝐴 /su 2s) ∈ ℤs[1/2]))
37	36	rexlimivv 3204	. 2 ⊢ (∃𝑎 ∈ ℤs ∃𝑛 ∈ ℕ0s 𝐴 = (𝑎 /su (2s↑s𝑛)) → (𝐴 /su 2s) ∈ ℤs[1/2])
38	1, 37	sylbi 220	1 ⊢ (𝐴 ∈ ℤs[1/2] → (𝐴 /su 2s) ∈ ℤs[1/2])

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∃wrex 3086  (class class class)co 7420  Nocsur 28002   1_s c1s 28197   +_s cadds 28350   ·_s cmuls 28497   /_su cdivs 28578  ℕ_0scn0s 28703  ℤ_sczs 28769  2_sc2s 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-oadd 8483  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: (None)