Theorem smfinfmpt 46931

Description: The infimum of a countable set of sigma-measurable functions is sigma-measurable. Proposition 121F (c) of [Fremlin1] p. 38 . (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
smfinfmpt.n	⊢ Ⅎ𝑛𝜑
smfinfmpt.x	⊢ Ⅎ𝑥𝜑
smfinfmpt.y	⊢ Ⅎ𝑦𝜑
smfinfmpt.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
smfinfmpt.z	⊢ 𝑍 = (ℤ≥‘𝑀)
smfinfmpt.s	⊢ (𝜑 → 𝑆 ∈ SAlg)
smfinfmpt.b	⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
smfinfmpt.f	⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ (SMblFn‘𝑆))
smfinfmpt.d	⊢ 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 𝐴 ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ 𝐵}
smfinfmpt.g	⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ inf(ran (𝑛 ∈ 𝑍 ↦ 𝐵), ℝ, < ))

Assertion

Ref	Expression
smfinfmpt	⊢ (𝜑 → 𝐺 ∈ (SMblFn‘𝑆))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑦,𝐵   𝑆,𝑛   𝑛,𝑍,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑛)   𝐴(𝑛)   𝐵(𝑥,𝑛)   𝐷(𝑥,𝑦,𝑛)   𝑆(𝑥,𝑦)   𝐺(𝑥,𝑦,𝑛)   𝑀(𝑥,𝑦,𝑛)   𝑉(𝑥,𝑦,𝑛)

Proof of Theorem smfinfmpt

