Theorem pw2cutp1 28472

Description: Simplify pw2cut 28471 in the case of successors of surreal integers. (Contributed by Scott Fenton, 11-Nov-2025.)

Hypotheses

Ref	Expression
pw2cutp1.1	⊢ (𝜑 → 𝐴 ∈ ℤs)
pw2cutp1.3	⊢ (𝜑 → 𝑁 ∈ ℕ0s)

Assertion

Ref	Expression
pw2cutp1	⊢ (𝜑 → ({(𝐴 /su (2s↑s𝑁))} |s {((𝐴 +s 1s ) /su (2s↑s𝑁))}) = (((2s ·s 𝐴) +s 1s ) /su (2s↑s(𝑁 +s 1s ))))

Proof of Theorem pw2cutp1

Step	Hyp	Ref	Expression
1		pw2cutp1.1	. . . 4 ⊢ (𝜑 → 𝐴 ∈ ℤs)
2	1	znod 28394	. . 3 ⊢ (𝜑 → 𝐴 ∈ No )
3		1zs 28402	. . . . 5 ⊢ 1s ∈ ℤs
4		zaddscl 28405	. . . . 5 ⊢ ((𝐴 ∈ ℤs ∧ 1s ∈ ℤs) → (𝐴 +s 1s ) ∈ ℤs)
5	1, 3, 4	sylancl 587	. . . 4 ⊢ (𝜑 → (𝐴 +s 1s ) ∈ ℤs)
6	5	znod 28394	. . 3 ⊢ (𝜑 → (𝐴 +s 1s ) ∈ No )
7		pw2cutp1.3	. . 3 ⊢ (𝜑 → 𝑁 ∈ ℕ0s)
8	2	ltsp1d 28026	. . 3 ⊢ (𝜑 → 𝐴 <s (𝐴 +s 1s ))
9		2nns 28429	. . . . . . . . 9 ⊢ 2s ∈ ℕs
10		nnzs 28397	. . . . . . . . 9 ⊢ (2s ∈ ℕs → 2s ∈ ℤs)
11	9, 10	ax-mp 5	. . . . . . . 8 ⊢ 2s ∈ ℤs
12	11	a1i 11	. . . . . . 7 ⊢ (𝜑 → 2s ∈ ℤs)
13	12, 1	zmulscld 28408	. . . . . 6 ⊢ (𝜑 → (2s ·s 𝐴) ∈ ℤs)
14		zaddscl 28405	. . . . . 6 ⊢ (((2s ·s 𝐴) ∈ ℤs ∧ 1s ∈ ℤs) → ((2s ·s 𝐴) +s 1s ) ∈ ℤs)
15	13, 3, 14	sylancl 587	. . . . 5 ⊢ (𝜑 → ((2s ·s 𝐴) +s 1s ) ∈ ℤs)
16		zcuts 28418	. . . . 5 ⊢ (((2s ·s 𝐴) +s 1s ) ∈ ℤs → ((2s ·s 𝐴) +s 1s ) = ({(((2s ·s 𝐴) +s 1s ) -s 1s )} |s {(((2s ·s 𝐴) +s 1s ) +s 1s )}))
17	15, 16	syl 17	. . . 4 ⊢ (𝜑 → ((2s ·s 𝐴) +s 1s ) = ({(((2s ·s 𝐴) +s 1s ) -s 1s )} |s {(((2s ·s 𝐴) +s 1s ) +s 1s )}))
18		no2times 28428	. . . . . . 7 ⊢ (𝐴 ∈ No → (2s ·s 𝐴) = (𝐴 +s 𝐴))
19	2, 18	syl 17	. . . . . 6 ⊢ (𝜑 → (2s ·s 𝐴) = (𝐴 +s 𝐴))
20	19	oveq1d 7373	. . . . 5 ⊢ (𝜑 → ((2s ·s 𝐴) +s 1s ) = ((𝐴 +s 𝐴) +s 1s ))
21		1no 27821	. . . . . . 7 ⊢ 1s ∈ No
22	21	a1i 11	. . . . . 6 ⊢ (𝜑 → 1s ∈ No )
23	2, 2, 22	addsassd 28017	. . . . 5 ⊢ (𝜑 → ((𝐴 +s 𝐴) +s 1s ) = (𝐴 +s (𝐴 +s 1s )))
24	20, 23	eqtrd 2772	. . . 4 ⊢ (𝜑 → ((2s ·s 𝐴) +s 1s ) = (𝐴 +s (𝐴 +s 1s )))
25	13	znod 28394	. . . . . . 7 ⊢ (𝜑 → (2s ·s 𝐴) ∈ No )
26		pncans 28083	. . . . . . 7 ⊢ (((2s ·s 𝐴) ∈ No ∧ 1s ∈ No ) → (((2s ·s 𝐴) +s 1s ) -s 1s ) = (2s ·s 𝐴))
27	25, 21, 26	sylancl 587	. . . . . 6 ⊢ (𝜑 → (((2s ·s 𝐴) +s 1s ) -s 1s ) = (2s ·s 𝐴))
28	27	sneqd 4580	. . . . 5 ⊢ (𝜑 → {(((2s ·s 𝐴) +s 1s ) -s 1s )} = {(2s ·s 𝐴)})
29		1p1e2s 28427	. . . . . . . . 9 ⊢ ( 1s +s 1s ) = 2s
30		2no 28430	. . . . . . . . . 10 ⊢ 2s ∈ No
31		mulsrid 28124	. . . . . . . . . 10 ⊢ (2s ∈ No → (2s ·s 1s ) = 2s)
32	30, 31	ax-mp 5	. . . . . . . . 9 ⊢ (2s ·s 1s ) = 2s
33	29, 32	eqtr4i 2763	. . . . . . . 8 ⊢ ( 1s +s 1s ) = (2s ·s 1s )
34	33	oveq2i 7369	. . . . . . 7 ⊢ ((2s ·s 𝐴) +s ( 1s +s 1s )) = ((2s ·s 𝐴) +s (2s ·s 1s ))
35	25, 22, 22	addsassd 28017	. . . . . . 7 ⊢ (𝜑 → (((2s ·s 𝐴) +s 1s ) +s 1s ) = ((2s ·s 𝐴) +s ( 1s +s 1s )))
36	30	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 2s ∈ No )
37	36, 2, 22	addsdid 28167	. . . . . . 7 ⊢ (𝜑 → (2s ·s (𝐴 +s 1s )) = ((2s ·s 𝐴) +s (2s ·s 1s )))
38	34, 35, 37	3eqtr4a 2798	. . . . . 6 ⊢ (𝜑 → (((2s ·s 𝐴) +s 1s ) +s 1s ) = (2s ·s (𝐴 +s 1s )))
39	38	sneqd 4580	. . . . 5 ⊢ (𝜑 → {(((2s ·s 𝐴) +s 1s ) +s 1s )} = {(2s ·s (𝐴 +s 1s ))})
40	28, 39	oveq12d 7376	. . . 4 ⊢ (𝜑 → ({(((2s ·s 𝐴) +s 1s ) -s 1s )} |s {(((2s ·s 𝐴) +s 1s ) +s 1s )}) = ({(2s ·s 𝐴)} |s {(2s ·s (𝐴 +s 1s ))}))
41	17, 24, 40	3eqtr3rd 2781	. . 3 ⊢ (𝜑 → ({(2s ·s 𝐴)} |s {(2s ·s (𝐴 +s 1s ))}) = (𝐴 +s (𝐴 +s 1s )))
42	2, 6, 7, 8, 41	pw2cut 28471	. 2 ⊢ (𝜑 → ({(𝐴 /su (2s↑s𝑁))} |s {((𝐴 +s 1s ) /su (2s↑s𝑁))}) = ((𝐴 +s (𝐴 +s 1s )) /su (2s↑s(𝑁 +s 1s ))))
43	24	oveq1d 7373	. 2 ⊢ (𝜑 → (((2s ·s 𝐴) +s 1s ) /su (2s↑s(𝑁 +s 1s ))) = ((𝐴 +s (𝐴 +s 1s )) /su (2s↑s(𝑁 +s 1s ))))
44	42, 43	eqtr4d 2775	1 ⊢ (𝜑 → ({(𝐴 /su (2s↑s𝑁))} |s {((𝐴 +s 1s ) /su (2s↑s𝑁))}) = (((2s ·s 𝐴) +s 1s ) /su (2s↑s(𝑁 +s 1s ))))

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  {csn 4568  (class class class)co 7358   No csur 27622   |s ccuts 27770   1_s c1s 27817   +_s cadds 27970   -_s csubs 28031   ·_s cmuls 28117   /_su cdivs 28198  ℕ_0scn0s 28323  ℕ_scnns 28324  ℤ_sczs 28389  2_sc2s 28421  ↑_scexps 28423

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5300  ax-pr 5368  ax-un 7680  ax-dc 10357

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-ot 4577  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-se 5576  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8222  df-wrecs 8253  df-recs 8302  df-rdg 8340  df-1o 8396  df-2o 8397  df-oadd 8400  df-nadd 8593  df-no 27625  df-lts 27626  df-bday 27627  df-les 27728  df-slts 27769  df-cuts 27771  df-0s 27818  df-1s 27819  df-made 27838  df-old 27839  df-left 27841  df-right 27842  df-norec 27949  df-norec2 27960  df-adds 27971  df-negs 28032  df-subs 28033  df-muls 28118  df-divs 28199  df-seqs 28295  df-n0s 28325  df-nns 28326  df-zs 28390  df-2s 28422  df-exps 28424

This theorem is referenced by:  bdaypw2n0bndlem  28474  bdayfinbndlem1  28478