MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tz7.48-2 Unicode version

Theorem tz7.48-2 6470
Description: Proposition 7.48(2) of [TakeutiZaring] p. 51. (Contributed by NM, 9-Feb-1997.) (Revised by David Abernethy, 5-May-2013.)
Hypothesis
Ref Expression
tz7.48.1  |-  F  Fn  On
Assertion
Ref Expression
tz7.48-2  |-  ( A. x  e.  On  ( F `  x )  e.  ( A  \  ( F " x ) )  ->  Fun  `' F
)
Distinct variable group:    x, F
Allowed substitution hint:    A( x)

Proof of Theorem tz7.48-2
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 ssid 3210 . . 3  |-  On  C_  On
2 onelon 4433 . . . . . . . . 9  |-  ( ( x  e.  On  /\  y  e.  x )  ->  y  e.  On )
32ancoms 439 . . . . . . . 8  |-  ( ( y  e.  x  /\  x  e.  On )  ->  y  e.  On )
4 tz7.48.1 . . . . . . . . . . 11  |-  F  Fn  On
5 fndm 5359 . . . . . . . . . . 11  |-  ( F  Fn  On  ->  dom  F  =  On )
64, 5ax-mp 8 . . . . . . . . . 10  |-  dom  F  =  On
76eleq2i 2360 . . . . . . . . 9  |-  ( y  e.  dom  F  <->  y  e.  On )
8 fnfun 5357 . . . . . . . . . . . . 13  |-  ( F  Fn  On  ->  Fun  F )
94, 8ax-mp 8 . . . . . . . . . . . 12  |-  Fun  F
10 funfvima 5769 . . . . . . . . . . . 12  |-  ( ( Fun  F  /\  y  e.  dom  F )  -> 
( y  e.  x  ->  ( F `  y
)  e.  ( F
" x ) ) )
119, 10mpan 651 . . . . . . . . . . 11  |-  ( y  e.  dom  F  -> 
( y  e.  x  ->  ( F `  y
)  e.  ( F
" x ) ) )
1211impcom 419 . . . . . . . . . 10  |-  ( ( y  e.  x  /\  y  e.  dom  F )  ->  ( F `  y )  e.  ( F " x ) )
13 eleq1a 2365 . . . . . . . . . . 11  |-  ( ( F `  y )  e.  ( F "
x )  ->  (
( F `  x
)  =  ( F `
 y )  -> 
( F `  x
)  e.  ( F
" x ) ) )
14 eldifn 3312 . . . . . . . . . . 11  |-  ( ( F `  x )  e.  ( A  \ 
( F " x
) )  ->  -.  ( F `  x )  e.  ( F "
x ) )
1513, 14nsyli 133 . . . . . . . . . 10  |-  ( ( F `  y )  e.  ( F "
x )  ->  (
( F `  x
)  e.  ( A 
\  ( F "
x ) )  ->  -.  ( F `  x
)  =  ( F `
 y ) ) )
1612, 15syl 15 . . . . . . . . 9  |-  ( ( y  e.  x  /\  y  e.  dom  F )  ->  ( ( F `
 x )  e.  ( A  \  ( F " x ) )  ->  -.  ( F `  x )  =  ( F `  y ) ) )
177, 16sylan2br 462 . . . . . . . 8  |-  ( ( y  e.  x  /\  y  e.  On )  ->  ( ( F `  x )  e.  ( A  \  ( F
" x ) )  ->  -.  ( F `  x )  =  ( F `  y ) ) )
183, 17syldan 456 . . . . . . 7  |-  ( ( y  e.  x  /\  x  e.  On )  ->  ( ( F `  x )  e.  ( A  \  ( F
" x ) )  ->  -.  ( F `  x )  =  ( F `  y ) ) )
1918expimpd 586 . . . . . 6  |-  ( y  e.  x  ->  (
( x  e.  On  /\  ( F `  x
)  e.  ( A 
\  ( F "
x ) ) )  ->  -.  ( F `  x )  =  ( F `  y ) ) )
2019com12 27 . . . . 5  |-  ( ( x  e.  On  /\  ( F `  x )  e.  ( A  \ 
( F " x
) ) )  -> 
( y  e.  x  ->  -.  ( F `  x )  =  ( F `  y ) ) )
2120ralrimiv 2638 . . . 4  |-  ( ( x  e.  On  /\  ( F `  x )  e.  ( A  \ 
( F " x
) ) )  ->  A. y  e.  x  -.  ( F `  x
)  =  ( F `
 y ) )
2221ralimiaa 2630 . . 3  |-  ( A. x  e.  On  ( F `  x )  e.  ( A  \  ( F " x ) )  ->  A. x  e.  On  A. y  e.  x  -.  ( F `  x )  =  ( F `  y ) )
234tz7.48lem 6469 . . 3  |-  ( ( On  C_  On  /\  A. x  e.  On  A. y  e.  x  -.  ( F `  x )  =  ( F `  y ) )  ->  Fun  `' ( F  |`  On ) )
241, 22, 23sylancr 644 . 2  |-  ( A. x  e.  On  ( F `  x )  e.  ( A  \  ( F " x ) )  ->  Fun  `' ( F  |`  On ) )
25 fnrel 5358 . . . . . 6  |-  ( F  Fn  On  ->  Rel  F )
264, 25ax-mp 8 . . . . 5  |-  Rel  F
276eqimssi 3245 . . . . 5  |-  dom  F  C_  On
28 relssres 5008 . . . . 5  |-  ( ( Rel  F  /\  dom  F 
C_  On )  -> 
( F  |`  On )  =  F )
2926, 27, 28mp2an 653 . . . 4  |-  ( F  |`  On )  =  F
3029cnveqi 4872 . . 3  |-  `' ( F  |`  On )  =  `' F
3130funeqi 5291 . 2  |-  ( Fun  `' ( F  |`  On )  <->  Fun  `' F )
3224, 31sylib 188 1  |-  ( A. x  e.  On  ( F `  x )  e.  ( A  \  ( F " x ) )  ->  Fun  `' F
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 358    = wceq 1632    e. wcel 1696   A.wral 2556    \ cdif 3162    C_ wss 3165   Oncon0 4408   `'ccnv 4704   dom cdm 4705    |` cres 4707   "cima 4708   Rel wrel 4710   Fun wfun 5265    Fn wfn 5266   ` cfv 5271
This theorem is referenced by:  tz7.48-3  6472
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pr 4230
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pss 3181  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-tr 4130  df-eprel 4321  df-id 4325  df-po 4330  df-so 4331  df-fr 4368  df-we 4370  df-ord 4411  df-on 4412  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fv 5279
  Copyright terms: Public domain W3C validator