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

Theorem suppofss2dcl 6478
Description: Condition for the support of a function operation to be a subset of the support of the right function term. (Contributed by Thierry Arnoux, 21-Jun-2019.)
Hypotheses
Ref Expression
suppofssd.1  |-  ( ph  ->  A  e.  V )
suppofssd.2  |-  ( ph  ->  Z  e.  B )
suppofssd.3  |-  ( ph  ->  F : A --> B )
suppofssd.4  |-  ( ph  ->  G : A --> B )
suppofss1dcl.cl  |-  ( (
ph  /\  ( u  e.  B  /\  v  e.  B ) )  -> 
( u X v )  e.  B )
suppofss2d.5  |-  ( (
ph  /\  x  e.  B )  ->  (
x X Z )  =  Z )
Assertion
Ref Expression
suppofss2dcl  |-  ( ph  ->  ( ( F  oF X G ) supp 
Z )  C_  ( G supp  Z ) )
Distinct variable groups:    x, A    x, B    x, F    x, G    x, X    x, Z    ph, x    u, B, v    ph, u, v    u, F, v    v, G    u, X, v
Allowed substitution hints:    A( v, u)    G( u)    V( x, v, u)    Z( v, u)

Proof of Theorem suppofss2dcl
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 suppofssd.3 . . . . . . . 8  |-  ( ph  ->  F : A --> B )
21ffnd 5514 . . . . . . 7  |-  ( ph  ->  F  Fn  A )
3 suppofssd.4 . . . . . . . 8  |-  ( ph  ->  G : A --> B )
43ffnd 5514 . . . . . . 7  |-  ( ph  ->  G  Fn  A )
5 suppofssd.1 . . . . . . 7  |-  ( ph  ->  A  e.  V )
6 inidm 3434 . . . . . . 7  |-  ( A  i^i  A )  =  A
7 eqidd 2235 . . . . . . 7  |-  ( (
ph  /\  y  e.  A )  ->  ( F `  y )  =  ( F `  y ) )
8 eqidd 2235 . . . . . . 7  |-  ( (
ph  /\  y  e.  A )  ->  ( G `  y )  =  ( G `  y ) )
9 oveq2 6066 . . . . . . . . 9  |-  ( v  =  ( G `  y )  ->  (
( F `  y
) X v )  =  ( ( F `
 y ) X ( G `  y
) ) )
109eleq1d 2303 . . . . . . . 8  |-  ( v  =  ( G `  y )  ->  (
( ( F `  y ) X v )  e.  B  <->  ( ( F `  y ) X ( G `  y ) )  e.  B ) )
11 oveq1 6065 . . . . . . . . . . 11  |-  ( u  =  ( F `  y )  ->  (
u X v )  =  ( ( F `
 y ) X v ) )
1211eleq1d 2303 . . . . . . . . . 10  |-  ( u  =  ( F `  y )  ->  (
( u X v )  e.  B  <->  ( ( F `  y ) X v )  e.  B ) )
1312ralbidv 2544 . . . . . . . . 9  |-  ( u  =  ( F `  y )  ->  ( A. v  e.  B  ( u X v )  e.  B  <->  A. v  e.  B  ( ( F `  y ) X v )  e.  B ) )
14 suppofss1dcl.cl . . . . . . . . . . 11  |-  ( (
ph  /\  ( u  e.  B  /\  v  e.  B ) )  -> 
( u X v )  e.  B )
1514ralrimivva 2626 . . . . . . . . . 10  |-  ( ph  ->  A. u  e.  B  A. v  e.  B  ( u X v )  e.  B )
1615adantr 276 . . . . . . . . 9  |-  ( (
ph  /\  y  e.  A )  ->  A. u  e.  B  A. v  e.  B  ( u X v )  e.  B )
171ffvelcdmda 5817 . . . . . . . . 9  |-  ( (
ph  /\  y  e.  A )  ->  ( F `  y )  e.  B )
1813, 16, 17rspcdva 2928 . . . . . . . 8  |-  ( (
ph  /\  y  e.  A )  ->  A. v  e.  B  ( ( F `  y ) X v )  e.  B )
193ffvelcdmda 5817 . . . . . . . 8  |-  ( (
ph  /\  y  e.  A )  ->  ( G `  y )  e.  B )
2010, 18, 19rspcdva 2928 . . . . . . 7  |-  ( (
ph  /\  y  e.  A )  ->  (
( F `  y
) X ( G `
 y ) )  e.  B )
212, 4, 5, 5, 6, 7, 8, 20ofvalg 6285 . . . . . 6  |-  ( (
ph  /\  y  e.  A )  ->  (
( F  oF X G ) `  y )  =  ( ( F `  y
) X ( G `
 y ) ) )
