Theorem smflimlem6 47612

Description: Lemma for the proof that the limit of sigma-measurable functions is sigma-measurable, Proposition 121F (a) of [Fremlin1] p. 38 . This lemma proves that the preimages of right-closed, unbounded-below intervals are in the subspace sigma-algebra induced by 𝐷. The proof uses fnrndomnum 10545 rather than fnrndomg 10546, and so does not require ax-ac 10465. (Contributed by Glauco Siliprandi, 26-Jun-2021.) (Revised by Vincent Gonzalez, 30-Aug-2026.)

Hypotheses

Ref	Expression
smflimlem6.1	⊢ (𝜑 → 𝑀 ∈ ℤ)
smflimlem6.2	⊢ 𝑍 = (ℤ≥‘𝑀)
smflimlem6.3	⊢ (𝜑 → 𝑆 ∈ SAlg)
smflimlem6.4	⊢ (𝜑 → 𝐹:𝑍⟶(SMblFn‘𝑆))
smflimlem6.5	⊢ 𝐷 = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) ∈ dom ⇝ }
smflimlem6.6	⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ ( ⇝ ‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥))))
smflimlem6.7	⊢ (𝜑 → 𝐴 ∈ ℝ)
smflimlem6.8	⊢ 𝑃 = (𝑚 ∈ 𝑍, 𝑘 ∈ ℕ ↦ {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))})

Assertion

Ref	Expression
smflimlem6	⊢ (𝜑 → {𝑥 ∈ 𝐷 ∣ (𝐺‘𝑥) ≤ 𝐴} ∈ (𝑆 ↾t 𝐷))

Distinct variable groups:   𝐴,𝑘,𝑚,𝑛,𝑥   𝐴,𝑠,𝑘,𝑚,𝑥   𝐷,𝑘,𝑚,𝑛,𝑥   𝑘,𝐹,𝑚,𝑛,𝑥   𝐹,𝑠   𝑘,𝐺,𝑚,𝑛   𝑚,𝑀   𝑃,𝑘,𝑚,𝑛,𝑥   𝑃,𝑠   𝑆,𝑘,𝑚,𝑛   𝑆,𝑠   𝑘,𝑍,𝑚,𝑛,𝑥   𝑍,𝑠   𝜑,𝑘,𝑚,𝑛,𝑥

Allowed substitution hints:   𝜑(𝑠)   𝐷(𝑠)   𝑆(𝑥)   𝐺(𝑥, 𝑠)   𝑀(𝑥, 𝑘, 𝑛, 𝑠)

Proof of Theorem smflimlem6

