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

Theorem nninfsel 16443
Description: 𝐸 is a selection function for . Theorem 3.6 of [PradicBrown2022], p. 5. (Contributed by Jim Kingdon, 9-Aug-2022.)
Hypotheses
Ref Expression
nninfsel.e 𝐸 = (𝑞 ∈ (2o𝑚) ↦ (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖𝑘, 1o, ∅))) = 1o, 1o, ∅)))
nninfsel.q (𝜑𝑄 ∈ (2o𝑚))
nninfsel.1 (𝜑 → (𝑄‘(𝐸𝑄)) = 1o)
Assertion
Ref Expression
nninfsel (𝜑 → ∀𝑝 ∈ ℕ (𝑄𝑝) = 1o)
Distinct variable groups:   𝑄,𝑖,𝑘,𝑛,𝑞   𝑖,𝑝,𝜑   𝜑,𝑘,𝑛
Allowed substitution hints:   𝜑(𝑞)   𝑄(𝑝)   𝐸(𝑖,𝑘,𝑛,𝑞,𝑝)

Proof of Theorem nninfsel
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 nninfsel.q . 2 (𝜑𝑄 ∈ (2o𝑚))
2 nninfsel.e . . . . 5 𝐸 = (𝑞 ∈ (2o𝑚) ↦ (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖𝑘, 1o, ∅))) = 1o, 1o, ∅)))
3 nninfsel.1 . . . . 5 (𝜑 → (𝑄‘(𝐸𝑄)) = 1o)
42, 1, 3nninfsellemeqinf 16442 . . . 4 (𝜑 → (𝐸𝑄) = (𝑖 ∈ ω ↦ 1o))
54fveq2d 5633 . . 3 (𝜑 → (𝑄‘(𝐸𝑄)) = (𝑄‘(𝑖 ∈ ω ↦ 1o)))
65, 3eqtr3d 2264 . 2 (𝜑 → (𝑄‘(𝑖 ∈ ω ↦ 1o)) = 1o)
71adantr 276 . . . 4 ((𝜑𝑥 ∈ ω) → 𝑄 ∈ (2o𝑚))
83adantr 276 . . . 4 ((𝜑𝑥 ∈ ω) → (𝑄‘(𝐸𝑄)) = 1o)
9 simpr 110 . . . 4 ((𝜑𝑥 ∈ ω) → 𝑥 ∈ ω)
102, 7, 8, 9nninfsellemqall 16441 . . 3 ((𝜑𝑥 ∈ ω) → (𝑄‘(𝑖 ∈ ω ↦ if(𝑖𝑥, 1o, ∅))) = 1o)
1110ralrimiva 2603 . 2 (𝜑 → ∀𝑥 ∈ ω (𝑄‘(𝑖 ∈ ω ↦ if(𝑖𝑥, 1o, ∅))) = 1o)
121, 6, 11nninfall 16435 1 (𝜑 → ∀𝑝 ∈ ℕ (𝑄𝑝) = 1o)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1395  wcel 2200  wral 2508  c0 3491  ifcif 3602  cmpt 4145  suc csuc 4456  ωcom 4682  cfv 5318  (class class class)co 6007  1oc1o 6561  2oc2o 6562  𝑚 cmap 6803  xnninf 7297
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-iord 4457  df-on 4459  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1o 6568  df-2o 6569  df-map 6805  df-nninf 7298
This theorem is referenced by:  nninfomnilem  16444
  Copyright terms: Public domain W3C validator