| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > expscllem | Structured version Visualization version GIF version | ||
| Description: Lemma for proving non-negative surreal integer exponentiation closure. (Contributed by Scott Fenton, 7-Nov-2025.) |
| Ref | Expression |
|---|---|
| expscllem.1 | ⊢ 𝐹 ⊆ No |
| expscllem.2 | ⊢ ((𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (𝑥 ·s 𝑦) ∈ 𝐹) |
| expscllem.3 | ⊢ 1s ∈ 𝐹 |
| Ref | Expression |
|---|---|
| expscllem | ⊢ ((𝐴 ∈ 𝐹 ∧ 𝑁 ∈ ℕ0s) → (𝐴↑s𝑁) ∈ 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq2 7367 | . . . . 5 ⊢ (𝑚 = 0s → (𝐴↑s𝑚) = (𝐴↑s 0s )) | |
| 2 | 1 | eleq1d 2826 | . . . 4 ⊢ (𝑚 = 0s → ((𝐴↑s𝑚) ∈ 𝐹 ↔ (𝐴↑s 0s ) ∈ 𝐹)) |
| 3 | 2 | imbi2d 342 | . . 3 ⊢ (𝑚 = 0s → ((𝐴 ∈ 𝐹 → (𝐴↑s𝑚) ∈ 𝐹) ↔ (𝐴 ∈ 𝐹 → (𝐴↑s 0s ) ∈ 𝐹))) |
| 4 | oveq2 7367 | . . . . 5 ⊢ (𝑚 = 𝑛 → (𝐴↑s𝑚) = (𝐴↑s𝑛)) | |
| 5 | 4 | eleq1d 2826 | . . . 4 ⊢ (𝑚 = 𝑛 → ((𝐴↑s𝑚) ∈ 𝐹 ↔ (𝐴↑s𝑛) ∈ 𝐹)) |
| 6 | 5 | imbi2d 342 | . . 3 ⊢ (𝑚 = 𝑛 → ((𝐴 ∈ 𝐹 → (𝐴↑s𝑚) ∈ 𝐹) ↔ (𝐴 ∈ 𝐹 → (𝐴↑s𝑛) ∈ 𝐹))) |
| 7 | oveq2 7367 | . . . . 5 ⊢ (𝑚 = (𝑛 +s 1s ) → (𝐴↑s𝑚) = (𝐴↑s(𝑛 +s 1s ))) | |
| 8 | 7 | eleq1d 2826 | . . . 4 ⊢ (𝑚 = (𝑛 +s 1s ) → ((𝐴↑s𝑚) ∈ 𝐹 ↔ (𝐴↑s(𝑛 +s 1s )) ∈ 𝐹)) |
| 9 | 8 | imbi2d 342 | . . 3 ⊢ (𝑚 = (𝑛 +s 1s ) → ((𝐴 ∈ 𝐹 → (𝐴↑s𝑚) ∈ 𝐹) ↔ (𝐴 ∈ 𝐹 → (𝐴↑s(𝑛 +s 1s )) ∈ 𝐹))) |
| 10 | oveq2 7367 | . . . . 5 ⊢ (𝑚 = 𝑁 → (𝐴↑s𝑚) = (𝐴↑s𝑁)) | |
| 11 | 10 | eleq1d 2826 | . . . 4 ⊢ (𝑚 = 𝑁 → ((𝐴↑s𝑚) ∈ 𝐹 ↔ (𝐴↑s𝑁) ∈ 𝐹)) |
| 12 | 11 | imbi2d 342 | . . 3 ⊢ (𝑚 = 𝑁 → ((𝐴 ∈ 𝐹 → (𝐴↑s𝑚) ∈ 𝐹) ↔ (𝐴 ∈ 𝐹 → (𝐴↑s𝑁) ∈ 𝐹))) |
| 13 | expscllem.1 | . . . . . 6 ⊢ 𝐹 ⊆ No | |
| 14 | 13 | sseli 3912 | . . . . 5 ⊢ (𝐴 ∈ 𝐹 → 𝐴 ∈ No ) |
| 15 | exps0 28439 | . . . . 5 ⊢ (𝐴 ∈ No → (𝐴↑s 0s ) = 1s ) | |
| 16 | 14, 15 | syl 17 | . . . 4 ⊢ (𝐴 ∈ 𝐹 → (𝐴↑s 0s ) = 1s ) |
| 17 | expscllem.3 | . . . 4 ⊢ 1s ∈ 𝐹 | |
| 18 | 16, 17 | eqeltrdi 2849 | . . 3 ⊢ (𝐴 ∈ 𝐹 → (𝐴↑s 0s ) ∈ 𝐹) |
| 19 | 14 | 3ad2ant2 1141 | . . . . . . 7 ⊢ ((𝑛 ∈ ℕ0s ∧ 𝐴 ∈ 𝐹 ∧ (𝐴↑s𝑛) ∈ 𝐹) → 𝐴 ∈ No ) |
| 20 | simp1 1143 | . . . . . . 7 ⊢ ((𝑛 ∈ ℕ0s ∧ 𝐴 ∈ 𝐹 ∧ (𝐴↑s𝑛) ∈ 𝐹) → 𝑛 ∈ ℕ0s) | |
| 21 | expsp1 28441 | . . . . . . 7 ⊢ ((𝐴 ∈ No ∧ 𝑛 ∈ ℕ0s) → (𝐴↑s(𝑛 +s 1s )) = ((𝐴↑s𝑛) ·s 𝐴)) | |
| 22 | 19, 20, 21 | syl2anc 591 | . . . . . 6 ⊢ ((𝑛 ∈ ℕ0s ∧ 𝐴 ∈ 𝐹 ∧ (𝐴↑s𝑛) ∈ 𝐹) → (𝐴↑s(𝑛 +s 1s )) = ((𝐴↑s𝑛) ·s 𝐴)) |
| 23 | expscllem.2 | . . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (𝑥 ·s 𝑦) ∈ 𝐹) | |
| 24 | 23 | caovcl 7553 | . . . . . . . 8 ⊢ (((𝐴↑s𝑛) ∈ 𝐹 ∧ 𝐴 ∈ 𝐹) → ((𝐴↑s𝑛) ·s 𝐴) ∈ 𝐹) |
| 25 | 24 | ancoms 460 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝐹 ∧ (𝐴↑s𝑛) ∈ 𝐹) → ((𝐴↑s𝑛) ·s 𝐴) ∈ 𝐹) |
| 26 | 25 | 3adant1 1137 | . . . . . 6 ⊢ ((𝑛 ∈ ℕ0s ∧ 𝐴 ∈ 𝐹 ∧ (𝐴↑s𝑛) ∈ 𝐹) → ((𝐴↑s𝑛) ·s 𝐴) ∈ 𝐹) |
| 27 | 22, 26 | eqeltrd 2841 | . . . . 5 ⊢ ((𝑛 ∈ ℕ0s ∧ 𝐴 ∈ 𝐹 ∧ (𝐴↑s𝑛) ∈ 𝐹) → (𝐴↑s(𝑛 +s 1s )) ∈ 𝐹) |
| 28 | 27 | 3exp 1126 | . . . 4 ⊢ (𝑛 ∈ ℕ0s → (𝐴 ∈ 𝐹 → ((𝐴↑s𝑛) ∈ 𝐹 → (𝐴↑s(𝑛 +s 1s )) ∈ 𝐹))) |
| 29 | 28 | a2d 29 | . . 3 ⊢ (𝑛 ∈ ℕ0s → ((𝐴 ∈ 𝐹 → (𝐴↑s𝑛) ∈ 𝐹) → (𝐴 ∈ 𝐹 → (𝐴↑s(𝑛 +s 1s )) ∈ 𝐹))) |
| 30 | 3, 6, 9, 12, 18, 29 | n0sind 28345 | . 2 ⊢ (𝑁 ∈ ℕ0s → (𝐴 ∈ 𝐹 → (𝐴↑s𝑁) ∈ 𝐹)) |
| 31 | 30 | impcom 409 | 1 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝑁 ∈ ℕ0s) → (𝐴↑s𝑁) ∈ 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 ⊆ wss 3884 (class class class)co 7359 No csur 27624 0s c0s 27817 1s c1s 27818 +s cadds 27971 ·s cmuls 28118 ℕ0scn0s 28324 ↑scexps 28424 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-pss 3904 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-ot 4566 df-uni 4841 df-int 4880 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-se 5574 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6255 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-riota 7316 df-ov 7362 df-oprab 7363 df-mpo 7364 df-om 7810 df-1st 7933 df-2nd 7934 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8343 df-1o 8399 df-2o 8400 df-oadd 8403 df-nadd 8596 df-no 27627 df-lts 27628 df-bday 27629 df-les 27729 df-slts 27770 df-cuts 27772 df-0s 27819 df-1s 27820 df-made 27839 df-old 27840 df-left 27842 df-right 27843 df-norec 27950 df-norec2 27961 df-adds 27972 df-negs 28033 df-subs 28034 df-muls 28119 df-seqs 28296 df-n0s 28326 df-nns 28327 df-zs 28391 df-exps 28425 |
| This theorem is referenced by: expscl 28443 n0expscl 28444 nnexpscl 28445 zexpscl 28446 |
| Copyright terms: Public domain | W3C validator |