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

Theorem unixpid 6286
Description: Field of a Cartesian square. (Contributed by FL, 10-Oct-2009.)
Assertion
Ref Expression
unixpid (𝐴 × 𝐴) = 𝐴

Proof of Theorem unixpid
StepHypRef Expression
1 xpeq1 5676 . . . 4 (𝐴 = ∅ → (𝐴 × 𝐴) = (∅ × 𝐴))
2 0xp 5761 . . . 4 (∅ × 𝐴) = ∅
31, 2eqtrdi 2820 . . 3 (𝐴 = ∅ → (𝐴 × 𝐴) = ∅)
4 unieq 4887 . . . . 5 ((𝐴 × 𝐴) = ∅ → (𝐴 × 𝐴) = ∅)
54unieqd 4889 . . . 4 ((𝐴 × 𝐴) = ∅ → (𝐴 × 𝐴) = ∅)
6 uni0 4905 . . . . . 6 ∅ = ∅
76unieqi 4888 . . . . 5 ∅ =
87, 6eqtri 2792 . . . 4 ∅ = ∅
9 eqtr 2789 . . . . 5 (( (𝐴 × 𝐴) = ∅ ∧ ∅ = ∅) → (𝐴 × 𝐴) = ∅)
10 eqtr 2789 . . . . . . 7 (( (𝐴 × 𝐴) = ∅ ∧ ∅ = 𝐴) → (𝐴 × 𝐴) = 𝐴)
1110expcom 418 . . . . . 6 (∅ = 𝐴 → ( (𝐴 × 𝐴) = ∅ → (𝐴 × 𝐴) = 𝐴))
1211eqcoms 2777 . . . . 5 (𝐴 = ∅ → ( (𝐴 × 𝐴) = ∅ → (𝐴 × 𝐴) = 𝐴))
139, 12syl5com 32 . . . 4 (( (𝐴 × 𝐴) = ∅ ∧ ∅ = ∅) → (𝐴 = ∅ → (𝐴 × 𝐴) = 𝐴))
145, 8, 13sylancl 597 . . 3 ((𝐴 × 𝐴) = ∅ → (𝐴 = ∅ → (𝐴 × 𝐴) = 𝐴))
153, 14mpcom 39 . 2 (𝐴 = ∅ → (𝐴 × 𝐴) = 𝐴)
16 df-ne 2965 . . 3 (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅)
17 xpnz 6157 . . . 4 ((𝐴 ≠ ∅ ∧ 𝐴 ≠ ∅) ↔ (𝐴 × 𝐴) ≠ ∅)
18 unixp 6284 . . . . 5 ((𝐴 × 𝐴) ≠ ∅ → (𝐴 × 𝐴) = (𝐴𝐴))
19 unidm 4119 . . . . 5 (𝐴𝐴) = 𝐴
2018, 19eqtrdi 2820 . . . 4 ((𝐴 × 𝐴) ≠ ∅ → (𝐴 × 𝐴) = 𝐴)
2117, 20sylbi 220 . . 3 ((𝐴 ≠ ∅ ∧ 𝐴 ≠ ∅) → (𝐴 × 𝐴) = 𝐴)
2216, 16, 21sylancbr 612 . 2 𝐴 = ∅ → (𝐴 × 𝐴) = 𝐴)
2315, 22pm2.61i 184 1 (𝐴 × 𝐴) = 𝐴
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400   = wceq 1567  wne 2964  cun 3911  c0 4294   cuni 4876   × cxp 5660
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-11 2198  ax-ext 2741  ax-sep 5261  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-xp 5668  df-rel 5669  df-cnv 5670  df-dm 5672  df-rn 5673
This theorem is referenced by:  psss  18636
  Copyright terms: Public domain W3C validator