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

Theorem domssr 7064
Description: If  C is a superset of  B and  B dominates  A, then  C also dominates  A. (Contributed by BTernaryTau, 7-Dec-2024.)
Assertion
Ref Expression
domssr  |-  ( ( C  e.  V  /\  B  C_  C  /\  A  ~<_  B )  ->  A  ~<_  C )

Proof of Theorem domssr
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 brdomi 7033 . . 3  |-  ( A  ~<_  B  ->  E. f 
f : A -1-1-> B
)
213ad2ant3 1051 . 2  |-  ( ( C  e.  V  /\  B  C_  C  /\  A  ~<_  B )  ->  E. f 
f : A -1-1-> B
)
3 simp2 1029 . . 3  |-  ( ( C  e.  V  /\  B  C_  C  /\  A  ~<_  B )  ->  B  C_  C )
4 reldom 7027 . . . . 5  |-  Rel  ~<_
54brrelex1i 4818 . . . 4  |-  ( A  ~<_  B  ->  A  e.  _V )
653ad2ant3 1051 . . 3  |-  ( ( C  e.  V  /\  B  C_  C  /\  A  ~<_  B )  ->  A  e.  _V )
7 simp1 1028 . . 3  |-  ( ( C  e.  V  /\  B  C_  C  /\  A  ~<_  B )  ->  C  e.  V )
83, 6, 7jca32 310 . 2  |-  ( ( C  e.  V  /\  B  C_  C  /\  A  ~<_  B )  ->  ( B  C_  C  /\  ( A  e.  _V  /\  C  e.  V ) ) )
9 f1ss 5604 . . . . 5  |-  ( ( f : A -1-1-> B  /\  B  C_  C )  ->  f : A -1-1-> C )
10 vex 2824 . . . . . . 7  |-  f  e. 
_V
11 f1dom4g 7039 . . . . . . 7  |-  ( ( ( f  e.  _V  /\  A  e.  _V  /\  C  e.  V )  /\  f : A -1-1-> C
)  ->  A  ~<_  C )
1210, 11mp3anl1 1372 . . . . . 6  |-  ( ( ( A  e.  _V  /\  C  e.  V )  /\  f : A -1-1-> C )  ->  A  ~<_  C )
1312ancoms 268 . . . . 5  |-  ( ( f : A -1-1-> C  /\  ( A  e.  _V  /\  C  e.  V ) )  ->  A  ~<_  C )
149, 13sylan 283 . . . 4  |-  ( ( ( f : A -1-1-> B  /\  B  C_  C
)  /\  ( A  e.  _V  /\  C  e.  V ) )  ->  A  ~<_  C )
1514expl 378 . . 3  |-  ( f : A -1-1-> B  -> 
( ( B  C_  C  /\  ( A  e. 
_V  /\  C  e.  V ) )  ->  A  ~<_  C ) )
1615exlimiv 1651 . 2  |-  ( E. f  f : A -1-1-> B  ->  ( ( B 
C_  C  /\  ( A  e.  _V  /\  C  e.  V ) )  ->  A  ~<_  C ) )
172, 8, 16sylc 62 1  |-  ( ( C  e.  V  /\  B  C_  C  /\  A  ~<_  B )  ->  A  ~<_  C )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    /\ w3a 1009   E.wex 1545    e. wcel 2209   _Vcvv 2821    C_ wss 3220   class class class wbr 4130   -1-1->wf1 5374    ~<_ cdom 7021
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-dom 7024
This theorem is used by:  rex2dom  7110
  Copyright terms: Public domain W3C validator