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

Theorem tz7.48-2 6628
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 3303 . . 3  |-  On  C_  On
2 onelon 4540 . . . . . . . . 9  |-  ( ( x  e.  On  /\  y  e.  x )  ->  y  e.  On )
32ancoms 440 . . . . . . . 8  |-  ( ( y  e.  x  /\  x  e.  On )  ->  y  e.  On )
4 tz7.48.1 . . . . . . . . . . 11  |-  F  Fn  On
5 fndm 5477 . . . . . . . . . . 11  |-  ( F  Fn  On  ->  dom  F  =  On )
64, 5ax-mp 8 . . . . . . . . . 10  |-  dom  F  =  On
76eleq2i 2444 . . . . . . . . 9  |-  ( y  e.  dom  F  <->  y  e.  On )
8 fnfun 5475 . . . . . . . . . . . . 13  |-  ( F  Fn  On  ->  Fun  F )
94, 8ax-mp 8 . . . . . . . . . . . 12  |-  Fun  F
10 funfvima 5905 . . . . . . . . . . . 12  |-  ( ( Fun  F  /\  y  e.  dom  F )  -> 
( y  e.  x  ->  ( F `  y
)  e.  ( F
" x ) ) )
119, 10mpan 652 . . . . . . . . . . 11  |-  ( y  e.  dom  F  -> 
( y  e.  x  ->  ( F `  y
)  e.  ( F
" x ) ) )
1211impcom 420 . . . . . . . . . 10  |-  ( ( y  e.  x  /\  y  e.  dom  F )  ->  ( F `  y )  e.  ( F " x ) )
13 eleq1a 2449 . . . . . . . . . . 11  |-  ( ( F `  y )  e.  ( F "
x )  ->  (
( F `  x
)  =  ( F `
 y )  -> 
( F `  x
)  e.  ( F
" x ) ) )
14 eldifn 3406 . . . . . . . . . . 11  |-  ( ( F `  x )  e.  ( A  \ 
( F " x
) )  ->  -.  ( F `  x )  e.  ( F "
x ) )
1513, 14nsyli 135 . . . . . . . . . 10  |-  ( ( F `  y )  e.  ( F "
x )  ->  (
( F `  x
)  e.  ( A 
\  ( F "
x ) )  ->  -.  ( F `  x
)  =  ( F `
 y ) ) )
1612, 15syl 16 . . . . . . . . 9  |-  ( ( y  e.  x  /\  y  e.  dom  F )  ->  ( ( F `
 x )  e.  ( A  \  ( F " x ) )  ->  -.  ( F `  x )  =  ( F `  y ) ) )
177, 16sylan2br 463 . . . . . . . 8  |-  ( ( y  e.  x  /\  y  e.  On )  ->  ( ( F `  x )  e.  ( A  \  ( F
" x ) )  ->  -.  ( F `  x )  =  ( F `  y ) ) )
183, 17syldan 457 . . . . . . 7  |-  ( ( y  e.  x  /\  x  e.  On )  ->  ( ( F `  x )  e.  ( A  \  ( F
" x ) )  ->  -.  ( F `  x )  =  ( F `  y ) ) )
1918expimpd 587 . . . . . 6  |-  ( y  e.  x  ->  (
( x  e.  On  /\  ( F `  x
)  e.  ( A 
\  ( F "
x ) ) )  ->  -.  ( F `  x )  =  ( F `  y ) ) )
2019com12 29 . . . . 5  |-  ( ( x  e.  On  /\  ( F `  x )  e.  ( A  \ 
( F " x
) ) )  -> 
( y  e.  x  ->  -.  ( F `  x )  =  ( F `  y ) ) )
2120ralrimiv 2724 . . . 4  |-  ( ( x  e.  On  /\  ( F `  x )  e.  ( A  \ 
( F " x
) ) )  ->  A. y  e.  x  -.  ( F `  x
)  =  ( F `
 y ) )
2221ralimiaa 2716 . . 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 6627 . . 3  |-  ( ( On  C_  On  /\  A. x  e.  On  A. y  e.  x  -.  ( F `  x )  =  ( F `  y ) )  ->  Fun  `' ( F  |`  On ) )
241, 22, 23sylancr 645 . 2  |-  ( A. x  e.  On  ( F `  x )  e.  ( A  \  ( F " x ) )  ->  Fun  `' ( F  |`  On ) )
25 fnrel 5476 . . . . . 6  |-  ( F  Fn  On  ->  Rel  F )
264, 25ax-mp 8 . . . . 5  |-  Rel  F
276eqimssi 3338 . . . . 5  |-  dom  F  C_  On
28 relssres 5116 . . . . 5  |-  ( ( Rel  F  /\  dom  F 
C_  On )  -> 
( F  |`  On )  =  F )
2926, 27, 28mp2an 654 . . . 4  |-  ( F  |`  On )  =  F
3029cnveqi 4980 . . 3  |-  `' ( F  |`  On )  =  `' F
3130funeqi 5407 . 2  |-  ( Fun  `' ( F  |`  On )  <->  Fun  `' F )
3224, 31sylib 189 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 359    = wceq 1649    e. wcel 1717   A.wral 2642    \ cdif 3253    C_ wss 3256   Oncon0 4515   `'ccnv 4810   dom cdm 4811    |` cres 4813   "cima 4814   Rel wrel 4816   Fun wfun 5381    Fn wfn 5382   ` cfv 5387
This theorem is referenced by:  tz7.48-3  6630
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-13 1719  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2361  ax-sep 4264  ax-nul 4272  ax-pr 4337
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2235  df-mo 2236  df-clab 2367  df-cleq 2373  df-clel 2376  df-nfc 2505  df-ne 2545  df-ral 2647  df-rex 2648  df-rab 2651  df-v 2894  df-sbc 3098  df-dif 3259  df-un 3261  df-in 3263  df-ss 3270  df-pss 3272  df-nul 3565  df-if 3676  df-sn 3756  df-pr 3757  df-op 3759  df-uni 3951  df-br 4147  df-opab 4201  df-tr 4237  df-eprel 4428  df-id 4432  df-po 4437  df-so 4438  df-fr 4475  df-we 4477  df-ord 4518  df-on 4519  df-xp 4817  df-rel 4818  df-cnv 4819  df-co 4820  df-dm 4821  df-rn 4822  df-res 4823  df-ima 4824  df-iota 5351  df-fun 5389  df-fn 5390  df-f 5391  df-f1 5392  df-fv 5395
  Copyright terms: Public domain W3C validator