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

Theorem naddf 8668
Description: Function statement for natural addition. (Contributed by Scott Fenton, 20-Jan-2025.)
Assertion
Ref Expression
naddf +no :(On × On)⟶On

Proof of Theorem naddf
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 naddfn 8661 . 2 +no Fn (On × On)
2 naddcl 8663 . . . 4 ((𝑦 ∈ On ∧ 𝑧 ∈ On) → (𝑦 +no 𝑧) ∈ On)
32rgen2 3211 . . 3 𝑦 ∈ On ∀𝑧 ∈ On (𝑦 +no 𝑧) ∈ On
4 fveq2 6882 . . . . . 6 (𝑥 = ⟨𝑦, 𝑧⟩ → ( +no ‘𝑥) = ( +no ‘⟨𝑦, 𝑧⟩))
5 df-ov 7414 . . . . . 6 (𝑦 +no 𝑧) = ( +no ‘⟨𝑦, 𝑧⟩)
64, 5eqtr4di 2822 . . . . 5 (𝑥 = ⟨𝑦, 𝑧⟩ → ( +no ‘𝑥) = (𝑦 +no 𝑧))
76eleq1d 2854 . . . 4 (𝑥 = ⟨𝑦, 𝑧⟩ → (( +no ‘𝑥) ∈ On ↔ (𝑦 +no 𝑧) ∈ On))
87ralxp 5828 . . 3 (∀𝑥 ∈ (On × On)( +no ‘𝑥) ∈ On ↔ ∀𝑦 ∈ On ∀𝑧 ∈ On (𝑦 +no 𝑧) ∈ On)
93, 8mpbir 234 . 2 𝑥 ∈ (On × On)( +no ‘𝑥) ∈ On
10 ffnfv 7115 . 2 ( +no :(On × On)⟶On ↔ ( +no Fn (On × On) ∧ ∀𝑥 ∈ (On × On)( +no ‘𝑥) ∈ On))
111, 9, 10mpbir2an 723 1 +no :(On × On)⟶On
Colors of variables: wff setvar class
Syntax hints:   = wceq 1567  wcel 2149  wral 3085  cop 4600   × cxp 5660  Oncon0 6361   Fn wfn 6532  wf 6533  cfv 6537  (class class class)co 7411   +no cnadd 8651
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-se 5616  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-1st 7986  df-2nd 7987  df-frecs 8278  df-nadd 8652
This theorem is referenced by:  naddunif  8680  naddasslem1  8681  naddasslem2  8682
  Copyright terms: Public domain W3C validator