ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ssxp2 Unicode version

Theorem ssxp2 4971
Description: Cross product subset cancellation. (Contributed by Jim Kingdon, 14-Dec-2018.)
Assertion
Ref Expression
ssxp2  |-  ( E. x  x  e.  C  ->  ( ( C  X.  A )  C_  ( C  X.  B )  <->  A  C_  B
) )
Distinct variable group:    x, C
Allowed substitution hints:    A( x)    B( x)

Proof of Theorem ssxp2
StepHypRef Expression
1 rnxpm 4963 . . . . . 6  |-  ( E. x  x  e.  C  ->  ran  ( C  X.  A )  =  A )
21adantr 274 . . . . 5  |-  ( ( E. x  x  e.  C  /\  ( C  X.  A )  C_  ( C  X.  B
) )  ->  ran  ( C  X.  A
)  =  A )
3 rnss 4764 . . . . . 6  |-  ( ( C  X.  A ) 
C_  ( C  X.  B )  ->  ran  ( C  X.  A
)  C_  ran  ( C  X.  B ) )
43adantl 275 . . . . 5  |-  ( ( E. x  x  e.  C  /\  ( C  X.  A )  C_  ( C  X.  B
) )  ->  ran  ( C  X.  A
)  C_  ran  ( C  X.  B ) )
52, 4eqsstrrd 3129 . . . 4  |-  ( ( E. x  x  e.  C  /\  ( C  X.  A )  C_  ( C  X.  B
) )  ->  A  C_ 
ran  ( C  X.  B ) )
6 rnxpss 4965 . . . 4  |-  ran  ( C  X.  B )  C_  B
75, 6sstrdi 3104 . . 3  |-  ( ( E. x  x  e.  C  /\  ( C  X.  A )  C_  ( C  X.  B
) )  ->  A  C_  B )
87ex 114 . 2  |-  ( E. x  x  e.  C  ->  ( ( C  X.  A )  C_  ( C  X.  B )  ->  A  C_  B ) )
9 xpss2 4645 . 2  |-  ( A 
C_  B  ->  ( C  X.  A )  C_  ( C  X.  B
) )
108, 9impbid1 141 1  |-  ( E. x  x  e.  C  ->  ( ( C  X.  A )  C_  ( C  X.  B )  <->  A  C_  B
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1331   E.wex 1468    e. wcel 1480    C_ wss 3066    X. cxp 4532   ran crn 4535
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-br 3925  df-opab 3985  df-xp 4540  df-rel 4541  df-cnv 4542  df-dm 4544  df-rn 4545
This theorem is referenced by:  xpcanm  4973
  Copyright terms: Public domain W3C validator