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

Theorem dmmulpi 7545
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 5034 . . 3 dom ( ·o ↾ (N × N)) = ((N × N) ∩ dom ·o )
2 fnom 6617 . . . . 5 ·o Fn (On × On)
3 fndm 5429 . . . . 5 ( ·o Fn (On × On) → dom ·o = (On × On))
42, 3ax-mp 5 . . . 4 dom ·o = (On × On)
54ineq2i 3405 . . 3 ((N × N) ∩ dom ·o ) = ((N × N) ∩ (On × On))
61, 5eqtri 2252 . 2 dom ( ·o ↾ (N × N)) = ((N × N) ∩ (On × On))
7 df-mi 7525 . . 3 ·N = ( ·o ↾ (N × N))
87dmeqi 4932 . 2 dom ·N = dom ( ·o ↾ (N × N))
9 df-ni 7523 . . . . . . 7 N = (ω ∖ {∅})
10 difss 3333 . . . . . . 7 (ω ∖ {∅}) ⊆ ω
119, 10eqsstri 3259 . . . . . 6 N ⊆ ω
12 omsson 4711 . . . . . 6 ω ⊆ On
1311, 12sstri 3236 . . . . 5 N ⊆ On
14 anidm 396 . . . . 5 ((N ⊆ On ∧ N ⊆ On) ↔ N ⊆ On)
1513, 14mpbir 146 . . . 4 (N ⊆ On ∧ N ⊆ On)
16 xpss12 4833 . . . 4 ((N ⊆ On ∧ N ⊆ On) → (N × N) ⊆ (On × On))
1715, 16ax-mp 5 . . 3 (N × N) ⊆ (On × On)
18 dfss 3214 . . 3 ((N × N) ⊆ (On × On) ↔ (N × N) = ((N × N) ∩ (On × On)))
1917, 18mpbi 145 . 2 (N × N) = ((N × N) ∩ (On × On))
206, 8, 193eqtr4i 2262 1 dom ·N = (N × N)
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1397  cdif 3197  cin 3199  wss 3200  c0 3494  {csn 3669  Oncon0 4460  ωcom 4688   × cxp 4723  dom cdm 4725  cres 4727   Fn wfn 5321   ·o comu 6579  Ncnpi 7491   ·N cmi 7493
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  df-ni 7523  df-mi 7525
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator