Theorem xp11 3476

Description: The cross product of non-empty classes is one-to-one.

Assertion

Ref	Expression
xp11	|- ((A =/= (/) /\ B =/= (/)) -> ((A X. B) = (C X. D) <-> (A = C /\ B = D)))

Proof of Theorem xp11

Step	Hyp	Ref	Expression
1		xpnz 3466	. . 3 |- ((A =/= (/) /\ B =/= (/)) <-> (A X. B) =/= (/))
2		neeq1 1590	. . . . . . 7 |- ((A X. B) = (C X. D) -> ((A X. B) =/= (/) <-> (C X. D) =/= (/)))
3	2	anbi2d 616	. . . . . 6 |- ((A X. B) = (C X. D) -> (((A X. B) =/= (/) /\ (A X. B) =/= (/)) <-> ((A X. B) =/= (/) /\ (C X. D) =/= (/))))
4		anidm 432	. . . . . 6 |- (((A X. B) =/= (/) /\ (A X. B) =/= (/)) <-> (A X. B) =/= (/))
5	3, 4	syl5bbr 534	. . . . 5 |- ((A X. B) = (C X. D) -> ((A X. B) =/= (/) <-> ((A X. B) =/= (/) /\ (C X. D) =/= (/))))
6		eqimss 2109	. . . . . . . 8 |- ((A X. B) = (C X. D) -> (A X. B) (_ (C X. D))
7		ssxpr 3475	. . . . . . . . 9 |- (((A X. B) =/= (/) /\ (A X. B) (_ (C X. D)) -> (A (_ C /\ B (_ D))
8	7	expcom 374	. . . . . . . 8 |- ((A X. B) (_ (C X. D) -> ((A X. B) =/= (/) -> (A (_ C /\ B (_ D)))
9	6, 8	syl 10	. . . . . . 7 |- ((A X. B) = (C X. D) -> ((A X. B) =/= (/) -> (A (_ C /\ B (_ D)))
10		eqimss2 2110	. . . . . . . 8 |- ((A X. B) = (C X. D) -> (C X. D) (_ (A X. B))
11		ssxpr 3475	. . . . . . . . 9 |- (((C X. D) =/= (/) /\ (C X. D) (_ (A X. B)) -> (C (_ A /\ D (_ B))
12	11	expcom 374	. . . . . . . 8 |- ((C X. D) (_ (A X. B) -> ((C X. D) =/= (/) -> (C (_ A /\ D (_ B)))
13	10, 12	syl 10	. . . . . . 7 |- ((A X. B) = (C X. D) -> ((C X. D) =/= (/) -> (C (_ A /\ D (_ B)))
14	9, 13	anim12d 558	. . . . . 6 |- ((A X. B) = (C X. D) -> (((A X. B) =/= (/) /\ (C X. D) =/= (/)) -> ((A (_ C /\ B (_ D) /\ (C (_ A /\ D (_ B))))
15		an4 506	. . . . . . 7 |- (((A (_ C /\ B (_ D) /\ (C (_ A /\ D (_ B)) <-> ((A (_ C /\ C (_ A) /\ (B (_ D /\ D (_ B)))
16		eqss 2077	. . . . . . . 8 |- (A = C <-> (A (_ C /\ C (_ A))
17		eqss 2077	. . . . . . . 8 |- (B = D <-> (B (_ D /\ D (_ B))
18	16, 17	anbi12i 482	. . . . . . 7 |- ((A = C /\ B = D) <-> ((A (_ C /\ C (_ A) /\ (B (_ D /\ D (_ B)))
19	15, 18	bitr4 176	. . . . . 6 |- (((A (_ C /\ B (_ D) /\ (C (_ A /\ D (_ B)) <-> (A = C /\ B = D))
20	14, 19	syl6ib 212	. . . . 5 |- ((A X. B) = (C X. D) -> (((A X. B) =/= (/) /\ (C X. D) =/= (/)) -> (A = C /\ B = D)))
21	5, 20	sylbid 203	. . . 4 |- ((A X. B) = (C X. D) -> ((A X. B) =/= (/) -> (A = C /\ B = D)))
22	21	com12 11	. . 3 |- ((A X. B) =/= (/) -> ((A X. B) = (C X. D) -> (A = C /\ B = D)))
23	1, 22	sylbi 199	. 2 |- ((A =/= (/) /\ B =/= (/)) -> ((A X. B) = (C X. D) -> (A = C /\ B = D)))
24		xpeq1 3200	. . 3 |- (A = C -> (A X. B) = (C X. B))
25		xpeq2 3201	. . 3 |- (B = D -> (C X. B) = (C X. D))
26	24, 25	sylan9eq 1527	. 2 |- ((A = C /\ B = D) -> (A X. B) = (C X. D))
27	23, 26	impbid1 517	1 |- ((A =/= (/) /\ B =/= (/)) -> ((A X. B) = (C X. D) <-> (A = C /\ B = D)))

Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   = wceq 956   =/= wne 1585   (_ wss 2047  (/)c0 2280   X. cxp 3168

This theorem is referenced by:  xp11a 3477  xp11b 3478

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-9 965  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-br 2620  df-opab 2667  df-xp 3184  df-rel 3185  df-cnv 3186  df-dm 3188  df-rn 3189

Copyright terms: Public domain