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

Theorem dmmulpi 7683
Description: Domain of multiplication on positive integers. (Contributed by NM, 26-Aug-1995.)
Assertion
Ref Expression
dmmulpi dom ·N = (N × N)

Proof of Theorem dmmulpi
StepHypRef Expression
1 dmres 5079 . . 3 dom ( ·o ↾ (N × N)) = ((N × N) ∩ dom ·o )
2 fnom 6713 . . . . 5 ·o Fn (On × On)
3 fndm 5475 . . . . 5 ( ·o Fn (On × On) → dom ·o = (On × On))
42, 3ax-mp 5 . . . 4 dom ·o = (On × On)
54ineq2i 3429 . . 3 ((N × N) ∩ dom ·o ) = ((N × N) ∩ (On × On))
61, 5eqtri 2259 . 2 dom ( ·o ↾ (N × N)) = ((N × N) ∩ (On × On))
7 df-mi 7663 . . 3 ·N = ( ·o ↾ (N × N))
87dmeqi 4977 . 2 dom ·N = dom ( ·o ↾ (N × N))
9 df-ni 7661 . . . . . . 7 N = (ω ∖ {∅})
10 difss 3355 . . . . . . 7 (ω ∖ {∅}) ⊆ ω
119, 10eqsstri 3280 . . . . . 6 N ⊆ ω
12 omsson 4755 . . . . . 6 ω ⊆ On
1311, 12sstri 3257 . . . . 5 N ⊆ On
14 anidm 400 . . . . 5 ((N ⊆ On ∧ N ⊆ On) ↔ N ⊆ On)
1513, 14mpbir 146 . . . 4 (N ⊆ On ∧ N ⊆ On)
16 xpss12 4877 . . . 4 ((N ⊆ On ∧ N ⊆ On) → (N × N) ⊆ (On × On))
1715, 16ax-mp 5 . . 3 (N × N) ⊆ (On × On)
18 dfss 3234 . . 3 ((N × N) ⊆ (On × On) ↔ (N × N) = ((N × N) ∩ (On × On)))
1917, 18mpbi 145 . 2 (N × N) = ((N × N) ∩ (On × On))
206, 8, 193eqtr4i 2269 1 dom ·N = (N × N)
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1402  cdif 3217  cin 3219  wss 3220  c0 3520  {csn 3705  Oncon0 4503  ωcom 4732   × cxp 4767  dom cdm 4769  cres 4771   Fn wfn 5367   ·o comu 6675  Ncnpi 7629   ·N cmi 7631
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-irdg 6631  df-oadd 6681  df-omul 6682  df-ni 7661  df-mi 7663
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator