Theorem nninfself 14418

Description: Domain and range of the selection function for ℕ_∞. (Contributed by Jim Kingdon, 6-Aug-2022.)

Hypothesis

Ref	Expression
nninfsel.e	⊢ 𝐸 = (𝑞 ∈ (2o ↑𝑚 ℕ∞) ↦ (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)))

Assertion

Ref	Expression
nninfself	⊢ 𝐸:(2o ↑𝑚 ℕ∞)⟶ℕ∞

Distinct variable groups:   𝑖,𝑘,𝑛   𝑘,𝑞,𝑛

Allowed substitution hints:   𝐸(𝑖,𝑘,𝑛,𝑞)

Proof of Theorem nninfself

Dummy variables 𝑓 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nninfsel.e	. 2 ⊢ 𝐸 = (𝑞 ∈ (2o ↑𝑚 ℕ∞) ↦ (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)))
2		nninfsellemcl 14416	. . . . 5 ⊢ ((𝑞 ∈ (2o ↑𝑚 ℕ∞) ∧ 𝑛 ∈ ω) → if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅) ∈ 2o)
3		eqid 2177	. . . . 5 ⊢ (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)) = (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))
4	2, 3	fmptd 5666	. . . 4 ⊢ (𝑞 ∈ (2o ↑𝑚 ℕ∞) → (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)):ω⟶2o)
5		2onn 6516	. . . . . 6 ⊢ 2o ∈ ω
6	5	a1i 9	. . . . 5 ⊢ (𝑞 ∈ (2o ↑𝑚 ℕ∞) → 2o ∈ ω)
7		omex 4589	. . . . . 6 ⊢ ω ∈ V
8	7	a1i 9	. . . . 5 ⊢ (𝑞 ∈ (2o ↑𝑚 ℕ∞) → ω ∈ V)
9	6, 8	elmapd 6656	. . . 4 ⊢ (𝑞 ∈ (2o ↑𝑚 ℕ∞) → ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)) ∈ (2o ↑𝑚 ω) ↔ (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)):ω⟶2o))
10	4, 9	mpbird 167	. . 3 ⊢ (𝑞 ∈ (2o ↑𝑚 ℕ∞) → (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)) ∈ (2o ↑𝑚 ω))
11		nninfsellemsuc 14417	. . . . 5 ⊢ ((𝑞 ∈ (2o ↑𝑚 ℕ∞) ∧ 𝑗 ∈ ω) → if(∀𝑘 ∈ suc suc 𝑗(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅) ⊆ if(∀𝑘 ∈ suc 𝑗(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))
12		peano2 4591	. . . . . 6 ⊢ (𝑗 ∈ ω → suc 𝑗 ∈ ω)
13		nninfsellemcl 14416	. . . . . . 7 ⊢ ((𝑞 ∈ (2o ↑𝑚 ℕ∞) ∧ suc 𝑗 ∈ ω) → if(∀𝑘 ∈ suc suc 𝑗(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅) ∈ 2o)
14	12, 13	sylan2 286	. . . . . 6 ⊢ ((𝑞 ∈ (2o ↑𝑚 ℕ∞) ∧ 𝑗 ∈ ω) → if(∀𝑘 ∈ suc suc 𝑗(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅) ∈ 2o)
15		suceq 4399	. . . . . . . . 9 ⊢ (𝑛 = suc 𝑗 → suc 𝑛 = suc suc 𝑗)
16	15	raleqdv 2678	. . . . . . . 8 ⊢ (𝑛 = suc 𝑗 → (∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o ↔ ∀𝑘 ∈ suc suc 𝑗(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o))
17	16	ifbid 3555	. . . . . . 7 ⊢ (𝑛 = suc 𝑗 → if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅) = if(∀𝑘 ∈ suc suc 𝑗(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))
18	17, 3	fvmptg 5588	. . . . . 6 ⊢ ((suc 𝑗 ∈ ω ∧ if(∀𝑘 ∈ suc suc 𝑗(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅) ∈ 2o) → ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘suc 𝑗) = if(∀𝑘 ∈ suc suc 𝑗(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))
19	12, 14, 18	syl2an2 594	. . . . 5 ⊢ ((𝑞 ∈ (2o ↑𝑚 ℕ∞) ∧ 𝑗 ∈ ω) → ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘suc 𝑗) = if(∀𝑘 ∈ suc suc 𝑗(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))
20		simpr 110	. . . . . 6 ⊢ ((𝑞 ∈ (2o ↑𝑚 ℕ∞) ∧ 𝑗 ∈ ω) → 𝑗 ∈ ω)
21		nninfsellemcl 14416	. . . . . 6 ⊢ ((𝑞 ∈ (2o ↑𝑚 ℕ∞) ∧ 𝑗 ∈ ω) → if(∀𝑘 ∈ suc 𝑗(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅) ∈ 2o)
22		suceq 4399	. . . . . . . . 9 ⊢ (𝑛 = 𝑗 → suc 𝑛 = suc 𝑗)
23	22	raleqdv 2678	. . . . . . . 8 ⊢ (𝑛 = 𝑗 → (∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o ↔ ∀𝑘 ∈ suc 𝑗(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o))
24	23	ifbid 3555	. . . . . . 7 ⊢ (𝑛 = 𝑗 → if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅) = if(∀𝑘 ∈ suc 𝑗(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))
25	24, 3	fvmptg 5588	. . . . . 6 ⊢ ((𝑗 ∈ ω ∧ if(∀𝑘 ∈ suc 𝑗(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅) ∈ 2o) → ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘𝑗) = if(∀𝑘 ∈ suc 𝑗(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))
26	20, 21, 25	syl2anc 411	. . . . 5 ⊢ ((𝑞 ∈ (2o ↑𝑚 ℕ∞) ∧ 𝑗 ∈ ω) → ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘𝑗) = if(∀𝑘 ∈ suc 𝑗(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))
27	11, 19, 26	3sstr4d 3200	. . . 4 ⊢ ((𝑞 ∈ (2o ↑𝑚 ℕ∞) ∧ 𝑗 ∈ ω) → ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘suc 𝑗) ⊆ ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘𝑗))
28	27	ralrimiva 2550	. . 3 ⊢ (𝑞 ∈ (2o ↑𝑚 ℕ∞) → ∀𝑗 ∈ ω ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘suc 𝑗) ⊆ ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘𝑗))
29		fveq1 5510	. . . . . 6 ⊢ (𝑓 = (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)) → (𝑓‘suc 𝑗) = ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘suc 𝑗))
30		fveq1 5510	. . . . . 6 ⊢ (𝑓 = (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)) → (𝑓‘𝑗) = ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘𝑗))
31	29, 30	sseq12d 3186	. . . . 5 ⊢ (𝑓 = (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)) → ((𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗) ↔ ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘suc 𝑗) ⊆ ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘𝑗)))
32	31	ralbidv 2477	. . . 4 ⊢ (𝑓 = (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)) → (∀𝑗 ∈ ω (𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗) ↔ ∀𝑗 ∈ ω ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘suc 𝑗) ⊆ ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘𝑗)))
33		df-nninf 7113	. . . 4 ⊢ ℕ∞ = {𝑓 ∈ (2o ↑𝑚 ω) ∣ ∀𝑗 ∈ ω (𝑓‘suc 𝑗) ⊆ (𝑓‘𝑗)}
34	32, 33	elrab2 2896	. . 3 ⊢ ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)) ∈ ℕ∞ ↔ ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)) ∈ (2o ↑𝑚 ω) ∧ ∀𝑗 ∈ ω ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘suc 𝑗) ⊆ ((𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))‘𝑗)))
35	10, 28, 34	sylanbrc 417	. 2 ⊢ (𝑞 ∈ (2o ↑𝑚 ℕ∞) → (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)) ∈ ℕ∞)
36	1, 35	fmpti 5664	1 ⊢ 𝐸:(2o ↑𝑚 ℕ∞)⟶ℕ∞

Syntax hints:   ∧ wa 104   = wceq 1353   ∈ wcel 2148  ∀wral 2455  Vcvv 2737   ⊆ wss 3129  ∅c0 3422  ifcif 3534   ↦ cmpt 4061  suc csuc 4362  ωcom 4586  ⟶wf 5208  ‘cfv 5212  (class class class)co 5869  1_oc1o 6404  2_oc2o 6405   ↑_𝑚 cmap 6642  ℕ_∞xnninf 7112

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533  ax-iinf 4584

This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2739  df-sbc 2963  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-if 3535  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-br 4001  df-opab 4062  df-mpt 4063  df-tr 4099  df-id 4290  df-iord 4363  df-on 4365  df-suc 4368  df-iom 4587  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-fv 5220  df-ov 5872  df-oprab 5873  df-mpo 5874  df-1o 6411  df-2o 6412  df-map 6644  df-nninf 7113

This theorem is referenced by:  nninfsellemeq  14419  nninfsellemeqinf  14421  nninfomnilem  14423