Theorem nninfsellemeqinf 14735

Description: Lemma for nninfsel 14736. (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
nninfsellemeqinf	⊢ (𝜑 → (𝐸‘𝑄) = (𝑖 ∈ ω ↦ 1o))

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

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

Proof of Theorem nninfsellemeqinf

Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nninfsel.e	. . . . . . 7 ⊢ 𝐸 = (𝑞 ∈ (2o ↑𝑚 ℕ∞) ↦ (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)))
2	1	nninfself 14732	. . . . . 6 ⊢ 𝐸:(2o ↑𝑚 ℕ∞)⟶ℕ∞
3	2	a1i 9	. . . . 5 ⊢ (𝜑 → 𝐸:(2o ↑𝑚 ℕ∞)⟶ℕ∞)
4		nninfsel.q	. . . . 5 ⊢ (𝜑 → 𝑄 ∈ (2o ↑𝑚 ℕ∞))
5	3, 4	ffvelcdmd 5652	. . . 4 ⊢ (𝜑 → (𝐸‘𝑄) ∈ ℕ∞)
6		nninff 7120	. . . 4 ⊢ ((𝐸‘𝑄) ∈ ℕ∞ → (𝐸‘𝑄):ω⟶2o)
7	5, 6	syl 14	. . 3 ⊢ (𝜑 → (𝐸‘𝑄):ω⟶2o)
8	7	ffnd 5366	. 2 ⊢ (𝜑 → (𝐸‘𝑄) Fn ω)
9		1onn 6520	. . . . 5 ⊢ 1o ∈ ω
10		fnconstg 5413	. . . . 5 ⊢ (1o ∈ ω → (ω × {1o}) Fn ω)
11	9, 10	ax-mp 5	. . . 4 ⊢ (ω × {1o}) Fn ω
12		fconstmpt 4673	. . . . 5 ⊢ (ω × {1o}) = (𝑖 ∈ ω ↦ 1o)
13	12	fneq1i 5310	. . . 4 ⊢ ((ω × {1o}) Fn ω ↔ (𝑖 ∈ ω ↦ 1o) Fn ω)
14	11, 13	mpbi 145	. . 3 ⊢ (𝑖 ∈ ω ↦ 1o) Fn ω
15	14	a1i 9	. 2 ⊢ (𝜑 → (𝑖 ∈ ω ↦ 1o) Fn ω)
16		elequ2 2153	. . . . . . . . . 10 ⊢ (𝑗 = 𝑘 → (𝑖 ∈ 𝑗 ↔ 𝑖 ∈ 𝑘))
17	16	ifbid 3555	. . . . . . . . 9 ⊢ (𝑗 = 𝑘 → if(𝑖 ∈ 𝑗, 1o, ∅) = if(𝑖 ∈ 𝑘, 1o, ∅))
18	17	mpteq2dv 4094	. . . . . . . 8 ⊢ (𝑗 = 𝑘 → (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑗, 1o, ∅)) = (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅)))
19	18	fveq2d 5519	. . . . . . 7 ⊢ (𝑗 = 𝑘 → (𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑗, 1o, ∅))) = (𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))))
20	19	eqeq1d 2186	. . . . . 6 ⊢ (𝑗 = 𝑘 → ((𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑗, 1o, ∅))) = 1o ↔ (𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o))
21	4	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ω) → 𝑄 ∈ (2o ↑𝑚 ℕ∞))
22		nninfsel.1	. . . . . . . . . 10 ⊢ (𝜑 → (𝑄‘(𝐸‘𝑄)) = 1o)
23	22	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ω) → (𝑄‘(𝐸‘𝑄)) = 1o)
24		simpr 110	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ω) → 𝑗 ∈ ω)
25	1, 21, 23, 24	nninfsellemqall 14734	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ω) → (𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑗, 1o, ∅))) = 1o)
26	25	ralrimiva 2550	. . . . . . 7 ⊢ (𝜑 → ∀𝑗 ∈ ω (𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑗, 1o, ∅))) = 1o)
27	26	ad2antrr 488	. . . . . 6 ⊢ (((𝜑 ∧ 𝑗 ∈ ω) ∧ 𝑘 ∈ suc 𝑗) → ∀𝑗 ∈ ω (𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑗, 1o, ∅))) = 1o)
28		simpr 110	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑗 ∈ ω) ∧ 𝑘 ∈ suc 𝑗) → 𝑘 ∈ suc 𝑗)
29		peano2 4594	. . . . . . . 8 ⊢ (𝑗 ∈ ω → suc 𝑗 ∈ ω)
30	29	ad2antlr 489	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑗 ∈ ω) ∧ 𝑘 ∈ suc 𝑗) → suc 𝑗 ∈ ω)
31		elnn 4605	. . . . . . 7 ⊢ ((𝑘 ∈ suc 𝑗 ∧ suc 𝑗 ∈ ω) → 𝑘 ∈ ω)
32	28, 30, 31	syl2anc 411	. . . . . 6 ⊢ (((𝜑 ∧ 𝑗 ∈ ω) ∧ 𝑘 ∈ suc 𝑗) → 𝑘 ∈ ω)
33	20, 27, 32	rspcdva 2846	. . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ ω) ∧ 𝑘 ∈ suc 𝑗) → (𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o)
34	33	ralrimiva 2550	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ ω) → ∀𝑘 ∈ suc 𝑗(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o)
35	34	iftrued 3541	. . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ ω) → if(∀𝑘 ∈ suc 𝑗(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅) = 1o)
36		omex 4592	. . . . . . 7 ⊢ ω ∈ V
37	36	mptex 5742	. . . . . 6 ⊢ (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)) ∈ V
38	37	a1i 9	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ ω) → (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)) ∈ V)
39		fveq1 5514	. . . . . . . . . 10 ⊢ (𝑞 = 𝑄 → (𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = (𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))))
40	39	eqeq1d 2186	. . . . . . . . 9 ⊢ (𝑞 = 𝑄 → ((𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o ↔ (𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o))
41	40	ralbidv 2477	. . . . . . . 8 ⊢ (𝑞 = 𝑄 → (∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o ↔ ∀𝑘 ∈ suc 𝑛(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o))
42	41	ifbid 3555	. . . . . . 7 ⊢ (𝑞 = 𝑄 → if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅) = if(∀𝑘 ∈ suc 𝑛(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))
43	42	mpteq2dv 4094	. . . . . 6 ⊢ (𝑞 = 𝑄 → (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑞‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)) = (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)))
44	43, 1	fvmptg 5592	. . . . 5 ⊢ ((𝑄 ∈ (2o ↑𝑚 ℕ∞) ∧ (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)) ∈ V) → (𝐸‘𝑄) = (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)))
45	21, 38, 44	syl2anc 411	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ ω) → (𝐸‘𝑄) = (𝑛 ∈ ω ↦ if(∀𝑘 ∈ suc 𝑛(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅)))
46		suceq 4402	. . . . . . 7 ⊢ (𝑛 = 𝑗 → suc 𝑛 = suc 𝑗)
47	46	adantl 277	. . . . . 6 ⊢ (((𝜑 ∧ 𝑗 ∈ ω) ∧ 𝑛 = 𝑗) → suc 𝑛 = suc 𝑗)
48	47	raleqdv 2678	. . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ ω) ∧ 𝑛 = 𝑗) → (∀𝑘 ∈ suc 𝑛(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o ↔ ∀𝑘 ∈ suc 𝑗(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o))
49	48	ifbid 3555	. . . 4 ⊢ (((𝜑 ∧ 𝑗 ∈ ω) ∧ 𝑛 = 𝑗) → if(∀𝑘 ∈ suc 𝑛(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅) = if(∀𝑘 ∈ suc 𝑗(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))
50	35, 9	eqeltrdi 2268	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ ω) → if(∀𝑘 ∈ suc 𝑗(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅) ∈ ω)
51	45, 49, 24, 50	fvmptd 5597	. . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ ω) → ((𝐸‘𝑄)‘𝑗) = if(∀𝑘 ∈ suc 𝑗(𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑘, 1o, ∅))) = 1o, 1o, ∅))
52		eqidd 2178	. . . . . 6 ⊢ (𝑖 = 𝑗 → 1o = 1o)
53		eqid 2177	. . . . . 6 ⊢ (𝑖 ∈ ω ↦ 1o) = (𝑖 ∈ ω ↦ 1o)
54	52, 53	fvmptg 5592	. . . . 5 ⊢ ((𝑗 ∈ ω ∧ 1o ∈ ω) → ((𝑖 ∈ ω ↦ 1o)‘𝑗) = 1o)
55	9, 54	mpan2 425	. . . 4 ⊢ (𝑗 ∈ ω → ((𝑖 ∈ ω ↦ 1o)‘𝑗) = 1o)
56	55	adantl 277	. . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ ω) → ((𝑖 ∈ ω ↦ 1o)‘𝑗) = 1o)
57	35, 51, 56	3eqtr4d 2220	. 2 ⊢ ((𝜑 ∧ 𝑗 ∈ ω) → ((𝐸‘𝑄)‘𝑗) = ((𝑖 ∈ ω ↦ 1o)‘𝑗))
58	8, 15, 57	eqfnfvd 5616	1 ⊢ (𝜑 → (𝐸‘𝑄) = (𝑖 ∈ ω ↦ 1o))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1353   ∈ wcel 2148  ∀wral 2455  Vcvv 2737  ∅c0 3422  ifcif 3534  {csn 3592   ↦ cmpt 4064  suc csuc 4365  ωcom 4589   × cxp 4624   Fn wfn 5211  ⟶wf 5212  ‘cfv 5216  (class class class)co 5874  1_oc1o 6409  2_oc2o 6410   ↑_𝑚 cmap 6647  ℕ_∞xnninf 7117

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-coll 4118  ax-sep 4121  ax-nul 4129  ax-pow 4174  ax-pr 4209  ax-un 4433  ax-setind 4536  ax-iinf 4587

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-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-if 3535  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-int 3845  df-iun 3888  df-br 4004  df-opab 4065  df-mpt 4066  df-tr 4102  df-id 4293  df-iord 4366  df-on 4368  df-suc 4371  df-iom 4590  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-rn 4637  df-res 4638  df-ima 4639  df-iota 5178  df-fun 5218  df-fn 5219  df-f 5220  df-f1 5221  df-fo 5222  df-f1o 5223  df-fv 5224  df-ov 5877  df-oprab 5878  df-mpo 5879  df-1o 6416  df-2o 6417  df-map 6649  df-nninf 7118

This theorem is referenced by:  nninfsel  14736