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

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

Proof of Theorem unixpid
StepHypRef Expression
1 xpeq1 5675 . . . 4 (𝐴 = ∅ → (𝐴 × 𝐴) = (∅ × 𝐴))
2 0xp 5760 . . . 4 (∅ × 𝐴) = ∅
31, 2eqtrdi 2814 . . 3 (𝐴 = ∅ → (𝐴 × 𝐴) = ∅)
4 unieq 4883 . . . . 5 ((𝐴 × 𝐴) = ∅ → (𝐴 × 𝐴) = ∅)
54unieqd 4885 . . . 4 ((𝐴 × 𝐴) = ∅ → (𝐴 × 𝐴) = ∅)
6 uni0 4901 . . . . . 6 ∅ = ∅
76unieqi 4884 . . . . 5 ∅ =
87, 6eqtri 2786 . . . 4 ∅ = ∅
9 eqtr 2783 . . . . 5 (( (𝐴 × 𝐴) = ∅ ∧ ∅ = ∅) → (𝐴 × 𝐴) = ∅)
10 eqtr 2783 . . . . . . 7 (( (𝐴 × 𝐴) = ∅ ∧ ∅ = 𝐴) → (𝐴 × 𝐴) = 𝐴)
1110expcom 418 . . . . . 6 (∅ = 𝐴 → ( (𝐴 × 𝐴) = ∅ → (𝐴 × 𝐴) = 𝐴))
1211eqcoms 2771 . . . . 5 (𝐴 = ∅ → ( (𝐴 × 𝐴) = ∅ → (𝐴 × 𝐴) = 𝐴))
139, 12syl5com 32 . . . 4 (( (𝐴 × 𝐴) = ∅ ∧ ∅ = ∅) → (𝐴 = ∅ → (𝐴 × 𝐴) = 𝐴))
145, 8, 13sylancl 597 . . 3 ((𝐴 × 𝐴) = ∅ → (𝐴 = ∅ → (𝐴 × 𝐴) = 𝐴))
153, 14mpcom 39 . 2 (𝐴 = ∅ → (𝐴 × 𝐴) = 𝐴)
16 df-ne 2959 . . 3 (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅)
17 xpnz 6156 . . . 4 ((𝐴 ≠ ∅ ∧ 𝐴 ≠ ∅) ↔ (𝐴 × 𝐴) ≠ ∅)
18 unixp 6283 . . . . 5 ((𝐴 × 𝐴) ≠ ∅ → (𝐴 × 𝐴) = (𝐴𝐴))
19 unidm 4111 . . . . 5 (𝐴𝐴) = 𝐴
2018, 19eqtrdi 2814 . . . 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 1570  wne 2958  cun 3903  c0 4286   cuni 4872   × cxp 5659
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-11 2192  ax-ext 2735  ax-sep 5257  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-xp 5667  df-rel 5668  df-cnv 5669  df-dm 5671  df-rn 5672
This theorem is referenced by:  psss  18631
  Copyright terms: Public domain W3C validator