Theorem issmfgt 46677

Description: The predicate "𝐹 is a real-valued measurable function w.r.t. to the sigma-algebra 𝑆". A function is measurable iff the preimages of all left-open intervals unbounded above are in the subspace sigma-algebra induced by its domain. The domain of 𝐹 is required to be b subset of the underlying set of 𝑆. Definition 121C of [Fremlin1] p. 36, and Proposition 121B (iii) of [Fremlin1] p. 35 . (Contributed by Glauco Siliprandi, 26-Jun-2021.)

Hypotheses

Ref	Expression
issmfgt.s	⊢ (𝜑 → 𝑆 ∈ SAlg)
issmfgt.d	⊢ 𝐷 = dom 𝐹

Assertion

Ref	Expression
issmfgt	⊢ (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)} ∈ (𝑆 ↾t 𝐷))))

Distinct variable groups:   𝐷,𝑎,𝑥   𝐹,𝑎,𝑥   𝑆,𝑎

Allowed substitution hints:   𝜑(𝑥,𝑎)   𝑆(𝑥)

Proof of Theorem issmfgt

Dummy variables 𝑏 𝑦 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		issmfgt.s	. . . . . . 7 ⊢ (𝜑 → 𝑆 ∈ SAlg)
2	1	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → 𝑆 ∈ SAlg)
3		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → 𝐹 ∈ (SMblFn‘𝑆))
4		issmfgt.d	. . . . . 6 ⊢ 𝐷 = dom 𝐹
5	2, 3, 4	smfdmss 46654	. . . . 5 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → 𝐷 ⊆ ∪ 𝑆)
6	2, 3, 4	smff 46653	. . . . 5 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → 𝐹:𝐷⟶ℝ)
7		nfv 1913	. . . . . . 7 ⊢ Ⅎ𝑏𝜑
8		nfv 1913	. . . . . . 7 ⊢ Ⅎ𝑏 𝐹 ∈ (SMblFn‘𝑆)
9	7, 8	nfan 1898	. . . . . 6 ⊢ Ⅎ𝑏(𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆))
10	2, 5	restuni4 45023	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → ∪ (𝑆 ↾t 𝐷) = 𝐷)
11	10	eqcomd 2746	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → 𝐷 = ∪ (𝑆 ↾t 𝐷))
12	11	rabeqdv 3459	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} = {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ 𝑏 < (𝐹‘𝑦)})
13	12	adantr 480	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} = {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ 𝑏 < (𝐹‘𝑦)})
14		nfv 1913	. . . . . . . . . . 11 ⊢ Ⅎ𝑦𝜑
15		nfv 1913	. . . . . . . . . . 11 ⊢ Ⅎ𝑦 𝐹 ∈ (SMblFn‘𝑆)
16	14, 15	nfan 1898	. . . . . . . . . 10 ⊢ Ⅎ𝑦(𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆))
17		nfv 1913	. . . . . . . . . 10 ⊢ Ⅎ𝑦 𝑏 ∈ ℝ
18	16, 17	nfan 1898	. . . . . . . . 9 ⊢ Ⅎ𝑦((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ)
19		nfv 1913	. . . . . . . . 9 ⊢ Ⅎ𝑐((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ)
20	1	uniexd 7777	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∪ 𝑆 ∈ V)
21	20	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → ∪ 𝑆 ∈ V)
22		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → 𝐷 ⊆ ∪ 𝑆)
23	21, 22	ssexd 5342	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → 𝐷 ∈ V)
24	5, 23	syldan 590	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → 𝐷 ∈ V)
25		eqid 2740	. . . . . . . . . . 11 ⊢ (𝑆 ↾t 𝐷) = (𝑆 ↾t 𝐷)
26	2, 24, 25	subsalsal 46280	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → (𝑆 ↾t 𝐷) ∈ SAlg)
27	26	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) → (𝑆 ↾t 𝐷) ∈ SAlg)
28		eqid 2740	. . . . . . . . 9 ⊢ ∪ (𝑆 ↾t 𝐷) = ∪ (𝑆 ↾t 𝐷)
29	6	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑦 ∈ ∪ (𝑆 ↾t 𝐷)) → 𝐹:𝐷⟶ℝ)
30		simpr 484	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑦 ∈ ∪ (𝑆 ↾t 𝐷)) → 𝑦 ∈ ∪ (𝑆 ↾t 𝐷))
31	10	adantr 480	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑦 ∈ ∪ (𝑆 ↾t 𝐷)) → ∪ (𝑆 ↾t 𝐷) = 𝐷)
32	30, 31	eleqtrd 2846	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑦 ∈ ∪ (𝑆 ↾t 𝐷)) → 𝑦 ∈ 𝐷)
33	29, 32	ffvelcdmd 7119	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑦 ∈ ∪ (𝑆 ↾t 𝐷)) → (𝐹‘𝑦) ∈ ℝ)
34	33	rexrd 11340	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑦 ∈ ∪ (𝑆 ↾t 𝐷)) → (𝐹‘𝑦) ∈ ℝ*)
35	34	adantlr 714	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) ∧ 𝑦 ∈ ∪ (𝑆 ↾t 𝐷)) → (𝐹‘𝑦) ∈ ℝ*)
36	2, 4	issmfle 46666	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑐 ∈ ℝ {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))))
37	3, 36	mpbid 232	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑐 ∈ ℝ {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷)))
38	37	simp3d 1144	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → ∀𝑐 ∈ ℝ {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))
39	10	rabeqdv 3459	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} = {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐})
40	39	eleq1d 2829	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → ({𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷) ↔ {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷)))
41	40	ralbidv 3184	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → (∀𝑐 ∈ ℝ {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷) ↔ ∀𝑐 ∈ ℝ {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷)))
42	38, 41	mpbird 257	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → ∀𝑐 ∈ ℝ {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))
43	42	adantr 480	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑐 ∈ ℝ) → ∀𝑐 ∈ ℝ {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))
44		simpr 484	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑐 ∈ ℝ) → 𝑐 ∈ ℝ)
45		rspa 3254	. . . . . . . . . . 11 ⊢ ((∀𝑐 ∈ ℝ {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷) ∧ 𝑐 ∈ ℝ) → {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))
46	43, 44, 45	syl2anc 583	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑐 ∈ ℝ) → {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))
47	46	adantlr 714	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) ∧ 𝑐 ∈ ℝ) → {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))
48		simpr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) → 𝑏 ∈ ℝ)
49	18, 19, 27, 28, 35, 47, 48	salpreimalegt 46630	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) → {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
50	13, 49	eqeltrd 2844	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
51	50	ex 412	. . . . . 6 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → (𝑏 ∈ ℝ → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)))
52	9, 51	ralrimi 3263	. . . . 5 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
53	5, 6, 52	3jca 1128	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)))
54	53	ex 412	. . 3 ⊢ (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) → (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))))
55		nfv 1913	. . . . . . 7 ⊢ Ⅎ𝑦 𝐷 ⊆ ∪ 𝑆
56		nfv 1913	. . . . . . 7 ⊢ Ⅎ𝑦 𝐹:𝐷⟶ℝ
57		nfcv 2908	. . . . . . . 8 ⊢ Ⅎ𝑦ℝ
58		nfrab1 3464	. . . . . . . . 9 ⊢ Ⅎ𝑦{𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)}
59		nfcv 2908	. . . . . . . . 9 ⊢ Ⅎ𝑦(𝑆 ↾t 𝐷)
60	58, 59	nfel 2923	. . . . . . . 8 ⊢ Ⅎ𝑦{𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)
61	57, 60	nfralw 3317	. . . . . . 7 ⊢ Ⅎ𝑦∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)
62	55, 56, 61	nf3an 1900	. . . . . 6 ⊢ Ⅎ𝑦(𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
63	14, 62	nfan 1898	. . . . 5 ⊢ Ⅎ𝑦(𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)))
64		nfv 1913	. . . . . . 7 ⊢ Ⅎ𝑏 𝐷 ⊆ ∪ 𝑆
65		nfv 1913	. . . . . . 7 ⊢ Ⅎ𝑏 𝐹:𝐷⟶ℝ
66		nfra1 3290	. . . . . . 7 ⊢ Ⅎ𝑏∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)
67	64, 65, 66	nf3an 1900	. . . . . 6 ⊢ Ⅎ𝑏(𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
68	7, 67	nfan 1898	. . . . 5 ⊢ Ⅎ𝑏(𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)))
69	1	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))) → 𝑆 ∈ SAlg)
70		simpr1 1194	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))) → 𝐷 ⊆ ∪ 𝑆)
71		simpr2 1195	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))) → 𝐹:𝐷⟶ℝ)
72		simpr3 1196	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))) → ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
73	63, 68, 69, 4, 70, 71, 72	issmfgtlem 46676	. . . 4 ⊢ ((𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))) → 𝐹 ∈ (SMblFn‘𝑆))
74	73	ex 412	. . 3 ⊢ (𝜑 → ((𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)) → 𝐹 ∈ (SMblFn‘𝑆)))
75	54, 74	impbid 212	. 2 ⊢ (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))))
76		breq1 5169	. . . . . . . 8 ⊢ (𝑏 = 𝑎 → (𝑏 < (𝐹‘𝑦) ↔ 𝑎 < (𝐹‘𝑦)))
77	76	rabbidv 3451	. . . . . . 7 ⊢ (𝑏 = 𝑎 → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} = {𝑦 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑦)})
78		fveq2 6920	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → (𝐹‘𝑦) = (𝐹‘𝑥))
79	78	breq2d 5178	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → (𝑎 < (𝐹‘𝑦) ↔ 𝑎 < (𝐹‘𝑥)))
80	79	cbvrabv 3454	. . . . . . . 8 ⊢ {𝑦 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑦)} = {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)}
81	80	a1i 11	. . . . . . 7 ⊢ (𝑏 = 𝑎 → {𝑦 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑦)} = {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)})
82	77, 81	eqtrd 2780	. . . . . 6 ⊢ (𝑏 = 𝑎 → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} = {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)})
83	82	eleq1d 2829	. . . . 5 ⊢ (𝑏 = 𝑎 → ({𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷) ↔ {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)} ∈ (𝑆 ↾t 𝐷)))
84	83	cbvralvw 3243	. . . 4 ⊢ (∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷) ↔ ∀𝑎 ∈ ℝ {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)} ∈ (𝑆 ↾t 𝐷))
85	84	3anbi3i 1159	. . 3 ⊢ ((𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)) ↔ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)} ∈ (𝑆 ↾t 𝐷)))
86	85	a1i 11	. 2 ⊢ (𝜑 → ((𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)) ↔ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)} ∈ (𝑆 ↾t 𝐷))))
87	75, 86	bitrd 279	1 ⊢ (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑎 ∈ ℝ {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)} ∈ (𝑆 ↾t 𝐷))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108  ∀wral 3067  {crab 3443  Vcvv 3488   ⊆ wss 3976  ∪ cuni 4931   class class class wbr 5166  dom cdm 5700  ⟶wf 6569  ‘cfv 6573  (class class class)co 7448  ℝcr 11183  ℝ^*cxr 11323   < clt 11324   ≤ cle 11325   ↾_t crest 17480  SAlgcsalg 46229  SMblFncsmblfn 46616

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-inf2 9710  ax-cc 10504  ax-ac2 10532  ax-cnex 11240  ax-resscn 11241  ax-1cn 11242  ax-icn 11243  ax-addcl 11244  ax-addrcl 11245  ax-mulcl 11246  ax-mulrcl 11247  ax-mulcom 11248  ax-addass 11249  ax-mulass 11250  ax-distr 11251  ax-i2m1 11252  ax-1ne0 11253  ax-1rid 11254  ax-rnegex 11255  ax-rrecex 11256  ax-cnre 11257  ax-pre-lttri 11258  ax-pre-lttrn 11259  ax-pre-ltadd 11260  ax-pre-mulgt0 11261  ax-pre-sup 11262

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-iun 5017  df-iin 5018  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-se 5653  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-isom 6582  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-1st 8030  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-1o 8522  df-er 8763  df-map 8886  df-pm 8887  df-en 9004  df-dom 9005  df-sdom 9006  df-fin 9007  df-sup 9511  df-inf 9512  df-card 10008  df-acn 10011  df-ac 10185  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11522  df-neg 11523  df-div 11948  df-nn 12294  df-n0 12554  df-z 12640  df-uz 12904  df-q 13014  df-rp 13058  df-ioo 13411  df-ico 13413  df-fl 13843  df-rest 17482  df-salg 46230  df-smblfn 46617

This theorem is referenced by:  issmfgtd  46682  smfpreimagt  46683