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

Theorem rnxpid 6173
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 5926 . . 3 ran ∅ = ∅
2 xpeq2 5698 . . . . 5 (𝐴 = ∅ → (𝐴 × 𝐴) = (𝐴 × ∅))
3 xp0 6158 . . . . 5 (𝐴 × ∅) = ∅
42, 3eqtrdi 2786 . . . 4 (𝐴 = ∅ → (𝐴 × 𝐴) = ∅)
54rneqd 5938 . . 3 (𝐴 = ∅ → ran (𝐴 × 𝐴) = ran ∅)
6 id 22 . . 3 (𝐴 = ∅ → 𝐴 = ∅)
71, 5, 63eqtr4a 2796 . 2 (𝐴 = ∅ → ran (𝐴 × 𝐴) = 𝐴)
8 rnxp 6170 . 2 (𝐴 ≠ ∅ → ran (𝐴 × 𝐴) = 𝐴)
97, 8pm2.61ine 3023 1 ran (𝐴 × 𝐴) = 𝐴
Colors of variables: wff setvar class
Syntax hints:   = wceq 1539  c0 4323   × cxp 5675  ran crn 5678
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-sep 5300  ax-nul 5307  ax-pr 5428
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-ral 3060  df-rab 3431  df-v 3474  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-br 5150  df-opab 5212  df-xp 5683  df-rel 5684  df-cnv 5685  df-dm 5687  df-rn 5688
This theorem is referenced by:  sofld  6187  fpwwe2lem12  10641  ustimasn  23955  utopbas  23962  restutop  23964  ovoliunlem1  25253  metideq  33169  poimirlem3  36796  mblfinlem1  36830  rtrclex  42672
  Copyright terms: Public domain W3C validator