Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1498 Structured version   Unicode version

Theorem bnj1498 29331
Description: Technical lemma for bnj60 29332. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj1498.1  |-  B  =  { d  |  ( d  C_  A  /\  A. x  e.  d  pred ( x ,  A ,  R )  C_  d
) }
bnj1498.2  |-  Y  = 
<. x ,  ( f  |`  pred ( x ,  A ,  R ) ) >.
bnj1498.3  |-  C  =  { f  |  E. d  e.  B  (
f  Fn  d  /\  A. x  e.  d  ( f `  x )  =  ( G `  Y ) ) }
bnj1498.4  |-  F  = 
U. C
Assertion
Ref Expression
bnj1498  |-  ( R 
FrSe  A  ->  dom  F  =  A )
Distinct variable groups:    A, d,
f, x    B, f    G, d, f, x    R, d, f, x
Allowed substitution hints:    B( x, d)    C( x, f, d)    F( x, f, d)    Y( x, f, d)

Proof of Theorem bnj1498
Dummy variables  t 
z  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eliun 4089 . . . . . . 7  |-  ( z  e.  U_ f  e.  C  dom  f  <->  E. f  e.  C  z  e.  dom  f )
2 bnj1498.3 . . . . . . . . . . . . . . . 16  |-  C  =  { f  |  E. d  e.  B  (
f  Fn  d  /\  A. x  e.  d  ( f `  x )  =  ( G `  Y ) ) }
32bnj1436 29112 . . . . . . . . . . . . . . 15  |-  ( f  e.  C  ->  E. d  e.  B  ( f  Fn  d  /\  A. x  e.  d  ( f `  x )  =  ( G `  Y ) ) )
43bnj1299 29091 . . . . . . . . . . . . . 14  |-  ( f  e.  C  ->  E. d  e.  B  f  Fn  d )
5 fndm 5536 . . . . . . . . . . . . . 14  |-  ( f  Fn  d  ->  dom  f  =  d )
64, 5bnj31 28985 . . . . . . . . . . . . 13  |-  ( f  e.  C  ->  E. d  e.  B  dom  f  =  d )
76bnj1196 29067 . . . . . . . . . . . 12  |-  ( f  e.  C  ->  E. d
( d  e.  B  /\  dom  f  =  d ) )
8 bnj1498.1 . . . . . . . . . . . . . . 15  |-  B  =  { d  |  ( d  C_  A  /\  A. x  e.  d  pred ( x ,  A ,  R )  C_  d
) }
98bnj1436 29112 . . . . . . . . . . . . . 14  |-  ( d  e.  B  ->  (
d  C_  A  /\  A. x  e.  d  pred ( x ,  A ,  R )  C_  d
) )
109simpld 446 . . . . . . . . . . . . 13  |-  ( d  e.  B  ->  d  C_  A )
1110anim1i 552 . . . . . . . . . . . 12  |-  ( ( d  e.  B  /\  dom  f  =  d
)  ->  ( d  C_  A  /\  dom  f  =  d ) )
127, 11bnj593 29014 . . . . . . . . . . 11  |-  ( f  e.  C  ->  E. d
( d  C_  A  /\  dom  f  =  d ) )
13 sseq1 3361 . . . . . . . . . . . 12  |-  ( dom  f  =  d  -> 
( dom  f  C_  A 
<->  d  C_  A )
)
1413biimparc 474 . . . . . . . . . . 11  |-  ( ( d  C_  A  /\  dom  f  =  d
)  ->  dom  f  C_  A )
1512, 14bnj593 29014 . . . . . . . . . 10  |-  ( f  e.  C  ->  E. d dom  f  C_  A )
1615bnj937 29043 . . . . . . . . 9  |-  ( f  e.  C  ->  dom  f  C_  A )
1716sselda 3340 . . . . . . . 8  |-  ( ( f  e.  C  /\  z  e.  dom  f )  ->  z  e.  A
)
1817rexlimiva 2817 . . . . . . 7  |-  ( E. f  e.  C  z  e.  dom  f  -> 
z  e.  A )
191, 18sylbi 188 . . . . . 6  |-  ( z  e.  U_ f  e.  C  dom  f  -> 
z  e.  A )
202bnj1317 29094 . . . . . . 7  |-  ( w  e.  C  ->  A. f  w  e.  C )
2120bnj1400 29108 . . . . . 6  |-  dom  U. C  =  U_ f  e.  C  dom  f
2219, 21eleq2s 2527 . . . . 5  |-  ( z  e.  dom  U. C  ->  z  e.  A )
23 bnj1498.4 . . . . . 6  |-  F  = 
U. C
2423dmeqi 5063 . . . . 5  |-  dom  F  =  dom  U. C
2522, 24eleq2s 2527 . . . 4  |-  ( z  e.  dom  F  -> 
z  e.  A )
2625ssriv 3344 . . 3  |-  dom  F  C_  A
2726a1i 11 . 2  |-  ( R 
FrSe  A  ->  dom  F  C_  A )
28 bnj1498.2 . . . . . . . 8  |-  Y  = 
<. x ,  ( f  |`  pred ( x ,  A ,  R ) ) >.
298, 28, 2bnj1493 29329 . . . . . . 7  |-  ( R 
FrSe  A  ->  A. x  e.  A  E. f  e.  C  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) )
30 vex 2951 . . . . . . . . . . . 12  |-  x  e. 
_V
3130snid 3833 . . . . . . . . . . 11  |-  x  e. 
{ x }
32 elun1 3506 . . . . . . . . . . 11  |-  ( x  e.  { x }  ->  x  e.  ( { x }  u.  trCl ( x ,  A ,  R ) ) )
3331, 32ax-mp 8 . . . . . . . . . 10  |-  x  e.  ( { x }  u.  trCl ( x ,  A ,  R ) )
34 eleq2 2496 . . . . . . . . . 10  |-  ( dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) )  -> 
( x  e.  dom  f 
<->  x  e.  ( { x }  u.  trCl ( x ,  A ,  R ) ) ) )
3533, 34mpbiri 225 . . . . . . . . 9  |-  ( dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) )  ->  x  e.  dom  f )
3635reximi 2805 . . . . . . . 8  |-  ( E. f  e.  C  dom  f  =  ( {
x }  u.  trCl ( x ,  A ,  R ) )  ->  E. f  e.  C  x  e.  dom  f )
3736ralimi 2773 . . . . . . 7  |-  ( A. x  e.  A  E. f  e.  C  dom  f  =  ( {
x }  u.  trCl ( x ,  A ,  R ) )  ->  A. x  e.  A  E. f  e.  C  x  e.  dom  f )
3829, 37syl 16 . . . . . 6  |-  ( R 
FrSe  A  ->  A. x  e.  A  E. f  e.  C  x  e.  dom  f )
39 eliun 4089 . . . . . . 7  |-  ( x  e.  U_ f  e.  C  dom  f  <->  E. f  e.  C  x  e.  dom  f )
4039ralbii 2721 . . . . . 6  |-  ( A. x  e.  A  x  e.  U_ f  e.  C  dom  f  <->  A. x  e.  A  E. f  e.  C  x  e.  dom  f )
4138, 40sylibr 204 . . . . 5  |-  ( R 
FrSe  A  ->  A. x  e.  A  x  e.  U_ f  e.  C  dom  f )
42 nfcv 2571 . . . . . 6  |-  F/_ x A
438bnj1309 29292 . . . . . . . . 9  |-  ( t  e.  B  ->  A. x  t  e.  B )
442, 43bnj1307 29293 . . . . . . . 8  |-  ( t  e.  C  ->  A. x  t  e.  C )
4544nfcii 2562 . . . . . . 7  |-  F/_ x C
46 nfcv 2571 . . . . . . 7  |-  F/_ x dom  f
4745, 46nfiun 4111 . . . . . 6  |-  F/_ x U_ f  e.  C  dom  f
4842, 47dfss3f 3332 . . . . 5  |-  ( A 
C_  U_ f  e.  C  dom  f  <->  A. x  e.  A  x  e.  U_ f  e.  C  dom  f )
4941, 48sylibr 204 . . . 4  |-  ( R 
FrSe  A  ->  A  C_  U_ f  e.  C  dom  f )
5049, 21syl6sseqr 3387 . . 3  |-  ( R 
FrSe  A  ->  A  C_  dom  U. C )
5150, 24syl6sseqr 3387 . 2  |-  ( R 
FrSe  A  ->  A  C_  dom  F )
5227, 51eqssd 3357 1  |-  ( R 
FrSe  A  ->  dom  F  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    = wceq 1652    e. wcel 1725   {cab 2421   A.wral 2697   E.wrex 2698    u. cun 3310    C_ wss 3312   {csn 3806   <.cop 3809   U.cuni 4007   U_ciun 4085   dom cdm 4870    |` cres 4872    Fn wfn 5441   ` cfv 5446    predc-bnj14 28953    FrSe w-bnj15 28957    trClc-bnj18 28959
This theorem is referenced by:  bnj60  29332
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-13 1727  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-rep 4312  ax-sep 4322  ax-nul 4330  ax-pow 4369  ax-pr 4395  ax-un 4693  ax-reg 7550  ax-inf2 7586
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-reu 2704  df-rab 2706  df-v 2950  df-sbc 3154  df-csb 3244  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-pss 3328  df-nul 3621  df-if 3732  df-pw 3793  df-sn 3812  df-pr 3813  df-tp 3814  df-op 3815  df-uni 4008  df-iun 4087  df-br 4205  df-opab 4259  df-mpt 4260  df-tr 4295  df-eprel 4486  df-id 4490  df-po 4495  df-so 4496  df-fr 4533  df-we 4535  df-ord 4576  df-on 4577  df-lim 4578  df-suc 4579  df-om 4838  df-xp 4876  df-rel 4877  df-cnv 4878  df-co 4879  df-dm 4880  df-rn 4881  df-res 4882  df-ima 4883  df-iota 5410  df-fun 5448  df-fn 5449  df-f 5450  df-f1 5451  df-fo 5452  df-f1o 5453  df-fv 5454  df-1o 6716  df-bnj17 28952  df-bnj14 28954  df-bnj13 28956  df-bnj15 28958  df-bnj18 28960  df-bnj19 28962
  Copyright terms: Public domain W3C validator