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

Theorem rnxpid 6171
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 5916 . . 3 ran ∅ = ∅
2 xpeq2 5682 . . . . 5 (𝐴 = ∅ → (𝐴 × 𝐴) = (𝐴 × ∅))
3 xp0 5761 . . . . 5 (𝐴 × ∅) = ∅
42, 3eqtrdi 2812 . . . 4 (𝐴 = ∅ → (𝐴 × 𝐴) = ∅)
54rneqd 5928 . . 3 (𝐴 = ∅ → ran (𝐴 × 𝐴) = ran ∅)
6 id 23 . . 3 (𝐴 = ∅ → 𝐴 = ∅)
71, 5, 63eqtr4a 2822 . 2 (𝐴 = ∅ → ran (𝐴 × 𝐴) = 𝐴)
8 rnxp 6168 . 2 (𝐴 ≠ ∅ → ran (𝐴 × 𝐴) = 𝐴)
97, 8pm2.61ine 3039 1 ran (𝐴 × 𝐴) = 𝐴
Colors of variables: wff setvar class
Syntax hints:   = wceq 1568  c0 4285   × cxp 5659  ran crn 5662
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-11 2190  ax-ext 2733  ax-sep 5256  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-sb 2095  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3415  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-xp 5667  df-rel 5668  df-cnv 5669  df-dm 5671  df-rn 5672
This theorem is referenced by:  sofld  6185  fpwwe2lem12  10626  ustimasn  24364  utopbas  24371  restutop  24373  ovoliunlem1  25640  metideq  34249  poimirlem3  38240  mblfinlem1  38274  rtrclex  44313
  Copyright terms: Public domain W3C validator