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

Theorem xpsfrnel 12769
Description: Elementhood in the target space of the function  F appearing in xpsval 12777. (Contributed by Mario Carneiro, 14-Aug-2015.)
Assertion
Ref Expression
xpsfrnel  |-  ( G  e.  X_ k  e.  2o  if ( k  =  (/) ,  A ,  B )  <-> 
( G  Fn  2o  /\  ( G `  (/) )  e.  A  /\  ( G `
 1o )  e.  B ) )
Distinct variable groups:    A, k    B, k    k, G

Proof of Theorem xpsfrnel
StepHypRef Expression
1 elixp2 6705 . 2  |-  ( G  e.  X_ k  e.  2o  if ( k  =  (/) ,  A ,  B )  <-> 
( G  e.  _V  /\  G  Fn  2o  /\  A. k  e.  2o  ( G `  k )  e.  if ( k  =  (/) ,  A ,  B
) ) )
2 3ancoma 985 . . 3  |-  ( ( G  e.  _V  /\  G  Fn  2o  /\  A. k  e.  2o  ( G `  k )  e.  if ( k  =  (/) ,  A ,  B
) )  <->  ( G  Fn  2o  /\  G  e. 
_V  /\  A. k  e.  2o  ( G `  k )  e.  if ( k  =  (/) ,  A ,  B ) ) )
3 2onn 6525 . . . . . . . . . 10  |-  2o  e.  om
4 nnfi 6875 . . . . . . . . . 10  |-  ( 2o  e.  om  ->  2o  e.  Fin )
53, 4ax-mp 5 . . . . . . . . 9  |-  2o  e.  Fin
6 fnfi 6939 . . . . . . . . 9  |-  ( ( G  Fn  2o  /\  2o  e.  Fin )  ->  G  e.  Fin )
75, 6mpan2 425 . . . . . . . 8  |-  ( G  Fn  2o  ->  G  e.  Fin )
87elexd 2752 . . . . . . 7  |-  ( G  Fn  2o  ->  G  e.  _V )
98biantrurd 305 . . . . . 6  |-  ( G  Fn  2o  ->  ( A. k  e.  2o  ( G `  k )  e.  if ( k  =  (/) ,  A ,  B )  <->  ( G  e.  _V  /\  A. k  e.  2o  ( G `  k )  e.  if ( k  =  (/) ,  A ,  B ) ) ) )
10 df2o3 6434 . . . . . . . 8  |-  2o  =  { (/) ,  1o }
1110raleqi 2677 . . . . . . 7  |-  ( A. k  e.  2o  ( G `  k )  e.  if ( k  =  (/) ,  A ,  B
)  <->  A. k  e.  { (/)
,  1o }  ( G `  k )  e.  if ( k  =  (/) ,  A ,  B
) )
12 0ex 4132 . . . . . . . 8  |-  (/)  e.  _V
13 1oex 6428 . . . . . . . 8  |-  1o  e.  _V
14 fveq2 5517 . . . . . . . . 9  |-  ( k  =  (/)  ->  ( G `
 k )  =  ( G `  (/) ) )
15 iftrue 3541 . . . . . . . . 9  |-  ( k  =  (/)  ->  if ( k  =  (/) ,  A ,  B )  =  A )
1614, 15eleq12d 2248 . . . . . . . 8  |-  ( k  =  (/)  ->  ( ( G `  k )  e.  if ( k  =  (/) ,  A ,  B )  <->  ( G `  (/) )  e.  A
) )
17 fveq2 5517 . . . . . . . . 9  |-  ( k  =  1o  ->  ( G `  k )  =  ( G `  1o ) )
18 1n0 6436 . . . . . . . . . . 11  |-  1o  =/=  (/)
19 neeq1 2360 . . . . . . . . . . 11  |-  ( k  =  1o  ->  (
k  =/=  (/)  <->  1o  =/=  (/) ) )
2018, 19mpbiri 168 . . . . . . . . . 10  |-  ( k  =  1o  ->  k  =/=  (/) )
21 ifnefalse 3547 . . . . . . . . . 10  |-  ( k  =/=  (/)  ->  if (
k  =  (/) ,  A ,  B )  =  B )
2220, 21syl 14 . . . . . . . . 9  |-  ( k  =  1o  ->  if ( k  =  (/) ,  A ,  B )  =  B )
2317, 22eleq12d 2248 . . . . . . . 8  |-  ( k  =  1o  ->  (
( G `  k
)  e.  if ( k  =  (/) ,  A ,  B )  <->  ( G `  1o )  e.  B
) )
2412, 13, 16, 23ralpr 3649 . . . . . . 7  |-  ( A. k  e.  { (/) ,  1o }  ( G `  k )  e.  if ( k  =  (/) ,  A ,  B )  <-> 
( ( G `  (/) )  e.  A  /\  ( G `  1o )  e.  B ) )
2511, 24bitri 184 . . . . . 6  |-  ( A. k  e.  2o  ( G `  k )  e.  if ( k  =  (/) ,  A ,  B
)  <->  ( ( G `
 (/) )  e.  A  /\  ( G `  1o )  e.  B )
)
269, 25bitr3di 195 . . . . 5  |-  ( G  Fn  2o  ->  (
( G  e.  _V  /\ 
A. k  e.  2o  ( G `  k )  e.  if ( k  =  (/) ,  A ,  B ) )  <->  ( ( G `  (/) )  e.  A  /\  ( G `
 1o )  e.  B ) ) )
