Theorem z12shalf 28710

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 28702	. 2 ⊢ (𝐴 ∈ ℤs[1/2] ↔ ∃𝑎 ∈ ℤs ∃𝑛 ∈ ℕ0s 𝐴 = (𝑎 /su (2s↑s𝑛)))
2		2no 28649	. . . . . . . 8 ⊢ 2s ∈ No
3		exps1 28658	. . . . . . . 8 ⊢ (2s ∈ No → (2s↑s 1s ) = 2s)
4	2, 3	ax-mp 5	. . . . . . 7 ⊢ (2s↑s 1s ) = 2s
5	4	oveq2i 7434	. . . . . 6 ⊢ ((𝑎 /su (2s↑s𝑛)) /su (2s↑s 1s )) = ((𝑎 /su (2s↑s𝑛)) /su 2s)
6		zno 28612	. . . . . . . . . 10 ⊢ (𝑎 ∈ ℤs → 𝑎 ∈ No )
7	6	adantr 486	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 𝑎 ∈ No )
8		simpr 490	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 𝑛 ∈ ℕ0s)
9		1n0s 28578	. . . . . . . . . 10 ⊢ 1s ∈ ℕ0s
10	9	a1i 11	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 1s ∈ ℕ0s)
11	7, 8, 10	pw2divscan4d 28674	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s𝑛)) = (((2s↑s 1s ) ·s 𝑎) /su (2s↑s(𝑛 +s 1s ))))
12	4, 2	eqeltri 2862	. . . . . . . . . 10 ⊢ (2s↑s 1s ) ∈ No
13	12	a1i 11	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (2s↑s 1s ) ∈ No )
14		peano2n0s 28560	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ0s → (𝑛 +s 1s ) ∈ ℕ0s)
15	14	adantl 487	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑛 +s 1s ) ∈ ℕ0s)
16	13, 7, 15	pw2divsassd 28673	. . . . . . . 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 2802	. . . . . . 7 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((2s↑s 1s ) ·s (𝑎 /su (2s↑s(𝑛 +s 1s )))) = (𝑎 /su (2s↑s𝑛)))
18	7, 8	pw2divscld 28669	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s𝑛)) ∈ No )
19	7, 15	pw2divscld 28669	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s(𝑛 +s 1s ))) ∈ No )
20	18, 19, 10	pw2divmulsd 28670	. . . . . . 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 2815	. . . . 5 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((𝑎 /su (2s↑s𝑛)) /su 2s) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
23		oveq1 7430	. . . . . . . 8 ⊢ (𝑏 = 𝑎 → (𝑏 /su (2s↑s𝑚)) = (𝑎 /su (2s↑s𝑚)))
24	23	eqeq2d 2777	. . . . . . 7 ⊢ (𝑏 = 𝑎 → ((𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑏 /su (2s↑s𝑚)) ↔ (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑎 /su (2s↑s𝑚))))
25		oveq2 7431	. . . . . . . . 9 ⊢ (𝑚 = (𝑛 +s 1s ) → (2s↑s𝑚) = (2s↑s(𝑛 +s 1s )))
26	25	oveq2d 7439	. . . . . . . 8 ⊢ (𝑚 = (𝑛 +s 1s ) → (𝑎 /su (2s↑s𝑚)) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
27	26	eqeq2d 2777	. . . . . . 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 2767	. . . . . . 7 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
30	24, 27, 28, 15, 29	2rspcedvdw 3598	. . . . . 6 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ∃𝑏 ∈ ℤs ∃𝑚 ∈ ℕ0s (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑏 /su (2s↑s𝑚)))
31		elz12s 28702	. . . . . 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 2866	. . . 4 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((𝑎 /su (2s↑s𝑛)) /su 2s) ∈ ℤs[1/2])
34		oveq1 7430	. . . . 5 ⊢ (𝐴 = (𝑎 /su (2s↑s𝑛)) → (𝐴 /su 2s) = ((𝑎 /su (2s↑s𝑛)) /su 2s))
35	34	eleq1d 2851	. . . 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 3210	. 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 1570   ∈ wcel 2146  ∃wrex 3092  (class class class)co 7423   No csur 27841   1_s c1s 28036   +_s cadds 28189   ·_s cmuls 28336   /_su cdivs 28417  ℕ_0scn0s 28542  ℤ_sczs 28608  2_sc2s 28640  ↑_scexps 28642  ℤ_s[1/2]cz12s 28644

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-ot 4603  df-uni 4878  df-int 4918  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-se 5620  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-om 7872  df-1st 7995  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-1o 8462  df-2o 8463  df-oadd 8466  df-nadd 8661  df-no 27844  df-lts 27845  df-bday 27846  df-les 27946  df-slts 27988  df-cuts 27990  df-0s 28037  df-1s 28038  df-made 28057  df-old 28058  df-left 28060  df-right 28061  df-norec 28168  df-norec2 28179  df-adds 28190  df-negs 28251  df-subs 28252  df-muls 28337  df-divs 28418  df-seqs 28514  df-n0s 28544  df-nns 28545  df-zs 28609  df-2s 28641  df-exps 28643  df-z12s 28645

This theorem is used by: (None)