MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nnecl Structured version   Visualization version   GIF version

Theorem nnecl 8660
Description: Closure of exponentiation of natural numbers. Proposition 8.17 of [TakeutiZaring] p. 63. Theorem 2.20 of [Schloeder] p. 6. (Contributed by NM, 24-Mar-2007.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
Assertion
Ref Expression
nnecl ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ↑o 𝐵) ∈ ω)

Proof of Theorem nnecl
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 7459 . . . . 5 (𝑥 = 𝐵 → (𝐴 ↑o 𝑥) = (𝐴 ↑o 𝐵))
21eleq1d 2849 . . . 4 (𝑥 = 𝐵 → ((𝐴 ↑o 𝑥) ∈ ω ↔ (𝐴 ↑o 𝐵) ∈ ω))
32imbi2d 343 . . 3 (𝑥 = 𝐵 → ((𝐴 ∈ ω → (𝐴 ↑o 𝑥) ∈ ω) ↔ (𝐴 ∈ ω → (𝐴 ↑o 𝐵) ∈ ω)))
4 oveq2 7459 . . . . 5 (𝑥 = ∅ → (𝐴 ↑o 𝑥) = (𝐴 ↑o ∅))
54eleq1d 2849 . . . 4 (𝑥 = ∅ → ((𝐴 ↑o 𝑥) ∈ ω ↔ (𝐴 ↑o ∅) ∈ ω))
6 oveq2 7459 . . . . 5 (𝑥 = 𝑦 → (𝐴 ↑o 𝑥) = (𝐴 ↑o 𝑦))
76eleq1d 2849 . . . 4 (𝑥 = 𝑦 → ((𝐴 ↑o 𝑥) ∈ ω ↔ (𝐴 ↑o 𝑦) ∈ ω))
8 oveq2 7459 . . . . 5 (𝑥 = suc 𝑦 → (𝐴 ↑o 𝑥) = (𝐴 ↑o suc 𝑦))
98eleq1d 2849 . . . 4 (𝑥 = suc 𝑦 → ((𝐴 ↑o 𝑥) ∈ ω ↔ (𝐴 ↑o suc 𝑦) ∈ ω))
10 nnon 7917 . . . . . 6 (𝐴 ∈ ω → 𝐴 ∈ On)
11 oe0 8568 . . . . . 6 (𝐴 ∈ On → (𝐴 ↑o ∅) = 1o)
1210, 11syl 18 . . . . 5 (𝐴 ∈ ω → (𝐴 ↑o ∅) = 1o)
13 df-1o 8514 . . . . . 6 1o = suc ∅
14 peano1 7934 . . . . . . 7 ∅ ∈ ω
15 peano2 7935 . . . . . . 7 (∅ ∈ ω → suc ∅ ∈ ω)
1614, 15ax-mp 5 . . . . . 6 suc ∅ ∈ ω
1713, 16eqeltri 2860 . . . . 5 1o ∈ ω
1812, 17eqeltrdi 2872 . . . 4 (𝐴 ∈ ω → (𝐴 ↑o ∅) ∈ ω)
19 nnmcl 8659 . . . . . . . 8 (((𝐴 ↑o 𝑦) ∈ ω ∧ 𝐴 ∈ ω) → ((𝐴 ↑o 𝑦) ·o 𝐴) ∈ ω)
2019expcom 419 . . . . . . 7 (𝐴 ∈ ω → ((𝐴 ↑o 𝑦) ∈ ω → ((𝐴 ↑o 𝑦) ·o 𝐴) ∈ ω))
2120adantr 486 . . . . . 6 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ↑o 𝑦) ∈ ω → ((𝐴 ↑o 𝑦) ·o 𝐴) ∈ ω))
22 nnesuc 8655 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 ↑o suc 𝑦) = ((𝐴 ↑o 𝑦) ·o 𝐴))
2322eleq1d 2849 . . . . . 6 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ↑o suc 𝑦) ∈ ω ↔ ((𝐴 ↑o 𝑦) ·o 𝐴) ∈ ω))
2421, 23sylibrd 262 . . . . 5 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ↑o 𝑦) ∈ ω → (𝐴 ↑o suc 𝑦) ∈ ω))
2524expcom 419 . . . 4 (𝑦 ∈ ω → (𝐴 ∈ ω → ((𝐴 ↑o 𝑦) ∈ ω → (𝐴 ↑o suc 𝑦) ∈ ω)))
265, 7, 9, 18, 25finds2 7944 . . 3 (𝑥 ∈ ω → (𝐴 ∈ ω → (𝐴 ↑o 𝑥) ∈ ω))
273, 26vtoclga 3540 . 2 (𝐵 ∈ ω → (𝐴 ∈ ω → (𝐴 ↑o 𝐵) ∈ ω))
2827impcom 413 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ↑o 𝐵) ∈ ω)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∅c0 4281  Oncon0 6388  suc csuc 6390  (class class class)co 7451  ωcom 7911  1oc1o 8507   ·o comu 8512   ↑o coe 8513
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-oadd 8518  df-omul 8519  df-oexp 8520
This theorem is used by:  nnamecl  44611  nnoeomeqom  44636
  Copyright terms: Public domain W3C validator