Theorem xpid11 5805

Description: The Cartesian square is a one-to-one construction. (Contributed by NM, 5-Nov-2006.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Assertion

Ref	Expression
xpid11	⊢ ((𝐴 × 𝐴) = (𝐵 × 𝐵) ↔ 𝐴 = 𝐵)

Proof of Theorem xpid11

Step	Hyp	Ref	Expression
1		dmeq 5775	. . 3 ⊢ ((𝐴 × 𝐴) = (𝐵 × 𝐵) → dom (𝐴 × 𝐴) = dom (𝐵 × 𝐵))
2		dmxpid 5803	. . 3 ⊢ dom (𝐴 × 𝐴) = 𝐴
3		dmxpid 5803	. . 3 ⊢ dom (𝐵 × 𝐵) = 𝐵
4	1, 2, 3	3eqtr3g 2882	. 2 ⊢ ((𝐴 × 𝐴) = (𝐵 × 𝐵) → 𝐴 = 𝐵)
5		xpeq12 5583	. . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐴 = 𝐵) → (𝐴 × 𝐴) = (𝐵 × 𝐵))
6	5	anidms 569	. 2 ⊢ (𝐴 = 𝐵 → (𝐴 × 𝐴) = (𝐵 × 𝐵))
7	4, 6	impbii 211	1 ⊢ ((𝐴 × 𝐴) = (𝐵 × 𝐵) ↔ 𝐴 = 𝐵)

Syntax hints:   ↔ wb 208   = wceq 1536   × cxp 5556  dom cdm 5558

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 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pr 5333

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rab 3150  df-v 3499  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-sn 4571  df-pr 4573  df-op 4577  df-br 5070  df-opab 5132  df-xp 5564  df-dm 5568

This theorem is referenced by:  intopsn  17867  grporn  28301  ismndo2  35156  rngosn3  35206  rngomndo  35217