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

Theorem bnj900 29237
Description: Technical lemma for bnj69 29316. 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
bnj900.3  |-  D  =  ( om  \  { (/)
} )
bnj900.4  |-  B  =  { f  |  E. n  e.  D  (
f  Fn  n  /\  ph 
/\  ps ) }
Assertion
Ref Expression
bnj900  |-  ( f  e.  B  ->  (/)  e.  dom  f )
Distinct variable group:    f, n
Allowed substitution hints:    ph( f, n)    ps( f, n)    B( f, n)    D( f, n)

Proof of Theorem bnj900
StepHypRef Expression
1 bnj900.4 . . . . . 6  |-  B  =  { f  |  E. n  e.  D  (
f  Fn  n  /\  ph 
/\  ps ) }
21bnj1436 29148 . . . . 5  |-  ( f  e.  B  ->  E. n  e.  D  ( f  Fn  n  /\  ph  /\  ps ) )
3 simp1 957 . . . . . 6  |-  ( ( f  Fn  n  /\  ph 
/\  ps )  ->  f  Fn  n )
43reximi 2805 . . . . 5  |-  ( E. n  e.  D  ( f  Fn  n  /\  ph 
/\  ps )  ->  E. n  e.  D  f  Fn  n )
5 fndm 5536 . . . . . 6  |-  ( f  Fn  n  ->  dom  f  =  n )
65reximi 2805 . . . . 5  |-  ( E. n  e.  D  f  Fn  n  ->  E. n  e.  D  dom  f  =  n )
72, 4, 63syl 19 . . . 4  |-  ( f  e.  B  ->  E. n  e.  D  dom  f  =  n )
87bnj1196 29103 . . 3  |-  ( f  e.  B  ->  E. n
( n  e.  D  /\  dom  f  =  n ) )
9 nfre1 2754 . . . . . . 7  |-  F/ n E. n  e.  D  ( f  Fn  n  /\  ph  /\  ps )
109nfab 2575 . . . . . 6  |-  F/_ n { f  |  E. n  e.  D  (
f  Fn  n  /\  ph 
/\  ps ) }
111, 10nfcxfr 2568 . . . . 5  |-  F/_ n B
1211nfcri 2565 . . . 4  |-  F/ n  f  e.  B
131219.37 1894 . . 3  |-  ( E. n ( f  e.  B  ->  ( n  e.  D  /\  dom  f  =  n ) )  <->  ( f  e.  B  ->  E. n
( n  e.  D  /\  dom  f  =  n ) ) )
148, 13mpbir 201 . 2  |-  E. n
( f  e.  B  ->  ( n  e.  D  /\  dom  f  =  n ) )
15 nfv 1629 . . . 4  |-  F/ n (/) 
e.  dom  f
1612, 15nfim 1832 . . 3  |-  F/ n
( f  e.  B  -> 
(/)  e.  dom  f )
17 bnj900.3 . . . . . 6  |-  D  =  ( om  \  { (/)
} )
1817bnj529 29046 . . . . 5  |-  ( n  e.  D  ->  (/)  e.  n
)
19 eleq2 2496 . . . . . 6  |-  ( dom  f  =  n  -> 
( (/)  e.  dom  f  <->  (/)  e.  n ) )
2019biimparc 474 . . . . 5  |-  ( (
(/)  e.  n  /\  dom  f  =  n
)  ->  (/)  e.  dom  f )
2118, 20sylan 458 . . . 4  |-  ( ( n  e.  D  /\  dom  f  =  n
)  ->  (/)  e.  dom  f )
2221imim2i 14 . . 3  |-  ( ( f  e.  B  -> 
( n  e.  D  /\  dom  f  =  n ) )  ->  (
f  e.  B  ->  (/) 
e.  dom  f )
)
2316, 22exlimi 1821 . 2  |-  ( E. n ( f  e.  B  ->  ( n  e.  D  /\  dom  f  =  n ) )  -> 
( f  e.  B  -> 
(/)  e.  dom  f ) )
2414, 23ax-mp 8 1  |-  ( f  e.  B  ->  (/)  e.  dom  f )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    /\ w3a 936   E.wex 1550    = wceq 1652    e. wcel 1725   {cab 2421   E.wrex 2698    \ cdif 3309   (/)c0 3620   {csn 3806   omcom 4837   dom cdm 4870    Fn wfn 5441
This theorem is referenced by:  bnj906  29238
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-sep 4322  ax-nul 4330  ax-pr 4395  ax-un 4693
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-rab 2706  df-v 2950  df-sbc 3154  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-br 4205  df-opab 4259  df-tr 4295  df-eprel 4486  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-fn 5449
  Copyright terms: Public domain W3C validator