Theorem xpcanm 5109

Description: Cancellation law for cross-product. (Contributed by Jim Kingdon, 14-Dec-2018.)

Assertion

Ref	Expression
xpcanm	|- ( E. x x e. C -> ( ( C X. A ) = ( C X. B ) <-> A = B ) )

Distinct variable group:   x, C

Allowed substitution hints:   A( x)   B( x)

Proof of Theorem xpcanm

Step	Hyp	Ref	Expression
1		ssxp2 5107	. . 3 |- ( E. x x e. C -> ( ( C X. A ) C_ ( C X. B ) <-> A C_ B ) )
2		ssxp2 5107	. . 3 |- ( E. x x e. C -> ( ( C X. B ) C_ ( C X. A ) <-> B C_ A ) )
3	1, 2	anbi12d 473	. 2 |- ( E. x x e. C -> ( ( ( C X. A ) C_ ( C X. B ) /\ ( C X. B ) C_ ( C X. A ) ) <-> ( A C_ B /\ B C_ A ) ) )
4		eqss 3198	. 2 |- ( ( C X. A ) = ( C X. B ) <-> ( ( C X. A ) C_ ( C X. B ) /\ ( C X. B ) C_ ( C X. A ) ) )
5		eqss 3198	. 2 |- ( A = B <-> ( A C_ B /\ B C_ A ) )
6	3, 4, 5	3bitr4g 223	1 |- ( E. x x e. C -> ( ( C X. A ) = ( C X. B ) <-> A = B ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1364   E.wex 1506   e. wcel 2167   C_ wss 3157   X. cxp 4661

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-br 4034  df-opab 4095  df-xp 4669  df-rel 4670  df-cnv 4671  df-dm 4673  df-rn 4674

This theorem is referenced by: (None)