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

Theorem suppssov1 6293
Description: Formula building theorem for support restrictions: operator with left annihilator. (Contributed by Stefan O'Rear, 9-Mar-2015.)
Hypotheses
Ref Expression
suppssov1.s  |-  ( ph  ->  ( `' ( x  e.  D  |->  A )
" ( _V  \  { Y } ) ) 
C_  L )
suppssov1.o  |-  ( (
ph  /\  v  e.  R )  ->  ( Y O v )  =  Z )
suppssov1.a  |-  ( (
ph  /\  x  e.  D )  ->  A  e.  V )
suppssov1.b  |-  ( (
ph  /\  x  e.  D )  ->  B  e.  R )
Assertion
Ref Expression
suppssov1  |-  ( ph  ->  ( `' ( x  e.  D  |->  ( A O B ) )
" ( _V  \  { Z } ) ) 
C_  L )
Distinct variable groups:    ph, v    ph, x    v, B    v, O    v, R    v, Y    x, Y    v, Z    x, Z
Allowed substitution hints:    A( x, v)    B( x)    D( x, v)    R( x)    L( x, v)    O( x)    V( x, v)

Proof of Theorem suppssov1
StepHypRef Expression
1 suppssov1.a . . . . . . . 8  |-  ( (
ph  /\  x  e.  D )  ->  A  e.  V )
2 elex 2833 . . . . . . . 8  |-  ( A  e.  V  ->  A  e.  _V )
31, 2syl 14 . . . . . . 7  |-  ( (
ph  /\  x  e.  D )  ->  A  e.  _V )
43adantr 276 . . . . . 6  |-  ( ( ( ph  /\  x  e.  D )  /\  ( A O B )  e.  ( _V  \  { Z } ) )  ->  A  e.  _V )
5 eldifsni 3841 . . . . . . . 8  |-  ( ( A O B )  e.  ( _V  \  { Z } )  -> 
( A O B )  =/=  Z )
6 oveq2 6087 . . . . . . . . . . . 12  |-  ( v  =  B  ->  ( Y O v )  =  ( Y O B ) )
76eqeq1d 2247 . . . . . . . . . . 11  |-  ( v  =  B  ->  (
( Y O v )  =  Z  <->  ( Y O B )  =  Z ) )
8 suppssov1.o . . . . . . . . . . . . 13  |-  ( (
ph  /\  v  e.  R )  ->  ( Y O v )  =  Z )
98ralrimiva 2623 . . . . . . . . . . . 12  |-  ( ph  ->  A. v  e.  R  ( Y O v )  =  Z )
109adantr 276 . . . . . . . . . . 11  |-  ( (
ph  /\  x  e.  D )  ->  A. v  e.  R  ( Y O v )  =  Z )
11 suppssov1.b . . . . . . . . . . 11  |-  ( (
ph  /\  x  e.  D )  ->  B  e.  R )
127, 10, 11rspcdva 2934 . . . . . . . . . 10  |-  ( (
ph  /\  x  e.  D )  ->  ( Y O B )  =  Z )
13 oveq1 6086 . . . . . . . . . . 11  |-  ( A  =  Y  ->  ( A O B )  =  ( Y O B ) )
1413eqeq1d 2247 . . . . . . . . . 10  |-  ( A  =  Y  ->  (
( A O B )  =  Z  <->  ( Y O B )  =  Z ) )
1512, 14syl5ibrcom 157 . . . . . . . . 9  |-  ( (
ph  /\  x  e.  D )  ->  ( A  =  Y  ->  ( A O B )  =  Z ) )
1615necon3d 2464 . . . . . . . 8  |-  ( (
ph  /\  x  e.  D )  ->  (
( A O B )  =/=  Z  ->  A  =/=  Y ) )
175, 16syl5 32 . . . . . . 7  |-  ( (
ph  /\  x  e.  D )  ->  (
( A O B )  e.  ( _V 
\  { Z }
)  ->  A  =/=  Y ) )
1817imp 124 . . . . . 6  |-  ( ( ( ph  /\  x  e.  D )  /\  ( A O B )  e.  ( _V  \  { Z } ) )  ->  A  =/=  Y )
19 eldifsn 3839 . . . . . 6  |-  ( A  e.  ( _V  \  { Y } )  <->  ( A  e.  _V  /\  A  =/= 
Y ) )
204, 18, 19sylanbrc 421 . . . . 5  |-  ( ( ( ph  /\  x  e.  D )  /\  ( A O B )  e.  ( _V  \  { Z } ) )  ->  A  e.  ( _V  \  { Y } ) )
2120ex 115 . . . 4  |-  ( (
ph  /\  x  e.  D )  ->  (
( A O B )  e.  ( _V 
\  { Z }
)  ->  A  e.  ( _V  \  { Y } ) ) )
2221ss2rabdv 3329 . . 3  |-  ( ph  ->  { x  e.  D  |  ( A O B )  e.  ( _V  \  { Z } ) }  C_  { x  e.  D  |  A  e.  ( _V  \  { Y } ) } )
23 eqid 2238 . . . 4  |-  ( x  e.  D  |->  ( A O B ) )  =  ( x  e.  D  |->  ( A O B ) )
2423mptpreima 5279 . . 3  |-  ( `' ( x  e.  D  |->  ( A O B ) ) " ( _V  \  { Z }
) )  =  {
x  e.  D  | 
( A O B )  e.  ( _V 
\  { Z }
) }
25 eqid 2238 . . . 4  |-  ( x  e.  D  |->  A )  =  ( x  e.  D  |->  A )
2625mptpreima 5279 . . 3  |-  ( `' ( x  e.  D  |->  A ) " ( _V  \  { Y }
) )  =  {
x  e.  D  |  A  e.  ( _V  \  { Y } ) }
2722, 24, 263sstr4g 3291 . 2  |-  ( ph  ->  ( `' ( x  e.  D  |->  ( A O B ) )
" ( _V  \  { Z } ) ) 
C_  ( `' ( x  e.  D  |->  A ) " ( _V 
\  { Y }
) ) )
28 suppssov1.s . 2  |-  ( ph  ->  ( `' ( x  e.  D  |->  A )
" ( _V  \  { Y } ) ) 
C_  L )
2927, 28sstrd 3258 1  |-  ( ph  ->  ( `' ( x  e.  D  |->  ( A O B ) )
" ( _V  \  { Z } ) ) 
C_  L )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209    =/= wne 2420   A.wral 2528   {crab 2532   _Vcvv 2821    \ cdif 3217    C_ wss 3220   {csn 3708    |-> cmpt 4190   `'ccnv 4771   "cima 4775  (class class class)co 6079
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-pow 4309  ax-pr 4344
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-br 4129  df-opab 4191  df-mpt 4192  df-xp 4778  df-rel 4779  df-cnv 4780  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fv 5383  df-ov 6082
This theorem is referenced by:  suppssof1  6314
  Copyright terms: Public domain W3C validator