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

Theorem fnniniseg2 5688
Description: Support sets of functions expressed as abstractions. (Contributed by Stefan O'Rear, 1-Feb-2015.)
Assertion
Ref Expression
fnniniseg2  |-  ( F  Fn  A  ->  ( `' F " ( _V 
\  { B }
) )  =  {
x  e.  A  | 
( F `  x
)  =/=  B }
)
Distinct variable groups:    x, A    x, F    x, B

Proof of Theorem fnniniseg2
StepHypRef Expression
1 fncnvima2 5686 . 2  |-  ( F  Fn  A  ->  ( `' F " ( _V 
\  { B }
) )  =  {
x  e.  A  | 
( F `  x
)  e.  ( _V 
\  { B }
) } )
2 eldifsn 3750 . . . 4  |-  ( ( F `  x )  e.  ( _V  \  { B } )  <->  ( ( F `  x )  e.  _V  /\  ( F `
 x )  =/= 
B ) )
3 funfvex 5578 . . . . . 6  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( F `  x
)  e.  _V )
43funfni 5361 . . . . 5  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( F `  x
)  e.  _V )
54biantrurd 305 . . . 4  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( ( F `  x )  =/=  B  <->  ( ( F `  x
)  e.  _V  /\  ( F `  x )  =/=  B ) ) )
62, 5bitr4id 199 . . 3  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( ( F `  x )  e.  ( _V  \  { B } )  <->  ( F `  x )  =/=  B
) )
76rabbidva 2751 . 2  |-  ( F  Fn  A  ->  { x  e.  A  |  ( F `  x )  e.  ( _V  \  { B } ) }  =  { x  e.  A  |  ( F `  x )  =/=  B } )
81, 7eqtrd 2229 1  |-  ( F  Fn  A  ->  ( `' F " ( _V 
\  { B }
) )  =  {
x  e.  A  | 
( F `  x
)  =/=  B }
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1364    e. wcel 2167    =/= wne 2367   {crab 2479   _Vcvv 2763    \ cdif 3154   {csn 3623   `'ccnv 4663   "cima 4667    Fn wfn 5254   ` cfv 5259
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-fv 5267
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator