Users' Mathboxes Mathbox for Jim Kingdon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  nninfomnilem Unicode version

Theorem nninfomnilem 13214
Description: Lemma for nninfomni 13215. (Contributed by Jim Kingdon, 10-Aug-2022.)
Hypothesis
Ref Expression
nninfsel.e  |-  E  =  ( q  e.  ( 2o  ^m )  |->  ( n  e. 
om  |->  if ( A. k  e.  suc  n ( q `  ( i  e.  om  |->  if ( i  e.  k ,  1o ,  (/) ) ) )  =  1o ,  1o ,  (/) ) ) )
Assertion
Ref Expression
nninfomnilem  |-  e. Omni
Distinct variable groups:    i, E, k, n    i, q, k, n
Allowed substitution hint:    E( q)

Proof of Theorem nninfomnilem
Dummy variables  p  r are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nninfex 13205 . . 3  |-  e.  _V
2 isomnimap 7009 . . 3  |-  (  e.  _V  ->  ( 
e. Omni 
<-> 
A. r  e.  ( 2o  ^m ) ( E. p  e.  ( r `  p )  =  (/)  \/  A. p  e.  ( r `  p )  =  1o ) ) )
31, 2ax-mp 5 . 2  |-  (  e. Omni  <->  A. r  e.  ( 2o  ^m ) ( E. p  e.  ( r `  p )  =  (/)  \/  A. p  e.  ( r `  p )  =  1o ) )
4 elmapi 6564 . . . . . 6  |-  ( r  e.  ( 2o  ^m )  -> 
r : --> 2o )
5 nninfsel.e . . . . . . . 8  |-  E  =  ( q  e.  ( 2o  ^m )  |->  ( n  e. 
om  |->  if ( A. k  e.  suc  n ( q `  ( i  e.  om  |->  if ( i  e.  k ,  1o ,  (/) ) ) )  =  1o ,  1o ,  (/) ) ) )
65nninfself 13209 . . . . . . 7  |-  E :
( 2o  ^m ) -->
76ffvelrni 5554 . . . . . 6  |-  ( r  e.  ( 2o  ^m )  -> 
( E `  r
)  e. )
84, 7ffvelrnd 5556 . . . . 5  |-  ( r  e.  ( 2o  ^m )  -> 
( r `  ( E `  r )
)  e.  2o )
9 df2o3 6327 . . . . 5  |-  2o  =  { (/) ,  1o }
108, 9eleqtrdi 2232 . . . 4  |-  ( r  e.  ( 2o  ^m )  -> 
( r `  ( E `  r )
)  e.  { (/) ,  1o } )
11 elpri 3550 . . . 4  |-  ( ( r `  ( E `
 r ) )  e.  { (/) ,  1o }  ->  ( ( r `
 ( E `  r ) )  =  (/)  \/  ( r `  ( E `  r ) )  =  1o ) )
1210, 11syl 14 . . 3  |-  ( r  e.  ( 2o  ^m )  -> 
( ( r `  ( E `  r ) )  =  (/)  \/  (
r `  ( E `  r ) )  =  1o ) )
13 fveq2 5421 . . . . . . . 8  |-  ( p  =  ( E `  r )  ->  (
r `  p )  =  ( r `  ( E `  r ) ) )
1413eqeq1d 2148 . . . . . . 7  |-  ( p  =  ( E `  r )  ->  (
( r `  p
)  =  (/)  <->  ( r `  ( E `  r
) )  =  (/) ) )
1514rspcev 2789 . . . . . 6  |-  ( ( ( E `  r
)  e.  /\  ( r `  ( E `  r ) )  =  (/) )  ->  E. p  e.  ( r `  p
)  =  (/) )
1615ex 114 . . . . 5  |-  ( ( E `  r )  e.  ->  ( ( r `  ( E `  r ) )  =  (/)  ->  E. p  e.  ( r `  p )  =  (/) ) )
177, 16syl 14 . . . 4  |-  ( r  e.  ( 2o  ^m )  -> 
( ( r `  ( E `  r ) )  =  (/)  ->  E. p  e.  ( r `  p )  =  (/) ) )
18 simpl 108 . . . . . 6  |-  ( ( r  e.  ( 2o 
^m )  /\  ( r `  ( E `  r ) )  =  1o )  ->  r  e.  ( 2o  ^m ) )
19 simpr 109 . . . . . 6  |-  ( ( r  e.  ( 2o 
^m )  /\  ( r `  ( E `  r ) )  =  1o )  ->  ( r `  ( E `  r ) )  =  1o )
205, 18, 19nninfsel 13213 . . . . 5  |-  ( ( r  e.  ( 2o 
^m )  /\  ( r `  ( E `  r ) )  =  1o )  ->  A. p  e.  ( r `  p
)  =  1o )
2120ex 114 . . . 4  |-  ( r  e.  ( 2o  ^m )  -> 
( ( r `  ( E `  r ) )  =  1o  ->  A. p  e.  ( r `  p
)  =  1o ) )
2217, 21orim12d 775 . . 3  |-  ( r  e.  ( 2o  ^m )  -> 
( ( ( r `
 ( E `  r ) )  =  (/)  \/  ( r `  ( E `  r ) )  =  1o )  ->  ( E. p  e.  ( r `  p )  =  (/)  \/  A. p  e.  ( r `  p )  =  1o ) ) )
2312, 22mpd 13 . 2  |-  ( r  e.  ( 2o  ^m )  -> 
( E. p  e.  (
r `  p )  =  (/)  \/  A. p  e.  ( r `  p )  =  1o ) )
243, 23mprgbir 2490 1  |-  e. Omni
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    \/ wo 697    = wceq 1331    e. wcel 1480   A.wral 2416   E.wrex 2417   _Vcvv 2686   (/)c0 3363   ifcif 3474   {cpr 3528    |-> cmpt 3989   suc csuc 4287   omcom 4504   ` cfv 5123  (class class class)co 5774   1oc1o 6306   2oc2o 6307    ^m cmap 6542  Omnicomni 7004  ℕxnninf 7005
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-if 3475  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-iord 4288  df-on 4290  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1o 6313  df-2o 6314  df-map 6544  df-omni 7006  df-nninf 7007
This theorem is referenced by:  nninfomni  13215
  Copyright terms: Public domain W3C validator