Theorem expsval 28744

Description: The value of surreal exponentiation. (Contributed by Scott Fenton, 24-Jul-2025.)

Assertion

Ref	Expression
expsval	⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ ℤs) → (𝐴↑s𝐵) = if(𝐵 = 0s , 1s , if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝐵))))))

Proof of Theorem expsval

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqidd 2761	. . . . . 6 ⊢ (𝑥 = 𝐴 → 1s = 1s )
2		eqidd 2761	. . . . . 6 ⊢ (𝑥 = 𝐴 → ·s = ·s )
3		sneq 4593	. . . . . . 7 ⊢ (𝑥 = 𝐴 → {𝑥} = {𝐴})
4	3	xpeq2d 5677	. . . . . 6 ⊢ (𝑥 = 𝐴 → (ℕs × {𝑥}) = (ℕs × {𝐴}))
5	1, 2, 4	seqseq123d 28605	. . . . 5 ⊢ (𝑥 = 𝐴 → seqs 1s ( ·s , (ℕs × {𝑥})) = seqs 1s ( ·s , (ℕs × {𝐴})))
6	5	fveq1d 6875	. . . 4 ⊢ (𝑥 = 𝐴 → (seqs 1s ( ·s , (ℕs × {𝑥}))‘𝑦) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦))
7	5	fveq1d 6875	. . . . 5 ⊢ (𝑥 = 𝐴 → (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us ‘𝑦)) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝑦)))
8	7	oveq2d 7424	. . . 4 ⊢ (𝑥 = 𝐴 → ( 1s /su (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us ‘𝑦))) = ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝑦))))
9	6, 8	ifeq12d 4503	. . 3 ⊢ (𝑥 = 𝐴 → if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝑥}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us ‘𝑦)))) = if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝑦)))))
10	9	ifeq2d 4502	. 2 ⊢ (𝑥 = 𝐴 → if(𝑦 = 0s , 1s , if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝑥}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us ‘𝑦))))) = if(𝑦 = 0s , 1s , if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝑦))))))
11		eqeq1 2764	. . 3 ⊢ (𝑦 = 𝐵 → (𝑦 = 0s ↔ 𝐵 = 0s ))
12		breq2 5106	. . . 4 ⊢ (𝑦 = 𝐵 → ( 0s <s 𝑦 ↔ 0s <s 𝐵))
13		fveq2 6873	. . . 4 ⊢ (𝑦 = 𝐵 → (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵))
14		2fveq3 6878	. . . . 5 ⊢ (𝑦 = 𝐵 → (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝑦)) = (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝐵)))
15	14	oveq2d 7424	. . . 4 ⊢ (𝑦 = 𝐵 → ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝑦))) = ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝐵))))
16	12, 13, 15	ifbieq12d 4510	. . 3 ⊢ (𝑦 = 𝐵 → if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝑦)))) = if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝐵)))))
17	11, 16	ifbieq2d 4508	. 2 ⊢ (𝑦 = 𝐵 → if(𝑦 = 0s , 1s , if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝑦))))) = if(𝐵 = 0s , 1s , if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝐵))))))
18		df-exps 28732	. 2 ⊢ ↑s = (𝑥 ∈ No , 𝑦 ∈ ℤs ↦ if(𝑦 = 0s , 1s , if( 0s <s 𝑦, (seqs 1s ( ·s , (ℕs × {𝑥}))‘𝑦), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝑥}))‘( -us ‘𝑦))))))
19		1no 28129	. . . 4 ⊢ 1s ∈ No
20	19	elexi 3472	. . 3 ⊢ 1s ∈ V
21		fvex 6886	. . . 4 ⊢ (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵) ∈ V
22		ovex 7441	. . . 4 ⊢ ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝐵))) ∈ V
23	21, 22	ifex 4532	. . 3 ⊢ if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝐵)))) ∈ V
24	20, 23	ifex 4532	. 2 ⊢ if(𝐵 = 0s , 1s , if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝐵))))) ∈ V
25	10, 17, 18, 24	ovmpo 7568	1 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ ℤs) → (𝐴↑s𝐵) = if(𝐵 = 0s , 1s , if( 0s <s 𝐵, (seqs 1s ( ·s , (ℕs × {𝐴}))‘𝐵), ( 1s /su (seqs 1s ( ·s , (ℕs × {𝐴}))‘( -us ‘𝐵))))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ifcif 4481  {csn 4583   class class class wbr 5102   × cxp 5645  ‘cfv 6527  (class class class)co 7408   No csur 27930   <s clts 27931   0_s c0s 28124   1_s c1s 28125   -u_s cnegs 28338   ·_s cmuls 28425   /_su cdivs 28506  seq_scseqs 28602  ℕ_scnns 28632  ℤ_sczs 28697  ↑_scexps 28731

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 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734

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 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-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-tp 4588  df-op 4590  df-uni 4867  df-int 4907  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6293  df-ord 6354  df-on 6355  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-1o 8454  df-2o 8455  df-no 27933  df-lts 27934  df-bday 27935  df-slts 28077  df-cuts 28079  df-0s 28126  df-1s 28127  df-seqs 28603  df-exps 28732

This theorem is used by:  expnnsval  28745  exps0  28746