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

Theorem domssr 7017
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 6986 . . 3  |-  ( A  ~<_  B  ->  E. f 
f : A -1-1-> B
)
213ad2ant3 1047 . 2  |-  ( ( C  e.  V  /\  B  C_  C  /\  A  ~<_  B )  ->  E. f 
f : A -1-1-> B
)
3 simp2 1025 . . 3  |-  ( ( C  e.  V  /\  B  C_  C  /\  A  ~<_  B )  ->  B  C_  C )
4 reldom 6980 . . . . 5  |-  Rel  ~<_
54brrelex1i 4793 . . . 4  |-  ( A  ~<_  B  ->  A  e.  _V )
653ad2ant3 1047 . . 3  |-  ( ( C  e.  V  /\  B  C_  C  /\  A  ~<_  B )  ->  A  e.  _V )
7 simp1 1024 . . 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 5579 . . . . 5  |-  ( ( f : A -1-1-> B  /\  B  C_  C )  ->  f : A -1-1-> C )
10 vex 2816 . . . . . . 7  |-  f  e. 
_V
11 f1dom4g 6992 . . . . . . 7  |-  ( ( ( f  e.  _V  /\  A  e.  _V  /\  C  e.  V )  /\  f : A -1-1-> C
)  ->  A  ~<_  C )
1210, 11mp3anl1 1368 . . . . . 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 1647 . 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
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005   E.wex 1541    e. wcel 2203   _Vcvv 2813    C_ wss 3211   class class class wbr 4109   -1-1->wf1 5349    ~<_ cdom 6974
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-dom 6977
This theorem is referenced by:  rex2dom  7063
  Copyright terms: Public domain W3C validator