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

Theorem suppssfvg 6441
Description: Formula building theorem for support restriction, on a function which preserves zero. (Contributed by Stefan O'Rear, 9-Mar-2015.) (Revised by AV, 28-May-2019.)
Hypotheses
Ref Expression
suppssfv.a  |-  ( ph  ->  ( ( x  e.  D  |->  A ) supp  Y
)  C_  L )
suppssfv.f  |-  ( ph  ->  ( F `  Y
)  =  Z )
suppssfv.v  |-  ( (
ph  /\  x  e.  D )  ->  A  e.  V )
suppssfv.y  |-  ( ph  ->  Y  e.  U )
suppssfvg.d  |-  ( ph  ->  D  e.  W )
Assertion
Ref Expression
suppssfvg  |-  ( ph  ->  ( ( x  e.  D  |->  ( F `  A ) ) supp  Z
)  C_  L )
Distinct variable groups:    ph, x    x, D    x, Y    x, Z
Allowed substitution hints:    A( x)    U( x)    F( x)    L( x)    V( x)    W( x)

Proof of Theorem suppssfvg
Dummy variables  y  f  i  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 suppssfvg.d . . . . . . 7  |-  ( ph  ->  D  e.  W )
21adantr 276 . . . . . 6  |-  ( (
ph  /\  y  e.  ( ( x  e.  D  |->  ( F `  A ) ) supp  Z
) )  ->  D  e.  W )
32elexd 2817 . . . . 5  |-  ( (
ph  /\  y  e.  ( ( x  e.  D  |->  ( F `  A ) ) supp  Z
) )  ->  D  e.  _V )
4 df-supp 6414 . . . . . . 7  |- supp  =  ( f  e.  _V , 
z  e.  _V  |->  { i  e.  dom  f  |  ( f " { i } )  =/=  { z } } )
54elmpocl2 6229 . . . . . 6  |-  ( y  e.  ( ( x  e.  D  |->  ( F `
 A ) ) supp 
Z )  ->  Z  e.  _V )
65adantl 277 . . . . 5  |-  ( (
ph  /\  y  e.  ( ( x  e.  D  |->  ( F `  A ) ) supp  Z
) )  ->  Z  e.  _V )
7 simpl 109 . . . . 5  |-  ( (
ph  /\  y  e.  ( ( x  e.  D  |->  ( F `  A ) ) supp  Z
) )  ->  ph )
8 eldifsni 3806 . . . . . . . . 9  |-  ( ( F `  A )  e.  ( _V  \  { Z } )  -> 
( F `  A
)  =/=  Z )
9 suppssfv.v . . . . . . . . . . . . 13  |-  ( (
ph  /\  x  e.  D )  ->  A  e.  V )
109elexd 2817 . . . . . . . . . . . 12  |-  ( (
ph  /\  x  e.  D )  ->  A  e.  _V )
1110ad4ant23 515 . . . . . . . . . . 11  |-  ( ( ( ( ( D  e.  _V  /\  Z  e.  _V )  /\  ph )  /\  x  e.  D
)  /\  ( F `  A )  =/=  Z
)  ->  A  e.  _V )
12 suppssfv.f . . . . . . . . . . . . . . 15  |-  ( ph  ->  ( F `  Y
)  =  Z )
13 fveqeq2 5657 . . . . . . . . . . . . . . 15  |-  ( A  =  Y  ->  (
( F `  A
)  =  Z  <->  ( F `  Y )  =  Z ) )
1412, 13syl5ibrcom 157 . . . . . . . . . . . . . 14  |-  ( ph  ->  ( A  =  Y  ->  ( F `  A )  =  Z ) )
1514necon3d 2447 . . . . . . . . . . . . 13  |-  ( ph  ->  ( ( F `  A )  =/=  Z  ->  A  =/=  Y ) )
1615ad2antlr 489 . . . . . . . . . . . 12  |-  ( ( ( ( D  e. 
_V  /\  Z  e.  _V )  /\  ph )  /\  x  e.  D
)  ->  ( ( F `  A )  =/=  Z  ->  A  =/=  Y ) )
1716imp 124 . . . . . . . . . . 11  |-  ( ( ( ( ( D  e.  _V  /\  Z  e.  _V )  /\  ph )  /\  x  e.  D
)  /\  ( F `  A )  =/=  Z
)  ->  A  =/=  Y )
18 eldifsn 3804 . . . . . . . . . . 11  |-  ( A  e.  ( _V  \  { Y } )  <->  ( A  e.  _V  /\  A  =/= 
Y ) )
1911, 17, 18sylanbrc 417 . . . . . . . . . 10  |-  ( ( ( ( ( D  e.  _V  /\  Z  e.  _V )  /\  ph )  /\  x  e.  D
)  /\  ( F `  A )  =/=  Z
)  ->  A  e.  ( _V  \  { Y } ) )
2019ex 115 . . . . . . . . 9  |-  ( ( ( ( D  e. 
_V  /\  Z  e.  _V )  /\  ph )  /\  x  e.  D
)  ->  ( ( F `  A )  =/=  Z  ->  A  e.  ( _V  \  { Y } ) ) )
218, 20syl5 32 . . . . . . . 8  |-  ( ( ( ( D  e. 
_V  /\  Z  e.  _V )  /\  ph )  /\  x  e.  D
)  ->  ( ( F `  A )  e.  ( _V  \  { Z } )  ->  A  e.  ( _V  \  { Y } ) ) )
2221ss2rabdv 3309 . . . . . . 7  |-  ( ( ( D  e.  _V  /\  Z  e.  _V )  /\  ph )  ->  { x  e.  D  |  ( F `  A )  e.  ( _V  \  { Z } ) }  C_  { x  e.  D  |  A  e.  ( _V  \  { Y } ) } )
23 eqid 2231 . . . . . . . 8  |-  ( x  e.  D  |->  ( F `
 A ) )  =  ( x  e.  D  |->  ( F `  A ) )
24 simpll 527 . . . . . . . 8  |-  ( ( ( D  e.  _V  /\  Z  e.  _V )  /\  ph )  ->  D  e.  _V )
25 simplr 529 . . . . . . . 8  |-  ( ( ( D  e.  _V  /\  Z  e.  _V )  /\  ph )  ->  Z  e.  _V )
2623, 24, 25mptsuppdifd 6433 . . . . . . 7  |-  ( ( ( D  e.  _V  /\  Z  e.  _V )  /\  ph )  ->  (
( x  e.  D  |->  ( F `  A
) ) supp  Z )  =  { x  e.  D  |  ( F `
 A )  e.  ( _V  \  { Z } ) } )
27 eqid 2231 . . . . . . . 8  |-  ( x  e.  D  |->  A )  =  ( x  e.  D  |->  A )
28 suppssfv.y . . . . . . . . 9  |-  ( ph  ->  Y  e.  U )
2928adantl 277 . . . . . . . 8  |-  ( ( ( D  e.  _V  /\  Z  e.  _V )  /\  ph )  ->  Y  e.  U )
3027, 24, 29mptsuppdifd 6433 . . . . . . 7  |-  ( ( ( D  e.  _V  /\  Z  e.  _V )  /\  ph )  ->  (
( x  e.  D  |->  A ) supp  Y )  =  { x  e.  D  |  A  e.  ( _V  \  { Y } ) } )
3122, 26, 303sstr4d 3273 . . . . . 6  |-  ( ( ( D  e.  _V  /\  Z  e.  _V )  /\  ph )  ->  (
( x  e.  D  |->  ( F `  A
) ) supp  Z ) 
C_  ( ( x  e.  D  |->  A ) supp 
Y ) )
32 suppssfv.a . . . . . . 7  |-  ( ph  ->  ( ( x  e.  D  |->  A ) supp  Y
)  C_  L )
3332adantl 277 . . . . . 6  |-  ( ( ( D  e.  _V  /\  Z  e.  _V )  /\  ph )  ->  (
( x  e.  D  |->  A ) supp  Y ) 
C_  L )
3431, 33sstrd 3238 . . . . 5  |-  ( ( ( D  e.  _V  /\  Z  e.  _V )  /\  ph )  ->  (
( x  e.  D  |->  ( F `  A
) ) supp  Z ) 
C_  L )
353, 6, 7, 34syl21anc 1273 . . . 4  |-  ( (
ph  /\  y  e.  ( ( x  e.  D  |->  ( F `  A ) ) supp  Z
) )  ->  (
( x  e.  D  |->  ( F `  A
) ) supp  Z ) 
C_  L )
36 simpr 110 . . . 4  |-  ( (
ph  /\  y  e.  ( ( x  e.  D  |->  ( F `  A ) ) supp  Z
) )  ->  y  e.  ( ( x  e.  D  |->  ( F `  A ) ) supp  Z
) )
3735, 36sseldd 3229 . . 3  |-  ( (
ph  /\  y  e.  ( ( x  e.  D  |->  ( F `  A ) ) supp  Z
) )  ->  y  e.  L )
3837ex 115 . 2  |-  ( ph  ->  ( y  e.  ( ( x  e.  D  |->  ( F `  A
) ) supp  Z )  ->  y  e.  L
) )
3938ssrdv 3234 1  |-  ( ph  ->  ( ( x  e.  D  |->  ( F `  A ) ) supp  Z
)  C_  L )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2202    =/= wne 2403   {crab 2515   _Vcvv 2803    \ cdif 3198    C_ wss 3201   {csn 3673    |-> cmpt 4155   dom cdm 4731   "cima 4734   ` cfv 5333  (class class class)co 6028   supp csupp 6413
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  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-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  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-ov 6031  df-oprab 6032  df-mpo 6033  df-supp 6414
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator