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

Theorem rnxpid 6148
Description: The range of a Cartesian square. (Contributed by FL, 17-May-2010.)
Assertion
Ref Expression
rnxpid ran (𝐴 × 𝐴) = 𝐴

Proof of Theorem rnxpid
StepHypRef Expression
1 rn0 5895 . . 3 ran ∅ = ∅
2 xpeq2 5661 . . . . 5 (𝐴 = ∅ → (𝐴 × 𝐴) = (𝐴 × ∅))
3 xp0 5740 . . . . 5 (𝐴 × ∅) = ∅
42, 3eqtrdi 2807 . . . 4 (𝐴 = ∅ → (𝐴 × 𝐴) = ∅)
54rneqd 5907 . . 3 (𝐴 = ∅ → ran (𝐴 × 𝐴) = ran ∅)
6 id 22 . . 3 (𝐴 = ∅ → 𝐴 = ∅)
71, 5, 63eqtr4a 2817 . 2 (𝐴 = ∅ → ran (𝐴 × 𝐴) = 𝐴)
8 rnxp 6145 . 2 (𝐴 ≠ ∅ → ran (𝐴 × 𝐴) = 𝐴)
97, 8pm2.61ine 3034 1 ran (𝐴 × 𝐴) = 𝐴
Colors of variables: wff setvar class
Syntax hints:   = wceq 1554  c0 4280   × cxp 5638  ran crn 5641
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-11 2185  ax-ext 2728  ax-sep 5240  ax-pr 5384
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-sb 2085  df-clab 2735  df-cleq 2748  df-clel 2831  df-ne 2952  df-ral 3071  df-rex 3081  df-rab 3409  df-v 3450  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4281  df-if 4475  df-sn 4577  df-pr 4579  df-op 4583  df-br 5095  df-opab 5157  df-xp 5646  df-rel 5647  df-cnv 5648  df-dm 5650  df-rn 5651
This theorem is referenced by:  sofld  6162  fpwwe2lem12  10590  ustimasn  24261  utopbas  24268  restutop  24270  ovoliunlem1  25537  metideq  34144  poimirlem3  38070  mblfinlem1  38104  rtrclex  44141
  Copyright terms: Public domain W3C validator