Theorem z12shalf 28753

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 28745	. 2 ⊢ (𝐴 ∈ ℤs[1/2] ↔ ∃𝑎 ∈ ℤs ∃𝑛 ∈ ℕ0s 𝐴 = (𝑎 /su (2s↑s𝑛)))
2		2no 28692	. . . . . . . 8 ⊢ 2s ∈ No
3		exps1 28701	. . . . . . . 8 ⊢ (2s ∈ No → (2s↑s 1s ) = 2s)
4	2, 3	ax-mp 5	. . . . . . 7 ⊢ (2s↑s 1s ) = 2s
5	4	oveq2i 7428	. . . . . 6 ⊢ ((𝑎 /su (2s↑s𝑛)) /su (2s↑s 1s )) = ((𝑎 /su (2s↑s𝑛)) /su 2s)
6		zno 28655	. . . . . . . . . 10 ⊢ (𝑎 ∈ ℤs → 𝑎 ∈ No )
7	6	adantr 486	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 𝑎 ∈ No )
8		simpr 490	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 𝑛 ∈ ℕ0s)
9		1n0s 28621	. . . . . . . . . 10 ⊢ 1s ∈ ℕ0s
10	9	a1i 11	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 1s ∈ ℕ0s)
11	7, 8, 10	pw2divscan4d 28717	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s𝑛)) = (((2s↑s 1s ) ·s 𝑎) /su (2s↑s(𝑛 +s 1s ))))
12	4, 2	eqeltri 2858	. . . . . . . . . 10 ⊢ (2s↑s 1s ) ∈ No
13	12	a1i 11	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (2s↑s 1s ) ∈ No )
14		peano2n0s 28603	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ0s → (𝑛 +s 1s ) ∈ ℕ0s)
15	14	adantl 487	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑛 +s 1s ) ∈ ℕ0s)
16	13, 7, 15	pw2divsassd 28716	. . . . . . . 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 2798	. . . . . . 7 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((2s↑s 1s ) ·s (𝑎 /su (2s↑s(𝑛 +s 1s )))) = (𝑎 /su (2s↑s𝑛)))
18	7, 8	pw2divscld 28712	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s𝑛)) ∈ No )
19	7, 15	pw2divscld 28712	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s(𝑛 +s 1s ))) ∈ No )
20	18, 19, 10	pw2divmulsd 28713	. . . . . . 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 2811	. . . . 5 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((𝑎 /su (2s↑s𝑛)) /su 2s) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
23		oveq1 7424	. . . . . . . 8 ⊢ (𝑏 = 𝑎 → (𝑏 /su (2s↑s𝑚)) = (𝑎 /su (2s↑s𝑚)))
24	23	eqeq2d 2773	. . . . . . 7 ⊢ (𝑏 = 𝑎 → ((𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑏 /su (2s↑s𝑚)) ↔ (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑎 /su (2s↑s𝑚))))
25		oveq2 7425	. . . . . . . . 9 ⊢ (𝑚 = (𝑛 +s 1s ) → (2s↑s𝑚) = (2s↑s(𝑛 +s 1s )))
26	25	oveq2d 7433	. . . . . . . 8 ⊢ (𝑚 = (𝑛 +s 1s ) → (𝑎 /su (2s↑s𝑚)) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
27	26	eqeq2d 2773	. . . . . . 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 2763	. . . . . . 7 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
30	24, 27, 28, 15, 29	2rspcedvdw 3593	. . . . . 6 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ∃𝑏 ∈ ℤs ∃𝑚 ∈ ℕ0s (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑏 /su (2s↑s𝑚)))
31		elz12s 28745	. . . . . 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 2862	. . . 4 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((𝑎 /su (2s↑s𝑛)) /su 2s) ∈ ℤs[1/2])
34		oveq1 7424	. . . . 5 ⊢ (𝐴 = (𝑎 /su (2s↑s𝑛)) → (𝐴 /su 2s) = ((𝑎 /su (2s↑s𝑛)) /su 2s))
35	34	eleq1d 2847	. . . 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 3206	. 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 2145  ∃wrex 3088  (class class class)co 7417   No csur 27884   1_s c1s 28079   +_s cadds 28232   ·_s cmuls 28379   /_su cdivs 28460  ℕ_0scn0s 28585  ℤ_sczs 28651  2_sc2s 28683  ↑_scexps 28685  ℤ_s[1/2]cz12s 28687

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-ot 4596  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-2o 8460  df-oadd 8463  df-nadd 8658  df-no 27887  df-lts 27888  df-bday 27889  df-les 27989  df-slts 28031  df-cuts 28033  df-0s 28080  df-1s 28081  df-made 28100  df-old 28101  df-left 28103  df-right 28104  df-norec 28211  df-norec2 28222  df-adds 28233  df-negs 28294  df-subs 28295  df-muls 28380  df-divs 28461  df-seqs 28557  df-n0s 28587  df-nns 28588  df-zs 28652  df-2s 28684  df-exps 28686  df-z12s 28688

This theorem is used by: (None)