2726pm5.32i 454 . . . 4  |-  ( ( G  Fn  2o  /\  ( G  e.  _V  /\ 
A. k  e.  2o  ( G `  k )  e.  if ( k  =  (/) ,  A ,  B ) ) )  <-> 
( G  Fn  2o  /\  ( ( G `  (/) )  e.  A  /\  ( G `  1o )  e.  B ) ) )
28 3anass 982 . . . 4  |-  ( ( G  Fn  2o  /\  G  e.  _V  /\  A. k  e.  2o  ( G `  k )  e.  if ( k  =  (/) ,  A ,  B
) )  <->  ( G  Fn  2o  /\  ( G  e.  _V  /\  A. k  e.  2o  ( G `  k )  e.  if ( k  =  (/) ,  A ,  B
) ) ) )
29 3anass 982 . . . 4  |-  ( ( G  Fn  2o  /\  ( G `  (/) )  e.  A  /\  ( G `
 1o )  e.  B )  <->  ( G  Fn  2o  /\  ( ( G `  (/) )  e.  A  /\  ( G `
 1o )  e.  B ) ) )
3027, 28, 293bitr4i 212 . . 3  |-  ( ( G  Fn  2o  /\  G  e.  _V  /\  A. k  e.  2o  ( G `  k )  e.  if ( k  =  (/) ,  A ,  B
) )  <->  ( G  Fn  2o  /\  ( G `
 (/) )  e.  A  /\  ( G `  1o )  e.  B )
)
312, 30bitri 184 . 2  |-  ( ( G  e.  _V  /\  G  Fn  2o  /\  A. k  e.  2o  ( G `  k )  e.  if ( k  =  (/) ,  A ,  B
) )  <->  ( G  Fn  2o  /\  ( G `
 (/) )  e.  A  /\  ( G `  1o )  e.  B )
)
321, 31bitri 184 1  |-  ( G  e.  X_ k  e.  2o  if ( k  =  (/) ,  A ,  B )  <-> 
( G  Fn  2o  /\  ( G `  (/) )  e.  A  /\  ( G `
 1o )  e.  B ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    /\ w3a 978    = wceq 1353    e. wcel 2148    =/= wne 2347   A.wral 2455   _Vcvv 2739   (/)c0 3424   ifcif 3536   {cpr 3595   omcom 4591    Fn wfn 5213   ` cfv 5218   1oc1o 6413   2oc2o 6414   X_cixp 6701   Fincfn 6743
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-iinf 4589
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-if 3537  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-tr 4104  df-id 4295  df-iord 4368  df-on 4370  df-suc 4373  df-iom 4592  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-1o 6420  df-2o 6421  df-er 6538  df-ixp 6702  df-en 6744  df-fin 6746
This theorem is referenced by:  xpsfrnel2  12771  xpsff1o  12774
  Copyright terms: Public domain W3C validator