MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  infpssrlem5 Unicode version

Theorem infpssrlem5 7949
Description: Lemma for infpssr 7950. (Contributed by Stefan O'Rear, 30-Oct-2014.)
Hypotheses
Ref Expression
infpssrlem.a  |-  ( ph  ->  B  C_  A )
infpssrlem.c  |-  ( ph  ->  F : B -1-1-onto-> A )
infpssrlem.d  |-  ( ph  ->  C  e.  ( A 
\  B ) )
infpssrlem.e  |-  G  =  ( rec ( `' F ,  C )  |`  om )
Assertion
Ref Expression
infpssrlem5  |-  ( ph  ->  ( A  e.  V  ->  om  ~<_  A ) )

Proof of Theorem infpssrlem5
Dummy variables  b 
c are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 infpssrlem.a . . . 4  |-  ( ph  ->  B  C_  A )
2 infpssrlem.c . . . 4  |-  ( ph  ->  F : B -1-1-onto-> A )
3 infpssrlem.d . . . 4  |-  ( ph  ->  C  e.  ( A 
\  B ) )
4 infpssrlem.e . . . 4  |-  G  =  ( rec ( `' F ,  C )  |`  om )
51, 2, 3, 4infpssrlem3 7947 . . 3  |-  ( ph  ->  G : om --> A )
6 simpll 730 . . . . . . . . . 10  |-  ( ( ( ph  /\  (
b  e.  om  /\  c  e.  om )
)  /\  b  e.  c )  ->  ph )
7 simplrr 737 . . . . . . . . . 10  |-  ( ( ( ph  /\  (
b  e.  om  /\  c  e.  om )
)  /\  b  e.  c )  ->  c  e.  om )
8 simpr 447 . . . . . . . . . 10  |-  ( ( ( ph  /\  (
b  e.  om  /\  c  e.  om )
)  /\  b  e.  c )  ->  b  e.  c )
91, 2, 3, 4infpssrlem4 7948 . . . . . . . . . 10  |-  ( (
ph  /\  c  e.  om 
/\  b  e.  c )  ->  ( G `  c )  =/=  ( G `  b )
)
106, 7, 8, 9syl3anc 1182 . . . . . . . . 9  |-  ( ( ( ph  /\  (
b  e.  om  /\  c  e.  om )
)  /\  b  e.  c )  ->  ( G `  c )  =/=  ( G `  b
) )
1110necomd 2542 . . . . . . . 8  |-  ( ( ( ph  /\  (
b  e.  om  /\  c  e.  om )
)  /\  b  e.  c )  ->  ( G `  b )  =/=  ( G `  c
) )
12 simpll 730 . . . . . . . . 9  |-  ( ( ( ph  /\  (
b  e.  om  /\  c  e.  om )
)  /\  c  e.  b )  ->  ph )
13 simplrl 736 . . . . . . . . 9  |-  ( ( ( ph  /\  (
b  e.  om  /\  c  e.  om )
)  /\  c  e.  b )  ->  b  e.  om )
14 simpr 447 . . . . . . . . 9  |-  ( ( ( ph  /\  (
b  e.  om  /\  c  e.  om )
)  /\  c  e.  b )  ->  c  e.  b )
151, 2, 3, 4infpssrlem4 7948 . . . . . . . . 9  |-  ( (
ph  /\  b  e.  om 
/\  c  e.  b )  ->  ( G `  b )  =/=  ( G `  c )
)
1612, 13, 14, 15syl3anc 1182 . . . . . . . 8  |-  ( ( ( ph  /\  (
b  e.  om  /\  c  e.  om )
)  /\  c  e.  b )  ->  ( G `  b )  =/=  ( G `  c
) )
1711, 16jaodan 760 . . . . . . 7  |-  ( ( ( ph  /\  (
b  e.  om  /\  c  e.  om )
)  /\  ( b  e.  c  \/  c  e.  b ) )  -> 
( G `  b
)  =/=  ( G `
 c ) )
1817ex 423 . . . . . 6  |-  ( (
ph  /\  ( b  e.  om  /\  c  e. 
om ) )  -> 
( ( b  e.  c  \/  c  e.  b )  ->  ( G `  b )  =/=  ( G `  c
) ) )
1918necon2bd 2508 . . . . 5  |-  ( (
ph  /\  ( b  e.  om  /\  c  e. 
om ) )  -> 
( ( G `  b )  =  ( G `  c )  ->  -.  ( b  e.  c  \/  c  e.  b ) ) )
20 nnord 4680 . . . . . . 7  |-  ( b  e.  om  ->  Ord  b )
21 nnord 4680 . . . . . . 7  |-  ( c  e.  om  ->  Ord  c )
22 ordtri3 4444 . . . . . . 7  |-  ( ( Ord  b  /\  Ord  c )  ->  (
b  =  c  <->  -.  (
b  e.  c  \/  c  e.  b ) ) )
2320, 21, 22syl2an 463 . . . . . 6  |-  ( ( b  e.  om  /\  c  e.  om )  ->  ( b  =  c  <->  -.  ( b  e.  c  \/  c  e.  b ) ) )
2423adantl 452 . . . . 5  |-  ( (
ph  /\  ( b  e.  om  /\  c  e. 
om ) )  -> 
( b  =  c  <->  -.  ( b  e.  c  \/  c  e.  b ) ) )
2519, 24sylibrd 225 . . . 4  |-  ( (
ph  /\  ( b  e.  om  /\  c  e. 
om ) )  -> 
( ( G `  b )  =  ( G `  c )  ->  b  =  c ) )
2625ralrimivva 2648 . . 3  |-  ( ph  ->  A. b  e.  om  A. c  e.  om  (
( G `  b
)  =  ( G `
 c )  -> 
b  =  c ) )
27 dff13 5799 . . 3  |-  ( G : om -1-1-> A  <->  ( G : om --> A  /\  A. b  e.  om  A. c  e.  om  ( ( G `
 b )  =  ( G `  c
)  ->  b  =  c ) ) )
285, 26, 27sylanbrc 645 . 2  |-  ( ph  ->  G : om -1-1-> A
)
29 f1domg 6897 . 2  |-  ( A  e.  V  ->  ( G : om -1-1-> A  ->  om 
~<_  A ) )
3028, 29syl5com 26 1  |-  ( ph  ->  ( A  e.  V  ->  om  ~<_  A ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 176    \/ wo 357    /\ wa 358    = wceq 1632    e. wcel 1696    =/= wne 2459   A.wral 2556    \ cdif 3162    C_ wss 3165   class class class wbr 4039   Ord word 4407   omcom 4672   `'ccnv 4704    |` cres 4707   -->wf 5267   -1-1->wf1 5268   -1-1-onto->wf1o 5270   ` cfv 5271   reccrdg 6438    ~<_ cdom 6877
This theorem is referenced by:  infpssr  7950
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-rep 4147  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
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-reu 2563  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pss 3181  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-tp 3661  df-op 3662  df-uni 3844  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  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-lim 4413  df-suc 4414  df-om 4673  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-fo 5277  df-f1o 5278  df-fv 5279  df-recs 6404  df-rdg 6439  df-dom 6881
  Copyright terms: Public domain W3C validator