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

Theorem fliftval 5940
Description: The value of the function  F. (Contributed by Mario Carneiro, 23-Dec-2016.)
Hypotheses
Ref Expression
flift.1  |-  F  =  ran  ( x  e.  X  |->  <. A ,  B >. )
flift.2  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  R )
flift.3  |-  ( (
ph  /\  x  e.  X )  ->  B  e.  S )
fliftval.4  |-  ( x  =  Y  ->  A  =  C )
fliftval.5  |-  ( x  =  Y  ->  B  =  D )
fliftval.6  |-  ( ph  ->  Fun  F )
Assertion
Ref Expression
fliftval  |-  ( (
ph  /\  Y  e.  X )  ->  ( F `  C )  =  D )
Distinct variable groups:    x, C    x, R    x, Y    x, D    ph, x    x, X    x, S
Allowed substitution hints:    A( x)    B( x)    F( x)

Proof of Theorem fliftval
StepHypRef Expression
1 fliftval.6 . . 3  |-  ( ph  ->  Fun  F )
21adantr 276 . 2  |-  ( (
ph  /\  Y  e.  X )  ->  Fun  F )
3 simpr 110 . . . 4  |-  ( (
ph  /\  Y  e.  X )  ->  Y  e.  X )
4 eqidd 2232 . . . . 5  |-  ( ph  ->  D  =  D )
5 eqidd 2232 . . . . 5  |-  ( Y  e.  X  ->  C  =  C )
64, 5anim12ci 339 . . . 4  |-  ( (
ph  /\  Y  e.  X )  ->  ( C  =  C  /\  D  =  D )
)
7 fliftval.4 . . . . . . 7  |-  ( x  =  Y  ->  A  =  C )
87eqeq2d 2243 . . . . . 6  |-  ( x  =  Y  ->  ( C  =  A  <->  C  =  C ) )
9 fliftval.5 . . . . . . 7  |-  ( x  =  Y  ->  B  =  D )
109eqeq2d 2243 . . . . . 6  |-  ( x  =  Y  ->  ( D  =  B  <->  D  =  D ) )
118, 10anbi12d 473 . . . . 5  |-  ( x  =  Y  ->  (
( C  =  A  /\  D  =  B )  <->  ( C  =  C  /\  D  =  D ) ) )
1211rspcev 2910 . . . 4  |-  ( ( Y  e.  X  /\  ( C  =  C  /\  D  =  D
) )  ->  E. x  e.  X  ( C  =  A  /\  D  =  B ) )
133, 6, 12syl2anc 411 . . 3  |-  ( (
ph  /\  Y  e.  X )  ->  E. x  e.  X  ( C  =  A  /\  D  =  B ) )
14 flift.1 . . . . 5  |-  F  =  ran  ( x  e.  X  |->  <. A ,  B >. )
15 flift.2 . . . . 5  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  R )
16 flift.3 . . . . 5  |-  ( (
ph  /\  x  e.  X )  ->  B  e.  S )
1714, 15, 16fliftel 5933 . . . 4  |-  ( ph  ->  ( C F D  <->  E. x  e.  X  ( C  =  A  /\  D  =  B
) ) )
1817adantr 276 . . 3  |-  ( (
ph  /\  Y  e.  X )  ->  ( C F D  <->  E. x  e.  X  ( C  =  A  /\  D  =  B ) ) )
1913, 18mpbird 167 . 2  |-  ( (
ph  /\  Y  e.  X )  ->  C F D )
20 funbrfv 5682 . 2  |-  ( Fun 
F  ->  ( C F D  ->  ( F `
 C )  =  D ) )
212, 19, 20sylc 62 1  |-  ( (
ph  /\  Y  e.  X )  ->  ( F `  C )  =  D )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1397    e. wcel 2202   E.wrex 2511   <.cop 3672   class class class wbr 4088    |-> cmpt 4150   ran crn 4726   Fun wfun 5320   ` cfv 5326
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-iota 5286  df-fun 5328  df-fv 5334
This theorem is referenced by:  qliftval  6789
  Copyright terms: Public domain W3C validator