Theorem expsne0 28428

Description: A non-negative surreal integer power is nonzero if its base is nonzero. (Contributed by Scott Fenton, 7-Aug-2025.)

Assertion

Ref	Expression
expsne0	⊢ ((𝐴 ∈ No ∧ 𝐴 ≠ 0s ∧ 𝑁 ∈ ℕ0s) → (𝐴↑s𝑁) ≠ 0s )

Proof of Theorem expsne0

Dummy variables 𝑛 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 7375	. . . . . . . . 9 ⊢ (𝑚 = 0s → (𝐴↑s𝑚) = (𝐴↑s 0s ))
2	1	eqeq1d 2739	. . . . . . . 8 ⊢ (𝑚 = 0s → ((𝐴↑s𝑚) = 0s ↔ (𝐴↑s 0s ) = 0s ))
3	2	imbi1d 341	. . . . . . 7 ⊢ (𝑚 = 0s → (((𝐴↑s𝑚) = 0s → 𝐴 = 0s ) ↔ ((𝐴↑s 0s ) = 0s → 𝐴 = 0s )))
4	3	imbi2d 340	. . . . . 6 ⊢ (𝑚 = 0s → ((𝐴 ∈ No → ((𝐴↑s𝑚) = 0s → 𝐴 = 0s )) ↔ (𝐴 ∈ No → ((𝐴↑s 0s ) = 0s → 𝐴 = 0s ))))
5		oveq2 7375	. . . . . . . . 9 ⊢ (𝑚 = 𝑛 → (𝐴↑s𝑚) = (𝐴↑s𝑛))
6	5	eqeq1d 2739	. . . . . . . 8 ⊢ (𝑚 = 𝑛 → ((𝐴↑s𝑚) = 0s ↔ (𝐴↑s𝑛) = 0s ))
7	6	imbi1d 341	. . . . . . 7 ⊢ (𝑚 = 𝑛 → (((𝐴↑s𝑚) = 0s → 𝐴 = 0s ) ↔ ((𝐴↑s𝑛) = 0s → 𝐴 = 0s )))
8	7	imbi2d 340	. . . . . 6 ⊢ (𝑚 = 𝑛 → ((𝐴 ∈ No → ((𝐴↑s𝑚) = 0s → 𝐴 = 0s )) ↔ (𝐴 ∈ No → ((𝐴↑s𝑛) = 0s → 𝐴 = 0s ))))
9		oveq2 7375	. . . . . . . . 9 ⊢ (𝑚 = (𝑛 +s 1s ) → (𝐴↑s𝑚) = (𝐴↑s(𝑛 +s 1s )))
10	9	eqeq1d 2739	. . . . . . . 8 ⊢ (𝑚 = (𝑛 +s 1s ) → ((𝐴↑s𝑚) = 0s ↔ (𝐴↑s(𝑛 +s 1s )) = 0s ))
11	10	imbi1d 341	. . . . . . 7 ⊢ (𝑚 = (𝑛 +s 1s ) → (((𝐴↑s𝑚) = 0s → 𝐴 = 0s ) ↔ ((𝐴↑s(𝑛 +s 1s )) = 0s → 𝐴 = 0s )))
12	11	imbi2d 340	. . . . . 6 ⊢ (𝑚 = (𝑛 +s 1s ) → ((𝐴 ∈ No → ((𝐴↑s𝑚) = 0s → 𝐴 = 0s )) ↔ (𝐴 ∈ No → ((𝐴↑s(𝑛 +s 1s )) = 0s → 𝐴 = 0s ))))
13		oveq2 7375	. . . . . . . . 9 ⊢ (𝑚 = 𝑁 → (𝐴↑s𝑚) = (𝐴↑s𝑁))
14	13	eqeq1d 2739	. . . . . . . 8 ⊢ (𝑚 = 𝑁 → ((𝐴↑s𝑚) = 0s ↔ (𝐴↑s𝑁) = 0s ))
15	14	imbi1d 341	. . . . . . 7 ⊢ (𝑚 = 𝑁 → (((𝐴↑s𝑚) = 0s → 𝐴 = 0s ) ↔ ((𝐴↑s𝑁) = 0s → 𝐴 = 0s )))
16	15	imbi2d 340	. . . . . 6 ⊢ (𝑚 = 𝑁 → ((𝐴 ∈ No → ((𝐴↑s𝑚) = 0s → 𝐴 = 0s )) ↔ (𝐴 ∈ No → ((𝐴↑s𝑁) = 0s → 𝐴 = 0s ))))
17		1ne0s 27812	. . . . . . . . 9 ⊢ 1s ≠ 0s
18		exps0 28419	. . . . . . . . . 10 ⊢ (𝐴 ∈ No → (𝐴↑s 0s ) = 1s )
19	18	neeq1d 2992	. . . . . . . . 9 ⊢ (𝐴 ∈ No → ((𝐴↑s 0s ) ≠ 0s ↔ 1s ≠ 0s ))
20	17, 19	mpbiri 258	. . . . . . . 8 ⊢ (𝐴 ∈ No → (𝐴↑s 0s ) ≠ 0s )
21	20	neneqd 2938	. . . . . . 7 ⊢ (𝐴 ∈ No → ¬ (𝐴↑s 0s ) = 0s )
22	21	pm2.21d 121	. . . . . 6 ⊢ (𝐴 ∈ No → ((𝐴↑s 0s ) = 0s → 𝐴 = 0s ))
23		expsp1 28421	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ No ∧ 𝑛 ∈ ℕ0s) → (𝐴↑s(𝑛 +s 1s )) = ((𝐴↑s𝑛) ·s 𝐴))
24	23	eqeq1d 2739	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ No ∧ 𝑛 ∈ ℕ0s) → ((𝐴↑s(𝑛 +s 1s )) = 0s ↔ ((𝐴↑s𝑛) ·s 𝐴) = 0s ))
25		expscl 28423	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ No ∧ 𝑛 ∈ ℕ0s) → (𝐴↑s𝑛) ∈ No )
26		simpl 482	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ No ∧ 𝑛 ∈ ℕ0s) → 𝐴 ∈ No )
27	25, 26	muls0ord 28177	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ No ∧ 𝑛 ∈ ℕ0s) → (((𝐴↑s𝑛) ·s 𝐴) = 0s ↔ ((𝐴↑s𝑛) = 0s ∨ 𝐴 = 0s )))
28	24, 27	bitrd 279	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ No ∧ 𝑛 ∈ ℕ0s) → ((𝐴↑s(𝑛 +s 1s )) = 0s ↔ ((𝐴↑s𝑛) = 0s ∨ 𝐴 = 0s )))
29	28	adantr 480	. . . . . . . . . 10 ⊢ (((𝐴 ∈ No ∧ 𝑛 ∈ ℕ0s) ∧ ((𝐴↑s𝑛) = 0s → 𝐴 = 0s )) → ((𝐴↑s(𝑛 +s 1s )) = 0s ↔ ((𝐴↑s𝑛) = 0s ∨ 𝐴 = 0s )))
30		simpr 484	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ No ∧ 𝑛 ∈ ℕ0s) ∧ ((𝐴↑s𝑛) = 0s → 𝐴 = 0s )) → ((𝐴↑s𝑛) = 0s → 𝐴 = 0s ))
31		idd 24	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ No ∧ 𝑛 ∈ ℕ0s) ∧ ((𝐴↑s𝑛) = 0s → 𝐴 = 0s )) → (𝐴 = 0s → 𝐴 = 0s ))
32	30, 31	jaod 860	. . . . . . . . . 10 ⊢ (((𝐴 ∈ No ∧ 𝑛 ∈ ℕ0s) ∧ ((𝐴↑s𝑛) = 0s → 𝐴 = 0s )) → (((𝐴↑s𝑛) = 0s ∨ 𝐴 = 0s ) → 𝐴 = 0s ))
33	29, 32	sylbid 240	. . . . . . . . 9 ⊢ (((𝐴 ∈ No ∧ 𝑛 ∈ ℕ0s) ∧ ((𝐴↑s𝑛) = 0s → 𝐴 = 0s )) → ((𝐴↑s(𝑛 +s 1s )) = 0s → 𝐴 = 0s ))
34	33	ex 412	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ 𝑛 ∈ ℕ0s) → (((𝐴↑s𝑛) = 0s → 𝐴 = 0s ) → ((𝐴↑s(𝑛 +s 1s )) = 0s → 𝐴 = 0s )))
35	34	expcom 413	. . . . . . 7 ⊢ (𝑛 ∈ ℕ0s → (𝐴 ∈ No → (((𝐴↑s𝑛) = 0s → 𝐴 = 0s ) → ((𝐴↑s(𝑛 +s 1s )) = 0s → 𝐴 = 0s ))))
36	35	a2d 29	. . . . . 6 ⊢ (𝑛 ∈ ℕ0s → ((𝐴 ∈ No → ((𝐴↑s𝑛) = 0s → 𝐴 = 0s )) → (𝐴 ∈ No → ((𝐴↑s(𝑛 +s 1s )) = 0s → 𝐴 = 0s ))))
37	4, 8, 12, 16, 22, 36	n0sind 28325	. . . . 5 ⊢ (𝑁 ∈ ℕ0s → (𝐴 ∈ No → ((𝐴↑s𝑁) = 0s → 𝐴 = 0s )))
38	37	imp 406	. . . 4 ⊢ ((𝑁 ∈ ℕ0s ∧ 𝐴 ∈ No ) → ((𝐴↑s𝑁) = 0s → 𝐴 = 0s ))
39	38	necon3d 2954	. . 3 ⊢ ((𝑁 ∈ ℕ0s ∧ 𝐴 ∈ No ) → (𝐴 ≠ 0s → (𝐴↑s𝑁) ≠ 0s ))
40	39	ex 412	. 2 ⊢ (𝑁 ∈ ℕ0s → (𝐴 ∈ No → (𝐴 ≠ 0s → (𝐴↑s𝑁) ≠ 0s )))
41	40	3imp231 1113	1 ⊢ ((𝐴 ∈ No ∧ 𝐴 ≠ 0s ∧ 𝑁 ∈ ℕ0s) → (𝐴↑s𝑁) ≠ 0s )

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  (class class class)co 7367   No csur 27603   0_s c0s 27797   1_s c1s 27798   +_s cadds 27951   ·_s cmuls 28098  ℕ_0scn0s 28304  ↑_scexps 28404

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 5213  ax-sep 5232  ax-nul 5242  ax-pow 5308  ax-pr 5376  ax-un 7689

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 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6266  df-ord 6327  df-on 6328  df-lim 6329  df-suc 6330  df-iota 6455  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-2o 8406  df-oadd 8409  df-nadd 8602  df-no 27606  df-lts 27607  df-bday 27608  df-les 27709  df-slts 27750  df-cuts 27752  df-0s 27799  df-1s 27800  df-made 27819  df-old 27820  df-left 27822  df-right 27823  df-norec 27930  df-norec2 27941  df-adds 27952  df-negs 28013  df-subs 28014  df-muls 28099  df-seqs 28276  df-n0s 28306  df-nns 28307  df-zs 28371  df-exps 28405

This theorem is referenced by:  pw2divscld  28431  pw2divmulsd  28432  pw2divscan2d  28434  pw2divsassd  28435  pw2divsrecd  28439  pw2cut  28452  z12zsodd  28474