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

Theorem caofrss 6276
Description: Transfer a relation subset law to the function relation. (Contributed by Mario Carneiro, 28-Jul-2014.)
Hypotheses
Ref Expression
caofref.1  |-  ( ph  ->  A  e.  V )
caofref.2  |-  ( ph  ->  F : A --> S )
caofcom.3  |-  ( ph  ->  G : A --> S )
caofrss.4  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x R y  ->  x T y ) )
Assertion
Ref Expression
caofrss  |-  ( ph  ->  ( F  oR R G  ->  F  oR T G ) )
Distinct variable groups:    x, y, F   
x, G, y    ph, x, y    x, R, y    x, S, y    x, T, y
Allowed substitution hints:    A( x, y)    V( x, y)

Proof of Theorem caofrss
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 caofref.2 . . . . 5  |-  ( ph  ->  F : A --> S )
21ffvelcdmda 5790 . . . 4  |-  ( (
ph  /\  w  e.  A )  ->  ( F `  w )  e.  S )
3 caofcom.3 . . . . 5  |-  ( ph  ->  G : A --> S )
43ffvelcdmda 5790 . . . 4  |-  ( (
ph  /\  w  e.  A )  ->  ( G `  w )  e.  S )
5 caofrss.4 . . . . . 6  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x R y  ->  x T y ) )
65ralrimivva 2615 . . . . 5  |-  ( ph  ->  A. x  e.  S  A. y  e.  S  ( x R y  ->  x T y ) )
76adantr 276 . . . 4  |-  ( (
ph  /\  w  e.  A )  ->  A. x  e.  S  A. y  e.  S  ( x R y  ->  x T y ) )
8 breq1 4096 . . . . . 6  |-  ( x  =  ( F `  w )  ->  (
x R y  <->  ( F `  w ) R y ) )
9 breq1 4096 . . . . . 6  |-  ( x  =  ( F `  w )  ->  (
x T y  <->  ( F `  w ) T y ) )
108, 9imbi12d 234 . . . . 5  |-  ( x  =  ( F `  w )  ->  (
( x R y  ->  x T y )  <->  ( ( F `
 w ) R y  ->  ( F `  w ) T y ) ) )
11 breq2 4097 . . . . . 6  |-  ( y  =  ( G `  w )  ->  (
( F `  w
) R y  <->  ( F `  w ) R ( G `  w ) ) )
12 breq2 4097 . . . . . 6  |-  ( y  =  ( G `  w )  ->  (
( F `  w
) T y  <->  ( F `  w ) T ( G `  w ) ) )
1311, 12imbi12d 234 . . . . 5  |-  ( y  =  ( G `  w )  ->  (
( ( F `  w ) R y  ->  ( F `  w ) T y )  <->  ( ( F `
 w ) R ( G `  w
)  ->  ( F `  w ) T ( G `  w ) ) ) )
1410, 13rspc2va 2925 . . . 4  |-  ( ( ( ( F `  w )  e.  S  /\  ( G `  w
)  e.  S )  /\  A. x  e.  S  A. y  e.  S  ( x R y  ->  x T
y ) )  -> 
( ( F `  w ) R ( G `  w )  ->  ( F `  w ) T ( G `  w ) ) )
152, 4, 7, 14syl21anc 1273 . . 3  |-  ( (
ph  /\  w  e.  A )  ->  (
( F `  w
) R ( G `
 w )  -> 
( F `  w
) T ( G `
 w ) ) )
1615ralimdva 2600 . 2  |-  ( ph  ->  ( A. w  e.  A  ( F `  w ) R ( G `  w )  ->  A. w  e.  A  ( F `  w ) T ( G `  w ) ) )
17 ffn 5489 . . . 4  |-  ( F : A --> S  ->  F  Fn  A )
181, 17syl 14 . . 3  |-  ( ph  ->  F  Fn  A )
19 ffn 5489 . . . 4  |-  ( G : A --> S  ->  G  Fn  A )
203, 19syl 14 . . 3  |-  ( ph  ->  G  Fn  A )
21 caofref.1 . . 3  |-  ( ph  ->  A  e.  V )
22 inidm 3418 . . 3  |-  ( A  i^i  A )  =  A
23 eqidd 2232 . . 3  |-  ( (
ph  /\  w  e.  A )  ->  ( F `  w )  =  ( F `  w ) )
24 eqidd 2232 . . 3  |-  ( (
ph  /\  w  e.  A )  ->  ( G `  w )  =  ( G `  w ) )
2518, 20, 21, 21, 22, 23, 24ofrfval 6253 . 2  |-  ( ph  ->  ( F  oR R G  <->  A. w  e.  A  ( F `  w ) R ( G `  w ) ) )
2618, 20, 21, 21, 22, 23, 24ofrfval 6253 . 2  |-  ( ph  ->  ( F  oR T G  <->  A. w  e.  A  ( F `  w ) T ( G `  w ) ) )
2716, 25, 263imtr4d 203 1  |-  ( ph  ->  ( F  oR R G  ->  F  oR T G ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2202   A.wral 2511   class class class wbr 4093    Fn wfn 5328   -->wf 5329   ` cfv 5333    oRcofr 6243
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-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ofr 6245
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator