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

Theorem suppssov1 6056
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 2741 . . . . . . . 8  |-  ( A  e.  V  ->  A  e.  _V )
31, 2syl 14 . . . . . . 7  |-  ( (
ph  /\  x  e.  D )  ->  A  e.  _V )
43adantr 274 . . . . . 6  |-  ( ( ( ph  /\  x  e.  D )  /\  ( A O B )  e.  ( _V  \  { Z } ) )  ->  A  e.  _V )
5 eldifsni 3710 . . . . . . . 8  |-  ( ( A O B )  e.  ( _V  \  { Z } )  -> 
( A O B )  =/=  Z )
6 oveq2 5859 . . . . . . . . . . . 12  |-  ( v  =  B  ->  ( Y O v )  =  ( Y O B ) )
76eqeq1d 2179 . . . . . . . . . . 11  |-  ( v  =  B  ->  (
( Y O v )  =  Z  <->  ( Y O B )  =  Z ) )
8 suppssov1.o . . . . . . . . . . . . 13  |-  ( (
ph  /\  v  e.  R )  ->  ( Y O v )  =  Z )
98ralrimiva 2543 . . . . . . . . . . . 12  |-  ( ph  ->  A. v  e.  R  ( Y O v )  =  Z )
109adantr 274 . . . . . . . . . . 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 2839 . . . . . . . . . 10  |-  ( (
ph  /\  x  e.  D )  ->  ( Y O B )  =  Z )
13 oveq1 5858 . . . . . . . . . . 11  |-  ( A  =  Y  ->  ( A O B )  =  ( Y O B ) )
1413eqeq1d 2179 . . . . . . . . . 10  |-  ( A  =  Y  ->  (
( A O B )  =  Z  <->  ( Y O B )  =  Z ) )
1512, 14syl5ibrcom 156 . . . . . . . . 9  |-  ( (
ph  /\  x  e.  D )  ->  ( A  =  Y  ->  ( A O B )  =  Z ) )
1615necon3d 2384 . . . . . . . 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 123 . . . . . 6  |-  ( ( ( ph  /\  x  e.  D )  /\  ( A O B )  e.  ( _V  \  { Z } ) )  ->  A  =/=  Y )
19 eldifsn 3708 . . . . . 6  |-  ( A  e.  ( _V  \  { Y } )  <->  ( A  e.  _V  /\  A  =/= 
Y ) )
204, 18, 19sylanbrc 415 . . . . 5  |-  ( ( ( ph  /\  x  e.  D )  /\  ( A O B )  e.  ( _V  \  { Z } ) )  ->  A  e.  ( _V  \  { Y } ) )
2120ex 114 . . . 4  |-  ( (
ph  /\  x  e.  D )  ->  (
( A O B )  e.  ( _V 
\  { Z }
)  ->  A  e.  ( _V  \  { Y } ) ) )
2221ss2rabdv 3228 . . 3  |-  ( ph  ->  { x  e.  D  |  ( A O B )  e.  ( _V  \  { Z } ) }  C_  { x  e.  D  |  A  e.  ( _V  \  { Y } ) } )
23 eqid 2170 . . . 4  |-  ( x  e.  D  |->  ( A O B ) )  =  ( x  e.  D  |->  ( A O B ) )
2423mptpreima 5102 . . 3  |-  ( `' ( x  e.  D  |->  ( A O B ) ) " ( _V  \  { Z }
) )  =  {
x  e.  D  | 
( A O B )  e.  ( _V 
\  { Z }
) }
25 eqid 2170 . . . 4  |-  ( x  e.  D  |->  A )  =  ( x  e.  D  |->  A )
2625mptpreima 5102 . . 3  |-  ( `' ( x  e.  D  |->  A ) " ( _V  \  { Y }
) )  =  {
x  e.  D  |  A  e.  ( _V  \  { Y } ) }
2722, 24, 263sstr4g 3190 . 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 3157 1  |-  ( ph  ->  ( `' ( x  e.  D  |->  ( A O B ) )
" ( _V  \  { Z } ) ) 
C_  L )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1348    e. wcel 2141    =/= wne 2340   A.wral 2448   {crab 2452   _Vcvv 2730    \ cdif 3118    C_ wss 3121   {csn 3581    |-> cmpt 4048   `'ccnv 4608   "cima 4612  (class class class)co 5851
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4105  ax-pow 4158  ax-pr 4192
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-rab 2457  df-v 2732  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-pw 3566  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3795  df-br 3988  df-opab 4049  df-mpt 4050  df-xp 4615  df-rel 4616  df-cnv 4617  df-dm 4619  df-rn 4620  df-res 4621  df-ima 4622  df-iota 5158  df-fv 5204  df-ov 5854
This theorem is referenced by:  suppssof1  6076
  Copyright terms: Public domain W3C validator