Dummy variables 𝑐 𝑟 𝑖 𝑗 𝑙 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		omelon 9629	. . . . . . . 8 ⊢ ω ∈ On
2		smflimlem6.2	. . . . . . . . 9 ⊢ 𝑍 = (ℤ≥‘𝑀)
3	2	uzct 45905	. . . . . . . 8 ⊢ 𝑍 ≼ ω
4		ondomen 10044	. . . . . . . 8 ⊢ ((ω ∈ On ∧ 𝑍 ≼ ω) → 𝑍 ∈ dom card)
5	1, 3, 4	mp2an 705	. . . . . . 7 ⊢ 𝑍 ∈ dom card
6		nnct 14049	. . . . . . . 8 ⊢ ℕ ≼ ω
7		ondomen 10044	. . . . . . . 8 ⊢ ((ω ∈ On ∧ ℕ ≼ ω) → ℕ ∈ dom card)
8	1, 6, 7	mp2an 705	. . . . . . 7 ⊢ ℕ ∈ dom card
9		xpnum 9960	. . . . . . 7 ⊢ ((𝑍 ∈ dom card ∧ ℕ ∈ dom card) → (𝑍 × ℕ) ∈ dom card)
10	5, 8, 9	mp2an 705	. . . . . 6 ⊢ (𝑍 × ℕ) ∈ dom card
11	10	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑍 × ℕ) ∈ dom card)
12		eqid 2762	. . . . . . . . 9 ⊢ {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} = {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))}
13		smflimlem6.3	. . . . . . . . 9 ⊢ (𝜑 → 𝑆 ∈ SAlg)
14	12, 13	rabexd 5308	. . . . . . . 8 ⊢ (𝜑 → {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} ∈ V)
15	14	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝑍 ∧ 𝑘 ∈ ℕ)) → {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} ∈ V)
16	15	ralrimivva 3207	. . . . . 6 ⊢ (𝜑 → ∀𝑚 ∈ 𝑍 ∀𝑘 ∈ ℕ {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} ∈ V)
17		smflimlem6.8	. . . . . . 7 ⊢ 𝑃 = (𝑚 ∈ 𝑍, 𝑘 ∈ ℕ ↦ {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))})
18	17	fnmpo 8070	. . . . . 6 ⊢ (∀𝑚 ∈ 𝑍 ∀𝑘 ∈ ℕ {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} ∈ V → 𝑃 Fn (𝑍 × ℕ))
19	16, 18	syl 18	. . . . 5 ⊢ (𝜑 → 𝑃 Fn (𝑍 × ℕ))
20		fnrndomnum 10545	. . . . 5 ⊢ ((𝑍 × ℕ) ∈ dom card → (𝑃 Fn (𝑍 × ℕ) → ran 𝑃 ≼ (𝑍 × ℕ)))
21	11, 19, 20	sylc 66	. . . 4 ⊢ (𝜑 → ran 𝑃 ≼ (𝑍 × ℕ))
22	3, 6	pm3.2i 476	. . . . . 6 ⊢ (𝑍 ≼ ω ∧ ℕ ≼ ω)
23		xpct 10023	. . . . . 6 ⊢ ((𝑍 ≼ ω ∧ ℕ ≼ ω) → (𝑍 × ℕ) ≼ ω)
24	22, 23	ax-mp 5	. . . . 5 ⊢ (𝑍 × ℕ) ≼ ω
25	24	a1i 11	. . . 4 ⊢ (𝜑 → (𝑍 × ℕ) ≼ ω)
26		domtr 9017	. . . 4 ⊢ ((ran 𝑃 ≼ (𝑍 × ℕ) ∧ (𝑍 × ℕ) ≼ ω) → ran 𝑃 ≼ ω)
27	21, 25, 26	syl2anc 596	. . 3 ⊢ (𝜑 → ran 𝑃 ≼ ω)
28		vex 3457	. . . . . 6 ⊢ 𝑦 ∈ V
29	17	elrnmpog 7552	. . . . . 6 ⊢ (𝑦 ∈ V → (𝑦 ∈ ran 𝑃 ↔ ∃𝑚 ∈ 𝑍 ∃𝑘 ∈ ℕ 𝑦 = {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))}))
30	28, 29	ax-mp 5	. . . . 5 ⊢ (𝑦 ∈ ran 𝑃 ↔ ∃𝑚 ∈ 𝑍 ∃𝑘 ∈ ℕ 𝑦 = {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))})
31	30	bilani 510	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ ran 𝑃) → ∃𝑚 ∈ 𝑍 ∃𝑘 ∈ ℕ 𝑦 = {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))})
32		simp3 1156	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝑍 ∧ 𝑘 ∈ ℕ) ∧ 𝑦 = {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))}) → 𝑦 = {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))})
33	13	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝑍 ∧ 𝑘 ∈ ℕ)) → 𝑆 ∈ SAlg)
34		smflimlem6.4	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐹:𝑍⟶(SMblFn‘𝑆))
35	34	ffvelcdmda 7081	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → (𝐹‘𝑚) ∈ (SMblFn‘𝑆))
36	35	adantrr 730	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝑍 ∧ 𝑘 ∈ ℕ)) → (𝐹‘𝑚) ∈ (SMblFn‘𝑆))
37		eqid 2762	. . . . . . . . . . . 12 ⊢ dom (𝐹‘𝑚) = dom (𝐹‘𝑚)
38		smflimlem6.7	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐴 ∈ ℝ)
39	38	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐴 ∈ ℝ)
40		nnrecre 12306	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ ℕ → (1 / 𝑘) ∈ ℝ)
41	40	adantl 487	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (1 / 𝑘) ∈ ℝ)
42	39, 41	readdcld 11266	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐴 + (1 / 𝑘)) ∈ ℝ)
43	42	adantrl 729	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝑍 ∧ 𝑘 ∈ ℕ)) → (𝐴 + (1 / 𝑘)) ∈ ℝ)
44	33, 36, 37, 43	smfpreimalt 47567	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝑍 ∧ 𝑘 ∈ ℕ)) → {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} ∈ (𝑆 ↾t dom (𝐹‘𝑚)))
45		fvex 6895	. . . . . . . . . . . . . . 15 ⊢ (𝐹‘𝑚) ∈ V
46	45	dmex 7910	. . . . . . . . . . . . . 14 ⊢ dom (𝐹‘𝑚) ∈ V
47	46	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (𝐹‘𝑚) ∈ V)
48		elrest 17518	. . . . . . . . . . . . 13 ⊢ ((𝑆 ∈ SAlg ∧ dom (𝐹‘𝑚) ∈ V) → ({𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} ∈ (𝑆 ↾t dom (𝐹‘𝑚)) ↔ ∃𝑠 ∈ 𝑆 {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))))
49	13, 47, 48	syl2anc 596	. . . . . . . . . . . 12 ⊢ (𝜑 → ({𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} ∈ (𝑆 ↾t dom (𝐹‘𝑚)) ↔ ∃𝑠 ∈ 𝑆 {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))))
50	49	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝑍 ∧ 𝑘 ∈ ℕ)) → ({𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} ∈ (𝑆 ↾t dom (𝐹‘𝑚)) ↔ ∃𝑠 ∈ 𝑆 {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))))
51	44, 50	mpbid 235	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝑍 ∧ 𝑘 ∈ ℕ)) → ∃𝑠 ∈ 𝑆 {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚)))
52		rabn0 4342	. . . . . . . . . 10 ⊢ ({𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} ≠ ∅ ↔ ∃𝑠 ∈ 𝑆 {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚)))
53	51, 52	sylibr 237	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝑍 ∧ 𝑘 ∈ ℕ)) → {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} ≠ ∅)
54	53	3adant3 1150	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝑍 ∧ 𝑘 ∈ ℕ) ∧ 𝑦 = {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))}) → {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} ≠ ∅)
55	32, 54	eqnetrd 3024	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝑍 ∧ 𝑘 ∈ ℕ) ∧ 𝑦 = {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))}) → 𝑦 ≠ ∅)
56	55	3exp 1137	. . . . . 6 ⊢ (𝜑 → ((𝑚 ∈ 𝑍 ∧ 𝑘 ∈ ℕ) → (𝑦 = {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} → 𝑦 ≠ ∅)))
57	56	rexlimdvv 3220	. . . . 5 ⊢ (𝜑 → (∃𝑚 ∈ 𝑍 ∃𝑘 ∈ ℕ 𝑦 = {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} → 𝑦 ≠ ∅))
58	57	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ ran 𝑃) → (∃𝑚 ∈ 𝑍 ∃𝑘 ∈ ℕ 𝑦 = {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} → 𝑦 ≠ ∅))
59	31, 58	mpd 16	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ ran 𝑃) → 𝑦 ≠ ∅)
60	27, 59	axccd2 46067	. 2 ⊢ (𝜑 → ∃𝑐∀𝑦 ∈ ran 𝑃(𝑐‘𝑦) ∈ 𝑦)
61		smflimlem6.1	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ)
62	61	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑦 ∈ ran 𝑃(𝑐‘𝑦) ∈ 𝑦) → 𝑀 ∈ ℤ)
63	13	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑦 ∈ ran 𝑃(𝑐‘𝑦) ∈ 𝑦) → 𝑆 ∈ SAlg)
64	34	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑦 ∈ ran 𝑃(𝑐‘𝑦) ∈ 𝑦) → 𝐹:𝑍⟶(SMblFn‘𝑆))
65		smflimlem6.5	. . . . 5 ⊢ 𝐷 = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) ∈ dom ⇝ }
66		smflimlem6.6	. . . . 5 ⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ ( ⇝ ‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥))))
67	38	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑦 ∈ ran 𝑃(𝑐‘𝑦) ∈ 𝑦) → 𝐴 ∈ ℝ)
68		fvoveq1 7440	. . . . . 6 ⊢ (𝑙 = 𝑚 → (𝑐‘(𝑙𝑃𝑗)) = (𝑐‘(𝑚𝑃𝑗)))
69		oveq2 7425	. . . . . . 7 ⊢ (𝑗 = 𝑘 → (𝑚𝑃𝑗) = (𝑚𝑃𝑘))
70	69	fveq2d 6886	. . . . . 6 ⊢ (𝑗 = 𝑘 → (𝑐‘(𝑚𝑃𝑗)) = (𝑐‘(𝑚𝑃𝑘)))
71	68, 70	cbvmpov 7512	. . . . 5 ⊢ (𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗))) = (𝑚 ∈ 𝑍, 𝑘 ∈ ℕ ↦ (𝑐‘(𝑚𝑃𝑘)))
72		nfcv 2924	. . . . . 6 ⊢ Ⅎ𝑘∪ 𝑛 ∈ 𝑍 ∩ 𝑖 ∈ (ℤ≥‘𝑛)(𝑖(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑗)
73		nfcv 2924	. . . . . . 7 ⊢ Ⅎ𝑗𝑍
74		nfcv 2924	. . . . . . . 8 ⊢ Ⅎ𝑗(ℤ≥‘𝑛)
75		nfcv 2924	. . . . . . . . 9 ⊢ Ⅎ𝑗𝑚
76		nfmpo2 7498	. . . . . . . . 9 ⊢ Ⅎ𝑗(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))
77		nfcv 2924	. . . . . . . . 9 ⊢ Ⅎ𝑗𝑘
78	75, 76, 77	nfov 7447	. . . . . . . 8 ⊢ Ⅎ𝑗(𝑚(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘)
79	74, 78	nfiin 4987	. . . . . . 7 ⊢ Ⅎ𝑗∩ 𝑚 ∈ (ℤ≥‘𝑛)(𝑚(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘)
80	73, 79	nfiun 4986	. . . . . 6 ⊢ Ⅎ𝑗∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)(𝑚(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘)
81		oveq2 7425	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑘 → (𝑖(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑗) = (𝑖(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘))
82	81	adantr 486	. . . . . . . . . 10 ⊢ ((𝑗 = 𝑘 ∧ 𝑖 ∈ (ℤ≥‘𝑛)) → (𝑖(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑗) = (𝑖(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘))
83	82	iineq2dv 4980	. . . . . . . . 9 ⊢ (𝑗 = 𝑘 → ∩ 𝑖 ∈ (ℤ≥‘𝑛)(𝑖(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑗) = ∩ 𝑖 ∈ (ℤ≥‘𝑛)(𝑖(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘))
84		oveq1 7424	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑚 → (𝑖(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘) = (𝑚(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘))
85	84	cbviinv 5002	. . . . . . . . . 10 ⊢ ∩ 𝑖 ∈ (ℤ≥‘𝑛)(𝑖(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘) = ∩ 𝑚 ∈ (ℤ≥‘𝑛)(𝑚(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘)
86	85	a1i 11	. . . . . . . . 9 ⊢ (𝑗 = 𝑘 → ∩ 𝑖 ∈ (ℤ≥‘𝑛)(𝑖(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘) = ∩ 𝑚 ∈ (ℤ≥‘𝑛)(𝑚(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘))
87	83, 86	eqtrd 2797	. . . . . . . 8 ⊢ (𝑗 = 𝑘 → ∩ 𝑖 ∈ (ℤ≥‘𝑛)(𝑖(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑗) = ∩ 𝑚 ∈ (ℤ≥‘𝑛)(𝑚(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘))
88	87	adantr 486	. . . . . . 7 ⊢ ((𝑗 = 𝑘 ∧ 𝑛 ∈ 𝑍) → ∩ 𝑖 ∈ (ℤ≥‘𝑛)(𝑖(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑗) = ∩ 𝑚 ∈ (ℤ≥‘𝑛)(𝑚(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘))
89	88	iuneq2dv 4979	. . . . . 6 ⊢ (𝑗 = 𝑘 → ∪ 𝑛 ∈ 𝑍 ∩ 𝑖 ∈ (ℤ≥‘𝑛)(𝑖(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑗) = ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)(𝑚(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘))
90	72, 80, 89	cbviin 4998	. . . . 5 ⊢ ∩ 𝑗 ∈ ℕ ∪ 𝑛 ∈ 𝑍 ∩ 𝑖 ∈ (ℤ≥‘𝑛)(𝑖(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑗) = ∩ 𝑘 ∈ ℕ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)(𝑚(𝑙 ∈ 𝑍, 𝑗 ∈ ℕ ↦ (𝑐‘(𝑙𝑃𝑗)))𝑘)
91		fveq2 6882	. . . . . . . 8 ⊢ (𝑦 = 𝑟 → (𝑐‘𝑦) = (𝑐‘𝑟))
92		id 23	. . . . . . . 8 ⊢ (𝑦 = 𝑟 → 𝑦 = 𝑟)
93	91, 92	eleq12d 2856	. . . . . . 7 ⊢ (𝑦 = 𝑟 → ((𝑐‘𝑦) ∈ 𝑦 ↔ (𝑐‘𝑟) ∈ 𝑟))
94	93	rspccva 3578	. . . . . 6 ⊢ ((∀𝑦 ∈ ran 𝑃(𝑐‘𝑦) ∈ 𝑦 ∧ 𝑟 ∈ ran 𝑃) → (𝑐‘𝑟) ∈ 𝑟)
95	94	adantll 727	. . . . 5 ⊢ (((𝜑 ∧ ∀𝑦 ∈ ran 𝑃(𝑐‘𝑦) ∈ 𝑦) ∧ 𝑟 ∈ ran 𝑃) → (𝑐‘𝑟) ∈ 𝑟)
96	62, 2, 63, 64, 65, 66, 67, 17, 71, 90, 95	smflimlem5 47611	. . . 4 ⊢ ((𝜑 ∧ ∀𝑦 ∈ ran 𝑃(𝑐‘𝑦) ∈ 𝑦) → {𝑥 ∈ 𝐷 ∣ (𝐺‘𝑥) ≤ 𝐴} ∈ (𝑆 ↾t 𝐷))
97	96	ex 418	. . 3 ⊢ (𝜑 → (∀𝑦 ∈ ran 𝑃(𝑐‘𝑦) ∈ 𝑦 → {𝑥 ∈ 𝐷 ∣ (𝐺‘𝑥) ≤ 𝐴} ∈ (𝑆 ↾t 𝐷)))
98	97	exlimdv 1966	. 2 ⊢ (𝜑 → (∃𝑐∀𝑦 ∈ ran 𝑃(𝑐‘𝑦) ∈ 𝑦 → {𝑥 ∈ 𝐷 ∣ (𝐺‘𝑥) ≤ 𝐴} ∈ (𝑆 ↾t 𝐷)))
99	60, 98	mpd 16	1 ⊢ (𝜑 → {𝑥 ∈ 𝐷 ∣ (𝐺‘𝑥) ≤ 𝐴} ∈ (𝑆 ↾t 𝐷))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  {crab 3414  Vcvv 3453   ∩ cin 3901  ∅c0 4282  ∪ ciun 4954  ∩ ciin 4955   class class class wbr 5107   ↦ cmpt 5190   × cxp 5657  dom cdm 5659  ran crn 5660  Oncon0 6361   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537  (class class class)co 7417   ∈ cmpo 7419  ωcom 7866   ≼ cdom 8954  cardccrd 9944  ℝcr 11127  1c1 11129   + caddc 11131   < clt 11271   ≤ cle 11272   / cdiv 11899  ℕcn 12261  ℤcz 12619  ℤ_≥cuz 12891   ⇝ cli 15575   ↾_t crest 17511  SAlgcsalg 47144  SMblFncsmblfn 47531

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-inf2 9624  ax-cc 10441  ax-cnex 11184  ax-resscn 11185  ax-1cn 11186  ax-icn 11187  ax-addcl 11188  ax-addrcl 11189  ax-mulcl 11190  ax-mulrcl 11191  ax-mulcom 11192  ax-addass 11193  ax-mulass 11194  ax-distr 11195  ax-i2m1 11196  ax-1ne0 11197  ax-1rid 11198  ax-rnegex 11199  ax-rrecex 11200  ax-cnre 11201  ax-pre-lttri 11202  ax-pre-lttrn 11203  ax-pre-ltadd 11204  ax-pre-mulgt0 11205  ax-pre-sup 11206

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-oadd 8463  df-omul 8464  df-er 8700  df-map 8832  df-pm 8833  df-en 8957  df-dom 8958  df-sdom 8959  df-fin 8960  df-sup 9416  df-inf 9417  df-oi 9486  df-card 9948  df-acn 9951  df-pnf 11273  df-mnf 11274  df-xr 11275  df-ltxr 11276  df-le 11277  df-sub 11471  df-neg 11472  df-div 11900  df-nn 12262  df-2 12331  df-3 12332  df-n0 12533  df-z 12620  df-uz 12892  df-q 13002  df-rp 13047  df-ioo 13406  df-ico 13408  df-fl 13857  df-seq 14070  df-exp 14130  df-cj 15190  df-re 15191  df-im 15192  df-sqrt 15326  df-abs 15327  df-clim 15579  df-rlim 15580  df-rest 17513  df-salg 47145  df-smblfn 47532

This theorem is used by:  smflim  47613