| 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 7378 | . . . . 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 7378 | . . . . 5 ⊢ (𝑚 = 𝑛 → (𝐴↑s𝑚) = (𝐴↑s𝑛)) | |
| 5 | 4 | eleq1d 2822 | . . . 4 ⊢ (𝑚 = 𝑛 → ((𝐴↑s𝑚) ∈ 𝐹 ↔ (𝐴↑s𝑛) ∈ 𝐹)) |
| 6 | 5 | imbi2d 340 | . . 3 ⊢ (𝑚 = 𝑛 → ((𝐴 ∈ 𝐹 → (𝐴↑s𝑚) ∈ 𝐹) ↔ (𝐴 ∈ 𝐹 → (𝐴↑s𝑛) ∈ 𝐹))) |
| 7 | oveq2 7378 | . . . . 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 7378 | . . . . 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 3931 | . . . . 5 ⊢ (𝐴 ∈ 𝐹 → 𝐴 ∈ No ) |
| 15 | exps0 28440 | . . . . 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 28442 | . . . . . . 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 7564 | . . . . . . . 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 28346 | . 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 3903 (class class class)co 7370 No csur 27624 0s c0s 27818 1s c1s 27819 +s cadds 27972 ·s cmuls 28119 ℕ0scn0s 28325 ↑scexps 28425 |
| 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 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 |
| 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 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-ot 4591 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-se 5588 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-1st 7945 df-2nd 7946 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-1o 8409 df-2o 8410 df-oadd 8413 df-nadd 8606 df-no 27627 df-lts 27628 df-bday 27629 df-les 27730 df-slts 27771 df-cuts 27773 df-0s 27820 df-1s 27821 df-made 27840 df-old 27841 df-left 27843 df-right 27844 df-norec 27951 df-norec2 27962 df-adds 27973 df-negs 28034 df-subs 28035 df-muls 28120 df-seqs 28297 df-n0s 28327 df-nns 28328 df-zs 28392 df-exps 28426 |
| This theorem is referenced by: expscl 28444 n0expscl 28445 nnexpscl 28446 zexpscl 28447 |
| Copyright terms: Public domain | W3C validator |