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

Theorem xpdom1 6697
Description: Dominance law for Cartesian product. Theorem 6L(c) of [Enderton] p. 149. (Contributed by NM, 28-Sep-2004.) (Revised by NM, 29-Mar-2006.) (Revised by Mario Carneiro, 7-May-2015.)
Hypothesis
Ref Expression
xpdom1.2  |-  C  e. 
_V
Assertion
Ref Expression
xpdom1  |-  ( A  ~<_  B  ->  ( A  X.  C )  ~<_  ( B  X.  C ) )

Proof of Theorem xpdom1
StepHypRef Expression
1 xpdom1.2 . 2  |-  C  e. 
_V
2 xpdom1g 6695 . 2  |-  ( ( C  e.  _V  /\  A  ~<_  B )  -> 
( A  X.  C
)  ~<_  ( B  X.  C ) )
31, 2mpan 420 1  |-  ( A  ~<_  B  ->  ( A  X.  C )  ~<_  ( B  X.  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 1465   _Vcvv 2660   class class class wbr 3899    X. cxp 4507    ~<_ cdom 6601
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 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-13 1476  ax-14 1477  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099  ax-sep 4016  ax-pow 4068  ax-pr 4101  ax-un 4325
This theorem depends on definitions:  df-bi 116  df-3an 949  df-tru 1319  df-nf 1422  df-sb 1721  df-eu 1980  df-mo 1981  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ral 2398  df-rex 2399  df-rab 2402  df-v 2662  df-sbc 2883  df-csb 2976  df-un 3045  df-in 3047  df-ss 3054  df-pw 3482  df-sn 3503  df-pr 3504  df-op 3506  df-uni 3707  df-br 3900  df-opab 3960  df-mpt 3961  df-id 4185  df-xp 4515  df-rel 4516  df-cnv 4517  df-co 4518  df-dm 4519  df-rn 4520  df-res 4521  df-ima 4522  df-iota 5058  df-fun 5095  df-fn 5096  df-f 5097  df-f1 5098  df-fo 5099  df-f1o 5100  df-fv 5101  df-1st 6006  df-2nd 6007  df-en 6603  df-dom 6604
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator