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

Theorem nninfomnilem 17267
Description: Lemma for nninfomni 17268. (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 7467 . . 3  |- ℕ∞  e.  _V
2 isomnimap 7483 . . 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 6948 . . . . . 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 17262 . . . . . . 7  |-  E :
( 2o  ^m ℕ∞ ) -->ℕ∞
76ffvelcdmi 5845 . . . . . 6  |-  ( r  e.  ( 2o  ^m ℕ∞ )  -> 
( E `  r
)  e. ℕ∞ )
84, 7ffvelcdmd 5847 . . . . 5  |-  ( r  e.  ( 2o  ^m ℕ∞ )  -> 
( r `  ( E `  r )
)  e.  2o )
9 df2o3 6706 . . . . 5  |-  2o  =  { (/) ,  1o }
108, 9eleqtrdi 2331 . . . 4  |-  ( r  e.  ( 2o  ^m ℕ∞ )  -> 
( r `  ( E `  r )
)  e.  { (/) ,  1o } )
11 elpri 3732 . . . 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 fveqeq2 5707 . . . . . . 7  |-  ( p  =  ( E `  r )  ->  (
( r `  p
)  =  (/)  <->  ( r `  ( E `  r
) )  =  (/) ) )
1413rspcev 2929 . . . . . 6  |-  ( ( ( E `  r
)  e. ℕ∞  /\  ( r `  ( E `  r ) )  =  (/) )  ->  E. p  e. ℕ∞  ( r `  p
)  =  (/) )
1514ex 115 . . . . 5  |-  ( ( E `  r )  e. ℕ∞  ->  ( ( r `  ( E `  r ) )  =  (/)  ->  E. p  e. ℕ∞  ( r `  p )  =  (/) ) )
167, 15syl 14 . . . 4  |-  ( r  e.  ( 2o  ^m ℕ∞ )  -> 
( ( r `  ( E `  r ) )  =  (/)  ->  E. p  e. ℕ∞  ( r `  p )  =  (/) ) )
17 simpl 109 . . . . . 6  |-  ( ( r  e.  ( 2o 
^m ℕ∞ )  /\  ( r `  ( E `  r ) )  =  1o )  ->  r  e.  ( 2o  ^m ℕ∞ ) )
18 simpr 110 . . . . . 6  |-  ( ( r  e.  ( 2o 
^m ℕ∞ )  /\  ( r `  ( E `  r ) )  =  1o )  ->  ( r `  ( E `  r ) )  =  1o )
195, 17, 18nninfsel 17266 . . . . 5  |-  ( ( r  e.  ( 2o 
^m ℕ∞ )  /\  ( r `  ( E `  r ) )  =  1o )  ->  A. p  e. ℕ∞  ( r `  p
)  =  1o )
2019ex 115 . . . 4  |-  ( r  e.  ( 2o  ^m ℕ∞ )  -> 
( ( r `  ( E `  r ) )  =  1o  ->  A. p  e. ℕ∞  ( r `  p
)  =  1o ) )
2116, 20orim12d 798 . . 3  |-  ( r  e.  ( 2o  ^m ℕ∞ )  -> 
( ( ( r `
 ( E `  r ) )  =  (/)  \/  ( r `  ( E `  r ) )  =  1o )  ->  ( E. p  e. ℕ∞  ( r `  p )  =  (/)  \/  A. p  e. ℕ∞  ( r `  p )  =  1o ) ) )
2212, 21mpd 13 . 2  |-  ( r  e.  ( 2o  ^m ℕ∞ )  -> 
( E. p  e. ℕ∞  (
r `  p )  =  (/)  \/  A. p  e. ℕ∞  ( r `  p )  =  1o ) )
233, 22mprgbir 2608 1  |- ℕ∞  e. Omni
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720    = wceq 1402    e. wcel 2209   A.wral 2528   E.wrex 2529   _Vcvv 2821   (/)c0 3520   ifcif 3638   {cpr 3710    |-> cmpt 4193   suc csuc 4512   omcom 4739   ` cfv 5380  (class class class)co 6088   1oc1o 6684   2oc2o 6685    ^m cmap 6926  ℕ∞xnninf 7465  Omnicomni 7480
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-13 2211  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1o 6691  df-2o 6692  df-map 6928  df-nninf 7466  df-omni 7481
This theorem is used by:  nninfomni  17268
  Copyright terms: Public domain W3C validator