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

Theorem xpsfrnel 13377
Description: Elementhood in the target space of the function  F appearing in xpsval 13385. (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 6849 . 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 1009 . . 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 6667 . . . . . . . . . 10  |-  2o  e.  om
4 nnfi 7034 . . . . . . . . . 10  |-  ( 2o  e.  om  ->  2o  e.  Fin )
53, 4ax-mp 5 . . . . . . . . 9  |-  2o  e.  Fin
6 fnfi 7103 . . . . . . . . 9  |-  ( ( G  Fn  2o  /\  2o  e.  Fin )  ->  G  e.  Fin )
75, 6mpan2 425 . . . . . . . 8  |-  ( G  Fn  2o  ->  G  e.  Fin )
87elexd 2813 . . . . . . 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 6576 . . . . . . . 8  |-  2o  =  { (/) ,  1o }
1110raleqi 2732 . . . . . . 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 4211 . . . . . . . 8  |-  (/)  e.  _V
13 1oex 6570 . . . . . . . 8  |-  1o  e.  _V
14 fveq2 5627 . . . . . . . . 9  |-  ( k  =  (/)  ->  ( G `
 k )  =  ( G `  (/) ) )
15 iftrue 3607 . . . . . . . . 9  |-  ( k  =  (/)  ->  if ( k  =  (/) ,  A ,  B )  =  A )
1614, 15eleq12d 2300 . . . . . . . 8  |-  ( k  =  (/)  ->  ( ( G `  k )  e.  if ( k  =  (/) ,  A ,  B )  <->  ( G `  (/) )  e.  A
) )
17 fveq2 5627 . . . . . . . . 9  |-  ( k  =  1o  ->  ( G `  k )  =  ( G `  1o ) )
18 1n0 6578 . . . . . . . . . . 11  |-  1o  =/=  (/)
19 neeq1 2413 . . . . . . . . . . 11  |-  ( k  =  1o  ->  (
k  =/=  (/)  <->  1o  =/=  (/) ) )
2018, 19mpbiri 168 . . . . . . . . . 10  |-  ( k  =  1o  ->  k  =/=  (/) )
21 ifnefalse 3613 . . . . . . . . . 10  |-  ( k  =/=  (/)  ->  if (
k  =  (/) ,  A ,  B )  =  B )
2220, 21syl 14 . . . . . . . . 9  |-  ( k  =  1o  ->  if ( k  =  (/) ,  A ,  B )  =  B )
2317, 22eleq12d 2300 . . . . . . . 8  |-  ( k  =  1o  ->  (
( G `  k
)  e.  if ( k  =  (/) ,  A ,  B )  <->  ( G `  1o )  e.  B
) )
2412, 13, 16, 23ralpr 3721 . . . . . . 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 1006 . . . 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 1006 . . . 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 1002    = wceq 1395    e. wcel 2200    =/= wne 2400   A.wral 2508   _Vcvv 2799   (/)c0 3491   ifcif 3602   {cpr 3667   omcom 4682    Fn wfn 5313   ` cfv 5318   1oc1o 6555   2oc2o 6556   X_cixp 6845   Fincfn 6887
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-iord 4457  df-on 4459  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-1o 6562  df-2o 6563  df-er 6680  df-ixp 6846  df-en 6888  df-fin 6890
This theorem is referenced by:  xpsfrnel2  13379  xpsff1o  13382
  Copyright terms: Public domain W3C validator