ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  infnninfOLD GIF version

Theorem infnninfOLD 7323
Description: Obsolete version of infnninf 7322 as of 10-Aug-2024. (Contributed by Jim Kingdon, 14-Jul-2022.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
infnninfOLD (ω × {1o}) ∈ ℕ

Proof of Theorem infnninfOLD
Dummy variables 𝑓 𝑖 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 1lt2o 6609 . . . 4 1o ∈ 2o
21fconst6 5536 . . 3 (ω × {1o}):ω⟶2o
3 2onn 6688 . . . . 5 2o ∈ ω
43elexi 2815 . . . 4 2o ∈ V
5 omex 4691 . . . 4 ω ∈ V
64, 5elmap 6845 . . 3 ((ω × {1o}) ∈ (2o𝑚 ω) ↔ (ω × {1o}):ω⟶2o)
72, 6mpbir 146 . 2 (ω × {1o}) ∈ (2o𝑚 ω)
8 peano2 4693 . . . . . 6 (𝑖 ∈ ω → suc 𝑖 ∈ ω)
9 1oex 6589 . . . . . . 7 1o ∈ V
109fvconst2 5869 . . . . . 6 (suc 𝑖 ∈ ω → ((ω × {1o})‘suc 𝑖) = 1o)
118, 10syl 14 . . . . 5 (𝑖 ∈ ω → ((ω × {1o})‘suc 𝑖) = 1o)
129fvconst2 5869 . . . . 5 (𝑖 ∈ ω → ((ω × {1o})‘𝑖) = 1o)
1311, 12eqtr4d 2267 . . . 4 (𝑖 ∈ ω → ((ω × {1o})‘suc 𝑖) = ((ω × {1o})‘𝑖))
14 eqimss 3281 . . . 4 (((ω × {1o})‘suc 𝑖) = ((ω × {1o})‘𝑖) → ((ω × {1o})‘suc 𝑖) ⊆ ((ω × {1o})‘𝑖))
1513, 14syl 14 . . 3 (𝑖 ∈ ω → ((ω × {1o})‘suc 𝑖) ⊆ ((ω × {1o})‘𝑖))
1615rgen 2585 . 2 𝑖 ∈ ω ((ω × {1o})‘suc 𝑖) ⊆ ((ω × {1o})‘𝑖)
17 fveq1 5638 . . . . 5 (𝑓 = (ω × {1o}) → (𝑓‘suc 𝑖) = ((ω × {1o})‘suc 𝑖))
18 fveq1 5638 . . . . 5 (𝑓 = (ω × {1o}) → (𝑓𝑖) = ((ω × {1o})‘𝑖))
1917, 18sseq12d 3258 . . . 4 (𝑓 = (ω × {1o}) → ((𝑓‘suc 𝑖) ⊆ (𝑓𝑖) ↔ ((ω × {1o})‘suc 𝑖) ⊆ ((ω × {1o})‘𝑖)))
2019ralbidv 2532 . . 3 (𝑓 = (ω × {1o}) → (∀𝑖 ∈ ω (𝑓‘suc 𝑖) ⊆ (𝑓𝑖) ↔ ∀𝑖 ∈ ω ((ω × {1o})‘suc 𝑖) ⊆ ((ω × {1o})‘𝑖)))
21 df-nninf 7318 . . 3 = {𝑓 ∈ (2o𝑚 ω) ∣ ∀𝑖 ∈ ω (𝑓‘suc 𝑖) ⊆ (𝑓𝑖)}
2220, 21elrab2 2965 . 2 ((ω × {1o}) ∈ ℕ ↔ ((ω × {1o}) ∈ (2o𝑚 ω) ∧ ∀𝑖 ∈ ω ((ω × {1o})‘suc 𝑖) ⊆ ((ω × {1o})‘𝑖)))
237, 16, 22mpbir2an 950 1 (ω × {1o}) ∈ ℕ
Colors of variables: wff set class
Syntax hints:   = wceq 1397  wcel 2202  wral 2510  wss 3200  {csn 3669  suc csuc 4462  ωcom 4688   × cxp 4723  wf 5322  cfv 5326  (class class class)co 6017  1oc1o 6574  2oc2o 6575  𝑚 cmap 6816  xnninf 7317
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1o 6581  df-2o 6582  df-map 6818  df-nninf 7318
This theorem is referenced by:  fxnn0nninf  10700
  Copyright terms: Public domain W3C validator