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

Theorem f1imass 5434
Description: Taking images under a one-to-one function preserves subsets. (Contributed by Stefan O'Rear, 30-Oct-2014.)
Assertion
Ref Expression
f1imass  |-  ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A ) )  ->  ( ( F " C )  C_  ( F " D )  <-> 
C  C_  D )
)

Proof of Theorem f1imass
Dummy variable  a is distinct from all other variables.
StepHypRef Expression
1 simplrl 501 . . . . . . 7  |-  ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A
) )  /\  ( F " C )  C_  ( F " D ) )  ->  C  C_  A
)
21sseld 2998 . . . . . 6  |-  ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A
) )  /\  ( F " C )  C_  ( F " D ) )  ->  ( a  e.  C  ->  a  e.  A ) )
3 simplr 496 . . . . . . . . 9  |-  ( ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A ) )  /\  ( F " C ) 
C_  ( F " D ) )  /\  a  e.  A )  ->  ( F " C
)  C_  ( F " D ) )
43sseld 2998 . . . . . . . 8  |-  ( ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A ) )  /\  ( F " C ) 
C_  ( F " D ) )  /\  a  e.  A )  ->  ( ( F `  a )  e.  ( F " C )  ->  ( F `  a )  e.  ( F " D ) ) )
5 simplll 499 . . . . . . . . 9  |-  ( ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A ) )  /\  ( F " C ) 
C_  ( F " D ) )  /\  a  e.  A )  ->  F : A -1-1-> B
)
6 simpr 108 . . . . . . . . 9  |-  ( ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A ) )  /\  ( F " C ) 
C_  ( F " D ) )  /\  a  e.  A )  ->  a  e.  A )
7 simp1rl 1003 . . . . . . . . . 10  |-  ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A
) )  /\  ( F " C )  C_  ( F " D )  /\  a  e.  A
)  ->  C  C_  A
)
873expa 1138 . . . . . . . . 9  |-  ( ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A ) )  /\  ( F " C ) 
C_  ( F " D ) )  /\  a  e.  A )  ->  C  C_  A )
9 f1elima 5433 . . . . . . . . 9  |-  ( ( F : A -1-1-> B  /\  a  e.  A  /\  C  C_  A )  ->  ( ( F `
 a )  e.  ( F " C
)  <->  a  e.  C
) )
105, 6, 8, 9syl3anc 1169 . . . . . . . 8  |-  ( ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A ) )  /\  ( F " C ) 
C_  ( F " D ) )  /\  a  e.  A )  ->  ( ( F `  a )  e.  ( F " C )  <-> 
a  e.  C ) )
11 simp1rr 1004 . . . . . . . . . 10  |-  ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A
) )  /\  ( F " C )  C_  ( F " D )  /\  a  e.  A
)  ->  D  C_  A
)
12113expa 1138 . . . . . . . . 9  |-  ( ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A ) )  /\  ( F " C ) 
C_  ( F " D ) )  /\  a  e.  A )  ->  D  C_  A )
13 f1elima 5433 . . . . . . . . 9  |-  ( ( F : A -1-1-> B  /\  a  e.  A  /\  D  C_  A )  ->  ( ( F `
 a )  e.  ( F " D
)  <->  a  e.  D
) )
145, 6, 12, 13syl3anc 1169 . . . . . . . 8  |-  ( ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A ) )  /\  ( F " C ) 
C_  ( F " D ) )  /\  a  e.  A )  ->  ( ( F `  a )  e.  ( F " D )  <-> 
a  e.  D ) )
154, 10, 143imtr3d 200 . . . . . . 7  |-  ( ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A ) )  /\  ( F " C ) 
C_  ( F " D ) )  /\  a  e.  A )  ->  ( a  e.  C  ->  a  e.  D ) )
1615ex 113 . . . . . 6  |-  ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A
) )  /\  ( F " C )  C_  ( F " D ) )  ->  ( a  e.  A  ->  ( a  e.  C  ->  a  e.  D ) ) )
172, 16syld 44 . . . . 5  |-  ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A
) )  /\  ( F " C )  C_  ( F " D ) )  ->  ( a  e.  C  ->  ( a  e.  C  ->  a  e.  D ) ) )
1817pm2.43d 49 . . . 4  |-  ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A
) )  /\  ( F " C )  C_  ( F " D ) )  ->  ( a  e.  C  ->  a  e.  D ) )
1918ssrdv 3005 . . 3  |-  ( ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A
) )  /\  ( F " C )  C_  ( F " D ) )  ->  C  C_  D
)
2019ex 113 . 2  |-  ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A ) )  ->  ( ( F " C )  C_  ( F " D )  ->  C  C_  D
) )
21 imass2 4721 . 2  |-  ( C 
C_  D  ->  ( F " C )  C_  ( F " D ) )
2220, 21impbid1 140 1  |-  ( ( F : A -1-1-> B  /\  ( C  C_  A  /\  D  C_  A ) )  ->  ( ( F " C )  C_  ( F " D )  <-> 
C  C_  D )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    e. wcel 1433    C_ wss 2973   "cima 4366   -1-1->wf1 4919   ` cfv 4922
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-sbc 2816  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fv 4930
This theorem is referenced by:  f1imaeq  5435
  Copyright terms: Public domain W3C validator