Theorem z12shalf 28899

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 28891	. 2 ⊢ (𝐴 ∈ ℤs[1/2] ↔ ∃𝑎 ∈ ℤs ∃𝑛 ∈ ℕ0s 𝐴 = (𝑎 /su (2s↑s𝑛)))
2		2no 28838	. . . . . . . 8 ⊢ 2s ∈ No
3		exps1 28847	. . . . . . . 8 ⊢ (2s ∈ No → (2s↑s 1s ) = 2s)
4	2, 3	ax-mp 5	. . . . . . 7 ⊢ (2s↑s 1s ) = 2s
5	4	oveq2i 7457	. . . . . 6 ⊢ ((𝑎 /su (2s↑s𝑛)) /su (2s↑s 1s )) = ((𝑎 /su (2s↑s𝑛)) /su 2s)
6		zno 28801	. . . . . . . . . 10 ⊢ (𝑎 ∈ ℤs → 𝑎 ∈ No)
7	6	adantr 486	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 𝑎 ∈ No)
8		simpr 490	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 𝑛 ∈ ℕ0s)
9		1n0s 28767	. . . . . . . . . 10 ⊢ 1s ∈ ℕ0s
10	9	a1i 11	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → 1s ∈ ℕ0s)
11	7, 8, 10	pw2divscan4d 28863	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s𝑛)) = (((2s↑s 1s ) ·s 𝑎) /su (2s↑s(𝑛 +s 1s ))))
12	4, 2	eqeltri 2860	. . . . . . . . . 10 ⊢ (2s↑s 1s ) ∈ No
13	12	a1i 11	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (2s↑s 1s ) ∈ No)
14		peano2n0s 28749	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ0s → (𝑛 +s 1s ) ∈ ℕ0s)
15	14	adantl 487	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑛 +s 1s ) ∈ ℕ0s)
16	13, 7, 15	pw2divsassd 28862	. . . . . . . 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 2799	. . . . . . 7 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((2s↑s 1s ) ·s (𝑎 /su (2s↑s(𝑛 +s 1s )))) = (𝑎 /su (2s↑s𝑛)))
18	7, 8	pw2divscld 28858	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s𝑛)) ∈ No)
19	7, 15	pw2divscld 28858	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → (𝑎 /su (2s↑s(𝑛 +s 1s ))) ∈ No)
20	18, 19, 10	pw2divmulsd 28859	. . . . . . 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 2812	. . . . 5 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((𝑎 /su (2s↑s𝑛)) /su 2s) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
23		oveq1 7453	. . . . . . . 8 ⊢ (𝑏 = 𝑎 → (𝑏 /su (2s↑s𝑚)) = (𝑎 /su (2s↑s𝑚)))
24	23	eqeq2d 2774	. . . . . . 7 ⊢ (𝑏 = 𝑎 → ((𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑏 /su (2s↑s𝑚)) ↔ (𝑎 /su (2s↑s(𝑛 +s 1s ))) = (𝑎 /su (2s↑s𝑚))))
25		oveq2 7454	. . . . . . . . 9 ⊢ (𝑚 = (𝑛 +s 1s ) → (2s↑s𝑚) = (2s↑s(𝑛 +s 1s )))
26	25	oveq2d 7462	. . . . . . . 8 ⊢ (𝑚 = (𝑛 +s 1s ) → (𝑎 /su (2s↑s𝑚)) = (𝑎 /su (2s↑s(𝑛 +s 1s ))))
27	26	eqeq2d 2774	. . . . . . 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 2764	. . . . . . 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 28891	. . . . . 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 2864	. . . 4 ⊢ ((𝑎 ∈ ℤs ∧ 𝑛 ∈ ℕ0s) → ((𝑎 /su (2s↑s𝑛)) /su 2s) ∈ ℤs[1/2])
34		oveq1 7453	. . . . 5 ⊢ (𝐴 = (𝑎 /su (2s↑s𝑛)) → (𝐴 /su 2s) = ((𝑎 /su (2s↑s𝑛)) /su 2s))
35	34	eleq1d 2849	. . . 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 3208	. 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 2147  ∃wrex 3090  (class class class)co 7446  Nocsur 28030   1_s c1s 28225   +_s cadds 28378   ·_s cmuls 28525   /_su cdivs 28606  ℕ_0scn0s 28731  ℤ_sczs 28797  2_sc2s 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-oadd 8511  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: (None)