Step	Hyp	Ref	Expression
1		smfinfmpt.g	. . 3 ⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ inf(ran (𝑛 ∈ 𝑍 ↦ 𝐵), ℝ, < ))
2		smfinfmpt.x	. . . 4 ⊢ Ⅎ𝑥𝜑
3		smfinfmpt.d	. . . . 5 ⊢ 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 𝐴 ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ 𝐵}
4		smfinfmpt.n	. . . . . . . 8 ⊢ Ⅎ𝑛𝜑
5		eqidd 2734	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵)) = (𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵)))
6		smfinfmpt.f	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ (SMblFn‘𝑆))
7	5, 6	fvmpt2d 6951	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) = (𝑥 ∈ 𝐴 ↦ 𝐵))
8	7	dmeqd 5852	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) = dom (𝑥 ∈ 𝐴 ↦ 𝐵))
9		nfcv 2896	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝑍
10	9	nfcri 2888	. . . . . . . . . . 11 ⊢ Ⅎ𝑥 𝑛 ∈ 𝑍
11	2, 10	nfan 1900	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑛 ∈ 𝑍)
12		eqid 2733	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
13		smfinfmpt.b	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
14	13	3expa 1118	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
15	11, 12, 14	dmmptdf 45335	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → dom (𝑥 ∈ 𝐴 ↦ 𝐵) = 𝐴)
16	8, 15	eqtr2d 2769	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝐴 = dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛))
17	4, 16	iineq2d 4967	. . . . . . 7 ⊢ (𝜑 → ∩ 𝑛 ∈ 𝑍 𝐴 = ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛))
18	2, 17	rabeqd 3425	. . . . . 6 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 𝐴 ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ 𝐵} = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ 𝐵})
19		smfinfmpt.y	. . . . . . . . 9 ⊢ Ⅎ𝑦𝜑
20		nfv 1915	. . . . . . . . 9 ⊢ Ⅎ𝑦 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)
21	19, 20	nfan 1900	. . . . . . . 8 ⊢ Ⅎ𝑦(𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛))
22		nfii1 4981	. . . . . . . . . . 11 ⊢ Ⅎ𝑛∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)
23	22	nfcri 2888	. . . . . . . . . 10 ⊢ Ⅎ𝑛 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)
24	4, 23	nfan 1900	. . . . . . . . 9 ⊢ Ⅎ𝑛(𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛))
25		simpll 766	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)) ∧ 𝑛 ∈ 𝑍) → 𝜑)
26		simpr 484	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)) ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍)
27		eliinid 45222	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛))
28	27	adantll 714	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛))
29	8, 15	eqtrd 2768	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) = 𝐴)
30	29	adantlr 715	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)) ∧ 𝑛 ∈ 𝑍) → dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) = 𝐴)
31	28, 30	eleqtrd 2835	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ 𝐴)
32	7	fveq1d 6833	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
33	32	3adant3 1132	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ 𝐴) → (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
34		simp3 1138	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
35		fvmpt4 45349	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑉) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
36	34, 13, 35	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
37	33, 36	eqtr2d 2769	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ 𝐴) → 𝐵 = (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥))
38	37	breq2d 5107	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ 𝐴) → (𝑦 ≤ 𝐵 ↔ 𝑦 ≤ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)))
39	25, 26, 31, 38	syl3anc 1373	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)) ∧ 𝑛 ∈ 𝑍) → (𝑦 ≤ 𝐵 ↔ 𝑦 ≤ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)))
40	24, 39	ralbida 3245	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)) → (∀𝑛 ∈ 𝑍 𝑦 ≤ 𝐵 ↔ ∀𝑛 ∈ 𝑍 𝑦 ≤ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)))
41	21, 40	rexbid 3248	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)) → (∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ 𝐵 ↔ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)))
42	2, 41	rabbida 3423	. . . . . 6 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ 𝐵} = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)})
43	18, 42	eqtrd 2768	. . . . 5 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 𝐴 ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ 𝐵} = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)})
44	3, 43	eqtrid 2780	. . . 4 ⊢ (𝜑 → 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)})
45		nfcv 2896	. . . . . . . . . . . 12 ⊢ Ⅎ𝑛ℝ
46		nfra1 3258	. . . . . . . . . . . 12 ⊢ Ⅎ𝑛∀𝑛 ∈ 𝑍 𝑦 ≤ 𝐵
47	45, 46	nfrexw 3282	. . . . . . . . . . 11 ⊢ Ⅎ𝑛∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ 𝐵
48		nfii1 4981	. . . . . . . . . . 11 ⊢ Ⅎ𝑛∩ 𝑛 ∈ 𝑍 𝐴
49	47, 48	nfrabw 3434	. . . . . . . . . 10 ⊢ Ⅎ𝑛{𝑥 ∈ ∩ 𝑛 ∈ 𝑍 𝐴 ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ 𝐵}
50	3, 49	nfcxfr 2894	. . . . . . . . 9 ⊢ Ⅎ𝑛𝐷
51	50	nfcri 2888	. . . . . . . 8 ⊢ Ⅎ𝑛 𝑥 ∈ 𝐷
52	4, 51	nfan 1900	. . . . . . 7 ⊢ Ⅎ𝑛(𝜑 ∧ 𝑥 ∈ 𝐷)
53		simpll 766	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑛 ∈ 𝑍) → 𝜑)
54		simpr 484	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍)
55		rabidim1 3419	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 𝐴 ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ 𝐵} → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 𝐴)
56	55, 3	eleq2s 2851	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐷 → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 𝐴)
57		eliinid 45222	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ∩ 𝑛 ∈ 𝑍 𝐴 ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ 𝐴)
58	56, 57	sylan 580	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ 𝐴)
59	58	adantll 714	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ 𝐴)
60	53, 54, 59, 37	syl3anc 1373	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑛 ∈ 𝑍) → 𝐵 = (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥))
61	52, 60	mpteq2da 5187	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝑛 ∈ 𝑍 ↦ 𝐵) = (𝑛 ∈ 𝑍 ↦ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)))
62	61	rneqd 5885	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ran (𝑛 ∈ 𝑍 ↦ 𝐵) = ran (𝑛 ∈ 𝑍 ↦ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)))
63	62	infeq1d 9372	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → inf(ran (𝑛 ∈ 𝑍 ↦ 𝐵), ℝ, < ) = inf(ran (𝑛 ∈ 𝑍 ↦ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)), ℝ, < ))
64	2, 44, 63	mpteq12da 5178	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐷 ↦ inf(ran (𝑛 ∈ 𝑍 ↦ 𝐵), ℝ, < )) = (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)} ↦ inf(ran (𝑛 ∈ 𝑍 ↦ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)), ℝ, < )))
65	1, 64	eqtrid 2780	. 2 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)} ↦ inf(ran (𝑛 ∈ 𝑍 ↦ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)), ℝ, < )))
66		nfmpt1 5194	. . 3 ⊢ Ⅎ𝑛(𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))
67		nfmpt1 5194	. . . 4 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵)
68	9, 67	nfmpt 5193	. . 3 ⊢ Ⅎ𝑥(𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))
69		smfinfmpt.m	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ)
70		smfinfmpt.z	. . 3 ⊢ 𝑍 = (ℤ≥‘𝑀)
71		smfinfmpt.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ SAlg)
72	4, 6	fmptd2f 45346	. . 3 ⊢ (𝜑 → (𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵)):𝑍⟶(SMblFn‘𝑆))
73		eqid 2733	. . 3 ⊢ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)} = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)}
74		eqid 2733	. . 3 ⊢ (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)} ↦ inf(ran (𝑛 ∈ 𝑍 ↦ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)), ℝ, < )) = (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)} ↦ inf(ran (𝑛 ∈ 𝑍 ↦ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)), ℝ, < ))
75	66, 68, 69, 70, 71, 72, 73, 74	smfinf 46930	. 2 ⊢ (𝜑 → (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom ((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)} ↦ inf(ran (𝑛 ∈ 𝑍 ↦ (((𝑛 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑛)‘𝑥)), ℝ, < )) ∈ (SMblFn‘𝑆))
76	65, 75	eqeltrd 2833	1 ⊢ (𝜑 → 𝐺 ∈ (SMblFn‘𝑆))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541  Ⅎwnf 1784   ∈ wcel 2113  ∀wral 3049  ∃wrex 3058  {crab 3397  ∩ ciin 4944   class class class wbr 5095   ↦ cmpt 5176  dom cdm 5621  ran crn 5622  ‘cfv 6489  infcinf 9335  ℝcr 11015   < clt 11156   ≤ cle 11157  ℤcz 12478  ℤ_≥cuz 12742  SAlgcsalg 46420  SMblFncsmblfn 46807

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677  ax-inf2 9541  ax-cc 10336  ax-ac2 10364  ax-cnex 11072  ax-resscn 11073  ax-1cn 11074  ax-icn 11075  ax-addcl 11076  ax-addrcl 11077  ax-mulcl 11078  ax-mulrcl 11079  ax-mulcom 11080  ax-addass 11081  ax-mulass 11082  ax-distr 11083  ax-i2m1 11084  ax-1ne0 11085  ax-1rid 11086  ax-rnegex 11087  ax-rrecex 11088  ax-cnre 11089  ax-pre-lttri 11090  ax-pre-lttrn 11091  ax-pre-ltadd 11092  ax-pre-mulgt0 11093  ax-pre-sup 11094

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2883  df-ne 2931  df-nel 3035  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-int 4900  df-iun 4945  df-iin 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-se 5575  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-isom 6498  df-riota 7312  df-ov 7358  df-oprab 7359  df-mpo 7360  df-om 7806  df-1st 7930  df-2nd 7931  df-frecs 8220  df-wrecs 8251  df-recs 8300  df-rdg 8338  df-1o 8394  df-2o 8395  df-oadd 8398  df-omul 8399  df-er 8631  df-map 8761  df-pm 8762  df-en 8879  df-dom 8880  df-sdom 8881  df-fin 8882  df-sup 9336  df-inf 9337  df-oi 9406  df-card 9842  df-acn 9845  df-ac 10017  df-pnf 11158  df-mnf 11159  df-xr 11160  df-ltxr 11161  df-le 11162  df-sub 11356  df-neg 11357  df-div 11785  df-nn 12136  df-2 12198  df-3 12199  df-4 12200  df-n0 12392  df-z 12479  df-uz 12743  df-q 12857  df-rp 12901  df-ioo 13259  df-ioc 13260  df-ico 13261  df-icc 13262  df-fz 13418  df-fzo 13565  df-fl 13706  df-seq 13919  df-exp 13979  df-hash 14248  df-word 14431  df-concat 14488  df-s1 14514  df-s2 14765  df-s3 14766  df-s4 14767  df-cj 15016  df-re 15017  df-im 15018  df-sqrt 15152  df-abs 15153  df-rest 17336  df-topgen 17357  df-top 22819  df-bases 22871  df-salg 46421  df-salgen 46425  df-smblfn 46808

This theorem is referenced by: (None)