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

Theorem dmaddpi 10813
Description: Domain of addition on positive integers. (Contributed by NM, 26-Aug-1995.) (New usage is discouraged.)
Assertion
Ref Expression
dmaddpi dom +N = (N × N)

Proof of Theorem dmaddpi
StepHypRef Expression
1 dmres 5977 . . 3 dom ( +o ↾ (N × N)) = ((N × N) ∩ dom +o )
2 fnoa 8443 . . . . 5 +o Fn (On × On)
32fndmi 6602 . . . 4 dom +o = (On × On)
43ineq2i 4157 . . 3 ((N × N) ∩ dom +o ) = ((N × N) ∩ (On × On))
51, 4eqtri 2759 . 2 dom ( +o ↾ (N × N)) = ((N × N) ∩ (On × On))
6 df-pli 10796 . . 3 +N = ( +o ↾ (N × N))
76dmeqi 5859 . 2 dom +N = dom ( +o ↾ (N × N))
8 df-ni 10795 . . . . . . 7 N = (ω ∖ {∅})
9 difss 4076 . . . . . . 7 (ω ∖ {∅}) ⊆ ω
108, 9eqsstri 3968 . . . . . 6 N ⊆ ω
11 omsson 7821 . . . . . 6 ω ⊆ On
1210, 11sstri 3931 . . . . 5 N ⊆ On
13 anidm 564 . . . . 5 ((N ⊆ On ∧ N ⊆ On) ↔ N ⊆ On)
1412, 13mpbir 231 . . . 4 (N ⊆ On ∧ N ⊆ On)
15 xpss12 5646 . . . 4 ((N ⊆ On ∧ N ⊆ On) → (N × N) ⊆ (On × On))
1614, 15ax-mp 5 . . 3 (N × N) ⊆ (On × On)
17 dfss 3908 . . 3 ((N × N) ⊆ (On × On) ↔ (N × N) = ((N × N) ∩ (On × On)))
1816, 17mpbi 230 . 2 (N × N) = ((N × N) ∩ (On × On))
195, 7, 183eqtr4i 2769 1 dom +N = (N × N)
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1542  cdif 3886  cin 3888  wss 3889  c0 4273  {csn 4567   × cxp 5629  dom cdm 5631  cres 5633  Oncon0 6323  ωcom 7817   +o coa 8402  Ncnpi 10767   +N cpli 10768
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 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-fv 6506  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-oadd 8409  df-ni 10795  df-pli 10796
This theorem is referenced by:  addcompi  10817  addasspi  10818  distrpi  10821  addcanpi  10822  addnidpi  10824  ltapi  10826
  Copyright terms: Public domain W3C validator