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

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

Proof of Theorem unixpid
StepHypRef Expression
1 xpeq1 5691 . . . 4 (𝐴 = ∅ → (𝐴 × 𝐴) = (∅ × 𝐴))
2 0xp 5775 . . . 4 (∅ × 𝐴) = ∅
31, 2eqtrdi 2789 . . 3 (𝐴 = ∅ → (𝐴 × 𝐴) = ∅)
4 unieq 4920 . . . . 5 ((𝐴 × 𝐴) = ∅ → (𝐴 × 𝐴) = ∅)
54unieqd 4923 . . . 4 ((𝐴 × 𝐴) = ∅ → (𝐴 × 𝐴) = ∅)
6 uni0 4940 . . . . . 6 ∅ = ∅
76unieqi 4922 . . . . 5 ∅ =
87, 6eqtri 2761 . . . 4 ∅ = ∅
9 eqtr 2756 . . . . 5 (( (𝐴 × 𝐴) = ∅ ∧ ∅ = ∅) → (𝐴 × 𝐴) = ∅)
10 eqtr 2756 . . . . . . 7 (( (𝐴 × 𝐴) = ∅ ∧ ∅ = 𝐴) → (𝐴 × 𝐴) = 𝐴)
1110expcom 415 . . . . . 6 (∅ = 𝐴 → ( (𝐴 × 𝐴) = ∅ → (𝐴 × 𝐴) = 𝐴))
1211eqcoms 2741 . . . . 5 (𝐴 = ∅ → ( (𝐴 × 𝐴) = ∅ → (𝐴 × 𝐴) = 𝐴))
139, 12syl5com 31 . . . 4 (( (𝐴 × 𝐴) = ∅ ∧ ∅ = ∅) → (𝐴 = ∅ → (𝐴 × 𝐴) = 𝐴))
145, 8, 13sylancl 587 . . 3 ((𝐴 × 𝐴) = ∅ → (𝐴 = ∅ → (𝐴 × 𝐴) = 𝐴))
153, 14mpcom 38 . 2 (𝐴 = ∅ → (𝐴 × 𝐴) = 𝐴)
16 df-ne 2942 . . 3 (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅)
17 xpnz 6159 . . . 4 ((𝐴 ≠ ∅ ∧ 𝐴 ≠ ∅) ↔ (𝐴 × 𝐴) ≠ ∅)
18 unixp 6282 . . . . 5 ((𝐴 × 𝐴) ≠ ∅ → (𝐴 × 𝐴) = (𝐴𝐴))
19 unidm 4153 . . . . 5 (𝐴𝐴) = 𝐴
2018, 19eqtrdi 2789 . . . 4 ((𝐴 × 𝐴) ≠ ∅ → (𝐴 × 𝐴) = 𝐴)
2117, 20sylbi 216 . . 3 ((𝐴 ≠ ∅ ∧ 𝐴 ≠ ∅) → (𝐴 × 𝐴) = 𝐴)
2216, 16, 21sylancbr 602 . 2 𝐴 = ∅ → (𝐴 × 𝐴) = 𝐴)
2315, 22pm2.61i 182 1 (𝐴 × 𝐴) = 𝐴
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 397   = wceq 1542  wne 2941  cun 3947  c0 4323   cuni 4909   × cxp 5675
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  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:  psss  18533
  Copyright terms: Public domain W3C validator