| 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 7368 | . . . . 5 ⊢ (𝑚 = 0s → (𝐴↑s𝑚) = (𝐴↑s 0s )) | |
| 2 | 1 | eleq1d 2822 | . . . 4 ⊢ (𝑚 = 0s → ((𝐴↑s𝑚) ∈ 𝐹 ↔ (𝐴↑s 0s ) ∈ 𝐹)) |
| 3 | 2 | imbi2d 340 | . . 3 ⊢ (𝑚 = 0s → ((𝐴 ∈ 𝐹 → (𝐴↑s𝑚) ∈ 𝐹) ↔ (𝐴 ∈ 𝐹 → (𝐴↑s 0s ) ∈ 𝐹))) |
| 4 | oveq2 7368 | . . . . 5 ⊢ (𝑚 = 𝑛 → (𝐴↑s𝑚) = (𝐴↑s𝑛)) | |
| 5 | 4 | eleq1d 2822 | . . . 4 ⊢ (𝑚 = 𝑛 → ((𝐴↑s𝑚) ∈ 𝐹 ↔ (𝐴↑s𝑛) ∈ 𝐹)) |
| 6 | 5 | imbi2d 340 | . . 3 ⊢ (𝑚 = 𝑛 → ((𝐴 ∈ 𝐹 → (𝐴↑s𝑚) ∈ 𝐹) ↔ (𝐴 ∈ 𝐹 → (𝐴↑s𝑛) ∈ 𝐹))) |
| 7 | oveq2 7368 | . . . . 5 ⊢ (𝑚 = (𝑛 +s 1s ) → (𝐴↑s𝑚) = (𝐴↑s(𝑛 +s 1s ))) | |
| 8 | 7 | eleq1d 2822 | . . . 4 ⊢ (𝑚 = (𝑛 +s 1s ) → ((𝐴↑s𝑚) ∈ 𝐹 ↔ (𝐴↑s(𝑛 +s 1s )) ∈ 𝐹)) |
| 9 | 8 | imbi2d 340 | . . 3 ⊢ (𝑚 = (𝑛 +s 1s ) → ((𝐴 ∈ 𝐹 → (𝐴↑s𝑚) ∈ 𝐹) ↔ (𝐴 ∈ 𝐹 → (𝐴↑s(𝑛 +s 1s )) ∈ 𝐹))) |
| 10 | oveq2 7368 | . . . . 5 ⊢ (𝑚 = 𝑁 → (𝐴↑s𝑚) = (𝐴↑s𝑁)) | |
| 11 | 10 | eleq1d 2822 | . . . 4 ⊢ (𝑚 = 𝑁 → ((𝐴↑s𝑚) ∈ 𝐹 ↔ (𝐴↑s𝑁) ∈ 𝐹)) |
| 12 | 11 | imbi2d 340 | . . 3 ⊢ (𝑚 = 𝑁 → ((𝐴 ∈ 𝐹 → (𝐴↑s𝑚) ∈ 𝐹) ↔ (𝐴 ∈ 𝐹 → (𝐴↑s𝑁) ∈ 𝐹))) |
| 13 | expscllem.1 | . . . . . 6 ⊢ 𝐹 ⊆ No | |
| 14 | 13 | sseli 3930 | . . . . 5 ⊢ (𝐴 ∈ 𝐹 → 𝐴 ∈ No ) |
| 15 | exps0 28427 | . . . . 5 ⊢ (𝐴 ∈ No → (𝐴↑s 0s ) = 1s ) | |
| 16 | 14, 15 | syl 17 | . . . 4 ⊢ (𝐴 ∈ 𝐹 → (𝐴↑s 0s ) = 1s ) |
| 17 | expscllem.3 | . . . 4 ⊢ 1s ∈ 𝐹 | |
| 18 | 16, 17 | eqeltrdi 2845 | . . 3 ⊢ (𝐴 ∈ 𝐹 → (𝐴↑s 0s ) ∈ 𝐹) |
| 19 | 14 | 3ad2ant2 1135 | . . . . . . 7 ⊢ ((𝑛 ∈ ℕ0s ∧ 𝐴 ∈ 𝐹 ∧ (𝐴↑s𝑛) ∈ 𝐹) → 𝐴 ∈ No ) |
| 20 | simp1 1137 | . . . . . . 7 ⊢ ((𝑛 ∈ ℕ0s ∧ 𝐴 ∈ 𝐹 ∧ (𝐴↑s𝑛) ∈ 𝐹) → 𝑛 ∈ ℕ0s) | |
| 21 | expsp1 28429 | . . . . . . 7 ⊢ ((𝐴 ∈ No ∧ 𝑛 ∈ ℕ0s) → (𝐴↑s(𝑛 +s 1s )) = ((𝐴↑s𝑛) ·s 𝐴)) | |
| 22 | 19, 20, 21 | syl2anc 585 | . . . . . 6 ⊢ ((𝑛 ∈ ℕ0s ∧ 𝐴 ∈ 𝐹 ∧ (𝐴↑s𝑛) ∈ 𝐹) → (𝐴↑s(𝑛 +s 1s )) = ((𝐴↑s𝑛) ·s 𝐴)) |
| 23 | expscllem.2 | . . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (𝑥 ·s 𝑦) ∈ 𝐹) | |
| 24 | 23 | caovcl 7554 | . . . . . . . 8 ⊢ (((𝐴↑s𝑛) ∈ 𝐹 ∧ 𝐴 ∈ 𝐹) → ((𝐴↑s𝑛) ·s 𝐴) ∈ 𝐹) |
| 25 | 24 | ancoms 458 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝐹 ∧ (𝐴↑s𝑛) ∈ 𝐹) → ((𝐴↑s𝑛) ·s 𝐴) ∈ 𝐹) |
| 26 | 25 | 3adant1 1131 | . . . . . 6 ⊢ ((𝑛 ∈ ℕ0s ∧ 𝐴 ∈ 𝐹 ∧ (𝐴↑s𝑛) ∈ 𝐹) → ((𝐴↑s𝑛) ·s 𝐴) ∈ 𝐹) |
| 27 | 22, 26 | eqeltrd 2837 | . . . . 5 ⊢ ((𝑛 ∈ ℕ0s ∧ 𝐴 ∈ 𝐹 ∧ (𝐴↑s𝑛) ∈ 𝐹) → (𝐴↑s(𝑛 +s 1s )) ∈ 𝐹) |
| 28 | 27 | 3exp 1120 | . . . 4 ⊢ (𝑛 ∈ ℕ0s → (𝐴 ∈ 𝐹 → ((𝐴↑s𝑛) ∈ 𝐹 → (𝐴↑s(𝑛 +s 1s )) ∈ 𝐹))) |
| 29 | 28 | a2d 29 | . . 3 ⊢ (𝑛 ∈ ℕ0s → ((𝐴 ∈ 𝐹 → (𝐴↑s𝑛) ∈ 𝐹) → (𝐴 ∈ 𝐹 → (𝐴↑s(𝑛 +s 1s )) ∈ 𝐹))) |
| 30 | 3, 6, 9, 12, 18, 29 | n0sind 28333 | . 2 ⊢ (𝑁 ∈ ℕ0s → (𝐴 ∈ 𝐹 → (𝐴↑s𝑁) ∈ 𝐹)) |
| 31 | 30 | impcom 407 | 1 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝑁 ∈ ℕ0s) → (𝐴↑s𝑁) ∈ 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ⊆ wss 3902 (class class class)co 7360 No csur 27611 0s c0s 27805 1s c1s 27806 +s cadds 27959 ·s cmuls 28106 ℕ0scn0s 28312 ↑scexps 28412 |
| 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 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 |
| 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 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-ot 4590 df-uni 4865 df-int 4904 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-2o 8400 df-oadd 8403 df-nadd 8596 df-no 27614 df-lts 27615 df-bday 27616 df-les 27717 df-slts 27758 df-cuts 27760 df-0s 27807 df-1s 27808 df-made 27827 df-old 27828 df-left 27830 df-right 27831 df-norec 27938 df-norec2 27949 df-adds 27960 df-negs 28021 df-subs 28022 df-muls 28107 df-seqs 28284 df-n0s 28314 df-nns 28315 df-zs 28379 df-exps 28413 |
| This theorem is referenced by: expscl 28431 n0expscl 28432 nnexpscl 28433 zexpscl 28434 |
| Copyright terms: Public domain | W3C validator |