Theorem xpcan2 6180

Description: Cancellation law for Cartesian product. (Contributed by NM, 30-Aug-2011.)

Assertion

Ref	Expression
xpcan2	⊢ (𝐶 ≠ ∅ → ((𝐴 × 𝐶) = (𝐵 × 𝐶) ↔ 𝐴 = 𝐵))

Proof of Theorem xpcan2

Step	Hyp	Ref	Expression
1		xp11 6178	. . 3 ⊢ ((𝐴 ≠ ∅ ∧ 𝐶 ≠ ∅) → ((𝐴 × 𝐶) = (𝐵 × 𝐶) ↔ (𝐴 = 𝐵 ∧ 𝐶 = 𝐶)))
2		eqid 2766	. . . 4 ⊢ 𝐶 = 𝐶
3	2	biantru 539	. . 3 ⊢ (𝐴 = 𝐵 ↔ (𝐴 = 𝐵 ∧ 𝐶 = 𝐶))
4	1, 3	bitr4di 292	. 2 ⊢ ((𝐴 ≠ ∅ ∧ 𝐶 ≠ ∅) → ((𝐴 × 𝐶) = (𝐵 × 𝐶) ↔ 𝐴 = 𝐵))
5		nne 2965	. . 3 ⊢ (¬ 𝐴 ≠ ∅ ↔ 𝐴 = ∅)
6		simpl 488	. . . . 5 ⊢ ((𝐴 = ∅ ∧ 𝐶 ≠ ∅) → 𝐴 = ∅)
7		xpeq1 5680	. . . . . . . . . 10 ⊢ (𝐴 = ∅ → (𝐴 × 𝐶) = (∅ × 𝐶))
8		0xp 5765	. . . . . . . . . 10 ⊢ (∅ × 𝐶) = ∅
9	7, 8	eqtrdi 2817	. . . . . . . . 9 ⊢ (𝐴 = ∅ → (𝐴 × 𝐶) = ∅)
10	9	eqeq1d 2768	. . . . . . . 8 ⊢ (𝐴 = ∅ → ((𝐴 × 𝐶) = (𝐵 × 𝐶) ↔ ∅ = (𝐵 × 𝐶)))
11		eqcom 2773	. . . . . . . 8 ⊢ (∅ = (𝐵 × 𝐶) ↔ (𝐵 × 𝐶) = ∅)
12	10, 11	bitrdi 290	. . . . . . 7 ⊢ (𝐴 = ∅ → ((𝐴 × 𝐶) = (𝐵 × 𝐶) ↔ (𝐵 × 𝐶) = ∅))
13	12	adantr 486	. . . . . 6 ⊢ ((𝐴 = ∅ ∧ 𝐶 ≠ ∅) → ((𝐴 × 𝐶) = (𝐵 × 𝐶) ↔ (𝐵 × 𝐶) = ∅))
14		df-ne 2962	. . . . . . . 8 ⊢ (𝐶 ≠ ∅ ↔ ¬ 𝐶 = ∅)
15		xpeq0 6162	. . . . . . . . 9 ⊢ ((𝐵 × 𝐶) = ∅ ↔ (𝐵 = ∅ ∨ 𝐶 = ∅))
16		orel2 904	. . . . . . . . 9 ⊢ (¬ 𝐶 = ∅ → ((𝐵 = ∅ ∨ 𝐶 = ∅) → 𝐵 = ∅))
17	15, 16	biimtrid 245	. . . . . . . 8 ⊢ (¬ 𝐶 = ∅ → ((𝐵 × 𝐶) = ∅ → 𝐵 = ∅))
18	14, 17	sylbi 220	. . . . . . 7 ⊢ (𝐶 ≠ ∅ → ((𝐵 × 𝐶) = ∅ → 𝐵 = ∅))
19	18	adantl 487	. . . . . 6 ⊢ ((𝐴 = ∅ ∧ 𝐶 ≠ ∅) → ((𝐵 × 𝐶) = ∅ → 𝐵 = ∅))
20	13, 19	sylbid 243	. . . . 5 ⊢ ((𝐴 = ∅ ∧ 𝐶 ≠ ∅) → ((𝐴 × 𝐶) = (𝐵 × 𝐶) → 𝐵 = ∅))
21		eqtr3 2788	. . . . 5 ⊢ ((𝐴 = ∅ ∧ 𝐵 = ∅) → 𝐴 = 𝐵)
22	6, 20, 21	syl6an 697	. . . 4 ⊢ ((𝐴 = ∅ ∧ 𝐶 ≠ ∅) → ((𝐴 × 𝐶) = (𝐵 × 𝐶) → 𝐴 = 𝐵))
23		xpeq1 5680	. . . 4 ⊢ (𝐴 = 𝐵 → (𝐴 × 𝐶) = (𝐵 × 𝐶))
24	22, 23	impbid1 228	. . 3 ⊢ ((𝐴 = ∅ ∧ 𝐶 ≠ ∅) → ((𝐴 × 𝐶) = (𝐵 × 𝐶) ↔ 𝐴 = 𝐵))
25	5, 24	sylanb 593	. 2 ⊢ ((¬ 𝐴 ≠ ∅ ∧ 𝐶 ≠ ∅) → ((𝐴 × 𝐶) = (𝐵 × 𝐶) ↔ 𝐴 = 𝐵))
26	4, 25	pm2.61ian 824	1 ⊢ (𝐶 ≠ ∅ → ((𝐴 × 𝐶) = (𝐵 × 𝐶) ↔ 𝐴 = 𝐵))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ≠ wne 2961  ∅c0 4289   × cxp 5664

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-11 2195  ax-ext 2738  ax-sep 5262  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-xp 5672  df-rel 5673  df-cnv 5674  df-dm 5676  df-rn 5677

This theorem is used by: (None)