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

Theorem dmmulpi 7699
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 5086 . . 3 dom ( ·o ↾ (N × N)) = ((N × N) ∩ dom ·o )
2 fnom 6727 . . . . 5 ·o Fn (On × On)
3 fndm 5483 . . . . 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 7679 . . 3 ·N = ( ·o ↾ (N × N))
87dmeqi 4984 . 2 dom ·N = dom ( ·o ↾ (N × N))
9 df-ni 7677 . . . . . . 7 N = (ω ∖ {∅})
10 difss 3355 . . . . . . 7 (ω ∖ {∅}) ⊆ ω
119, 10eqsstri 3280 . . . . . 6 N ⊆ ω
12 omsson 4762 . . . . . 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 4884 . . . 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
This proof depends on syntax axioms:   ∧ wa 104   = wceq 1402   ∖ cdif 3217   ∩ cin 3219   ⊆ wss 3220  ∅c0 3520  {csn 3709  Oncon0 4510  ωcom 4739   × cxp 4774  dom cdm 4776   ↾ cres 4778   Fn wfn 5375   ·o comu 6689  Ncnpi 7645   ·N cmi 7647
This proof depends on 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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737
This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-oadd 6695  df-omul 6696  df-ni 7677  df-mi 7679
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator