ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nnmcl GIF version

Theorem nnmcl 6648
Description: Closure of multiplication of natural numbers. Proposition 8.17 of [TakeutiZaring] p. 63. (Contributed by NM, 20-Sep-1995.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
Assertion
Ref Expression
nnmcl ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·o 𝐵) ∈ ω)

Proof of Theorem nnmcl
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 6025 . . . . 5 (𝑥 = 𝐵 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝐵))
21eleq1d 2300 . . . 4 (𝑥 = 𝐵 → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o 𝐵) ∈ ω))
32imbi2d 230 . . 3 (𝑥 = 𝐵 → ((𝐴 ∈ ω → (𝐴 ·o 𝑥) ∈ ω) ↔ (𝐴 ∈ ω → (𝐴 ·o 𝐵) ∈ ω)))
4 oveq2 6025 . . . . 5 (𝑥 = ∅ → (𝐴 ·o 𝑥) = (𝐴 ·o ∅))
54eleq1d 2300 . . . 4 (𝑥 = ∅ → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o ∅) ∈ ω))
6 oveq2 6025 . . . . 5 (𝑥 = 𝑦 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝑦))
76eleq1d 2300 . . . 4 (𝑥 = 𝑦 → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o 𝑦) ∈ ω))
8 oveq2 6025 . . . . 5 (𝑥 = suc 𝑦 → (𝐴 ·o 𝑥) = (𝐴 ·o suc 𝑦))
98eleq1d 2300 . . . 4 (𝑥 = suc 𝑦 → ((𝐴 ·o 𝑥) ∈ ω ↔ (𝐴 ·o suc 𝑦) ∈ ω))
10 nnm0 6642 . . . . 5 (𝐴 ∈ ω → (𝐴 ·o ∅) = ∅)
11 peano1 4692 . . . . 5 ∅ ∈ ω
1210, 11eqeltrdi 2322 . . . 4 (𝐴 ∈ ω → (𝐴 ·o ∅) ∈ ω)
13 nnacl 6647 . . . . . . . 8 (((𝐴 ·o 𝑦) ∈ ω ∧ 𝐴 ∈ ω) → ((𝐴 ·o 𝑦) +o 𝐴) ∈ ω)
1413expcom 116 . . . . . . 7 (𝐴 ∈ ω → ((𝐴 ·o 𝑦) ∈ ω → ((𝐴 ·o 𝑦) +o 𝐴) ∈ ω))
1514adantr 276 . . . . . 6 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ·o 𝑦) ∈ ω → ((𝐴 ·o 𝑦) +o 𝐴) ∈ ω))
16 nnmsuc 6644 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 ·o suc 𝑦) = ((𝐴 ·o 𝑦) +o 𝐴))
1716eleq1d 2300 . . . . . 6 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ·o suc 𝑦) ∈ ω ↔ ((𝐴 ·o 𝑦) +o 𝐴) ∈ ω))
1815, 17sylibrd 169 . . . . 5 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ·o 𝑦) ∈ ω → (𝐴 ·o suc 𝑦) ∈ ω))
1918expcom 116 . . . 4 (𝑦 ∈ ω → (𝐴 ∈ ω → ((𝐴 ·o 𝑦) ∈ ω → (𝐴 ·o suc 𝑦) ∈ ω)))
205, 7, 9, 12, 19finds2 4699 . . 3 (𝑥 ∈ ω → (𝐴 ∈ ω → (𝐴 ·o 𝑥) ∈ ω))
213, 20vtoclga 2870 . 2 (𝐵 ∈ ω → (𝐴 ∈ ω → (𝐴 ·o 𝐵) ∈ ω))
2221impcom 125 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·o 𝐵) ∈ ω)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1397  wcel 2202  c0 3494  suc csuc 4462  ωcom 4688  (class class class)co 6017   +o coa 6578   ·o comu 6579
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-irdg 6535  df-oadd 6585  df-omul 6586
This theorem is referenced by:  nnmcli  6650  nndi  6653  nnmass  6654  nnmsucr  6655  nnmordi  6683  nnmord  6684  nnmword  6685  mulclpi  7547  enq0tr  7653  addcmpblnq0  7662  mulcmpblnq0  7663  mulcanenq0ec  7664  addclnq0  7670  mulclnq0  7671  nqpnq0nq  7672  distrnq0  7678  addassnq0lemcl  7680  addassnq0  7681
  Copyright terms: Public domain W3C validator