2221adantr 276 . . . . 5  |-  ( ( ( ph  /\  y  e.  A )  /\  ( G `  y )  =  Z )  ->  (
( F  oF X G ) `  y )  =  ( ( F `  y
) X ( G `
 y ) ) )
23 simpr 110 . . . . . 6  |-  ( ( ( ph  /\  y  e.  A )  /\  ( G `  y )  =  Z )  ->  ( G `  y )  =  Z )
2423oveq2d 6074 . . . . 5  |-  ( ( ( ph  /\  y  e.  A )  /\  ( G `  y )  =  Z )  ->  (
( F `  y
) X ( G `
 y ) )  =  ( ( F `
 y ) X Z ) )
25 suppofss2d.5 . . . . . . . . 9  |-  ( (
ph  /\  x  e.  B )  ->  (
x X Z )  =  Z )
2625ralrimiva 2617 . . . . . . . 8  |-  ( ph  ->  A. x  e.  B  ( x X Z )  =  Z )
2726adantr 276 . . . . . . 7  |-  ( (
ph  /\  y  e.  A )  ->  A. x  e.  B  ( x X Z )  =  Z )
28 simpr 110 . . . . . . . . . 10  |-  ( ( ( ph  /\  y  e.  A )  /\  x  =  ( F `  y ) )  ->  x  =  ( F `  y ) )
2928oveq1d 6073 . . . . . . . . 9  |-  ( ( ( ph  /\  y  e.  A )  /\  x  =  ( F `  y ) )  -> 
( x X Z )  =  ( ( F `  y ) X Z ) )
3029eqeq1d 2243 . . . . . . . 8  |-  ( ( ( ph  /\  y  e.  A )  /\  x  =  ( F `  y ) )  -> 
( ( x X Z )  =  Z  <-> 
( ( F `  y ) X Z )  =  Z ) )
3117, 30rspcdv 2926 . . . . . . 7  |-  ( (
ph  /\  y  e.  A )  ->  ( A. x  e.  B  ( x X Z )  =  Z  -> 
( ( F `  y ) X Z )  =  Z ) )
3227, 31mpd 13 . . . . . 6  |-  ( (
ph  /\  y  e.  A )  ->  (
( F `  y
) X Z )  =  Z )
3332adantr 276 . . . . 5  |-  ( ( ( ph  /\  y  e.  A )  /\  ( G `  y )  =  Z )  ->  (
( F `  y
) X Z )  =  Z )
3422, 24, 333eqtrd 2271 . . . 4  |-  ( ( ( ph  /\  y  e.  A )  /\  ( G `  y )  =  Z )  ->  (
( F  oF X G ) `  y )  =  Z )
3534ex 115 . . 3  |-  ( (
ph  /\  y  e.  A )  ->  (
( G `  y
)  =  Z  -> 
( ( F  oF X G ) `
 y )  =  Z ) )
3635ralrimiva 2617 . 2  |-  ( ph  ->  A. y  e.  A  ( ( G `  y )  =  Z  ->  ( ( F  oF X G ) `  y )  =  Z ) )
3714, 1, 3, 5, 5, 6off 6288 . . . 4  |-  ( ph  ->  ( F  oF X G ) : A --> B )
3837ffnd 5514 . . 3  |-  ( ph  ->  ( F  oF X G )  Fn  A )
39 ssidd 3263 . . 3  |-  ( ph  ->  A  C_  A )
40 suppofssd.2 . . 3  |-  ( ph  ->  Z  e.  B )
41 suppfnss 6470 . . 3  |-  ( ( ( ( F  oF X G )  Fn  A  /\  G  Fn  A )  /\  ( A  C_  A  /\  A  e.  V  /\  Z  e.  B ) )  -> 
( A. y  e.  A  ( ( G `
 y )  =  Z  ->  ( ( F  oF X G ) `  y )  =  Z )  -> 
( ( F  oF X G ) supp 
Z )  C_  ( G supp  Z ) ) )
4238, 4, 39, 5, 40, 41syl23anc 1281 . 2  |-  ( ph  ->  ( A. y  e.  A  ( ( G `
 y )  =  Z  ->  ( ( F  oF X G ) `  y )  =  Z )  -> 
( ( F  oF X G ) supp 
Z )  C_  ( G supp  Z ) ) )
4336, 42mpd 13 1  |-  ( ph  ->  ( ( F  oF X G ) supp 
Z )  C_  ( G supp  Z ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2205   A.wral 2522    C_ wss 3214    Fn wfn 5352   -->wf 5353   ` cfv 5357  (class class class)co 6058    oFcof 6273   supp csupp 6448
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-in1 619  ax-in2 620  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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-of 6275  df-supp 6449
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator