Theorem xp11m 5069

Description: The cross product of inhabited classes is one-to-one. (Contributed by Jim Kingdon, 13-Dec-2018.)

Assertion

Ref	Expression
xp11m	⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 ∈ 𝐵) → ((𝐴 × 𝐵) = (𝐶 × 𝐷) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))

Distinct variable groups:   𝑥,𝐴   𝑦,𝐵

Allowed substitution hints:   𝐴(𝑦)   𝐵(𝑥)   𝐶(𝑥,𝑦)   𝐷(𝑥,𝑦)

Proof of Theorem xp11m

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		xpm 5052	. . 3 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 ∈ 𝐵) ↔ ∃𝑧 𝑧 ∈ (𝐴 × 𝐵))
2		anidm 396	. . . . . 6 ⊢ ((∃𝑧 𝑧 ∈ (𝐴 × 𝐵) ∧ ∃𝑧 𝑧 ∈ (𝐴 × 𝐵)) ↔ ∃𝑧 𝑧 ∈ (𝐴 × 𝐵))
3		eleq2 2241	. . . . . . . 8 ⊢ ((𝐴 × 𝐵) = (𝐶 × 𝐷) → (𝑧 ∈ (𝐴 × 𝐵) ↔ 𝑧 ∈ (𝐶 × 𝐷)))
4	3	exbidv 1825	. . . . . . 7 ⊢ ((𝐴 × 𝐵) = (𝐶 × 𝐷) → (∃𝑧 𝑧 ∈ (𝐴 × 𝐵) ↔ ∃𝑧 𝑧 ∈ (𝐶 × 𝐷)))
5	4	anbi2d 464	. . . . . 6 ⊢ ((𝐴 × 𝐵) = (𝐶 × 𝐷) → ((∃𝑧 𝑧 ∈ (𝐴 × 𝐵) ∧ ∃𝑧 𝑧 ∈ (𝐴 × 𝐵)) ↔ (∃𝑧 𝑧 ∈ (𝐴 × 𝐵) ∧ ∃𝑧 𝑧 ∈ (𝐶 × 𝐷))))
6	2, 5	bitr3id 194	. . . . 5 ⊢ ((𝐴 × 𝐵) = (𝐶 × 𝐷) → (∃𝑧 𝑧 ∈ (𝐴 × 𝐵) ↔ (∃𝑧 𝑧 ∈ (𝐴 × 𝐵) ∧ ∃𝑧 𝑧 ∈ (𝐶 × 𝐷))))
7		eqimss 3211	. . . . . . . 8 ⊢ ((𝐴 × 𝐵) = (𝐶 × 𝐷) → (𝐴 × 𝐵) ⊆ (𝐶 × 𝐷))
8		ssxpbm 5066	. . . . . . . 8 ⊢ (∃𝑧 𝑧 ∈ (𝐴 × 𝐵) → ((𝐴 × 𝐵) ⊆ (𝐶 × 𝐷) ↔ (𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷)))
9	7, 8	syl5ibcom 155	. . . . . . 7 ⊢ ((𝐴 × 𝐵) = (𝐶 × 𝐷) → (∃𝑧 𝑧 ∈ (𝐴 × 𝐵) → (𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷)))
10		eqimss2 3212	. . . . . . . 8 ⊢ ((𝐴 × 𝐵) = (𝐶 × 𝐷) → (𝐶 × 𝐷) ⊆ (𝐴 × 𝐵))
11		ssxpbm 5066	. . . . . . . 8 ⊢ (∃𝑧 𝑧 ∈ (𝐶 × 𝐷) → ((𝐶 × 𝐷) ⊆ (𝐴 × 𝐵) ↔ (𝐶 ⊆ 𝐴 ∧ 𝐷 ⊆ 𝐵)))
12	10, 11	syl5ibcom 155	. . . . . . 7 ⊢ ((𝐴 × 𝐵) = (𝐶 × 𝐷) → (∃𝑧 𝑧 ∈ (𝐶 × 𝐷) → (𝐶 ⊆ 𝐴 ∧ 𝐷 ⊆ 𝐵)))
13	9, 12	anim12d 335	. . . . . 6 ⊢ ((𝐴 × 𝐵) = (𝐶 × 𝐷) → ((∃𝑧 𝑧 ∈ (𝐴 × 𝐵) ∧ ∃𝑧 𝑧 ∈ (𝐶 × 𝐷)) → ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ⊆ 𝐵))))
14		an4 586	. . . . . . 7 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ⊆ 𝐵)) ↔ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐴) ∧ (𝐵 ⊆ 𝐷 ∧ 𝐷 ⊆ 𝐵)))
15		eqss 3172	. . . . . . . 8 ⊢ (𝐴 = 𝐶 ↔ (𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐴))
16		eqss 3172	. . . . . . . 8 ⊢ (𝐵 = 𝐷 ↔ (𝐵 ⊆ 𝐷 ∧ 𝐷 ⊆ 𝐵))
17	15, 16	anbi12i 460	. . . . . . 7 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ↔ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐴) ∧ (𝐵 ⊆ 𝐷 ∧ 𝐷 ⊆ 𝐵)))
18	14, 17	bitr4i 187	. . . . . 6 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ⊆ 𝐵)) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))
19	13, 18	imbitrdi 161	. . . . 5 ⊢ ((𝐴 × 𝐵) = (𝐶 × 𝐷) → ((∃𝑧 𝑧 ∈ (𝐴 × 𝐵) ∧ ∃𝑧 𝑧 ∈ (𝐶 × 𝐷)) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
20	6, 19	sylbid 150	. . . 4 ⊢ ((𝐴 × 𝐵) = (𝐶 × 𝐷) → (∃𝑧 𝑧 ∈ (𝐴 × 𝐵) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
21	20	com12 30	. . 3 ⊢ (∃𝑧 𝑧 ∈ (𝐴 × 𝐵) → ((𝐴 × 𝐵) = (𝐶 × 𝐷) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
22	1, 21	sylbi 121	. 2 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 ∈ 𝐵) → ((𝐴 × 𝐵) = (𝐶 × 𝐷) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
23		xpeq12 4647	. 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐴 × 𝐵) = (𝐶 × 𝐷))
24	22, 23	impbid1 142	1 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 ∈ 𝐵) → ((𝐴 × 𝐵) = (𝐶 × 𝐷) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1353  ∃wex 1492   ∈ wcel 2148   ⊆ wss 3131   × cxp 4626

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-br 4006  df-opab 4067  df-xp 4634  df-rel 4635  df-cnv 4636  df-dm 4638  df-rn 4639

This theorem is referenced by:  cc2lem  7268  lmodfopnelem1  13420