Theorem issmfgt 47021

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 46998	. . . . 5 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → 𝐷 ⊆ ∪ 𝑆)
6	2, 3, 4	smff 46997	. . . . 5 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → 𝐹:𝐷⟶ℝ)
7		nfv 1915	. . . . . . 7 ⊢ Ⅎ𝑏𝜑
8		nfv 1915	. . . . . . 7 ⊢ Ⅎ𝑏 𝐹 ∈ (SMblFn‘𝑆)
9	7, 8	nfan 1900	. . . . . 6 ⊢ Ⅎ𝑏(𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆))
10	2, 5	restuni4 45386	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → ∪ (𝑆 ↾t 𝐷) = 𝐷)
11	10	eqcomd 2742	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → 𝐷 = ∪ (𝑆 ↾t 𝐷))
12	11	rabeqdv 3414	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} = {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ 𝑏 < (𝐹‘𝑦)})
13	12	adantr 480	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} = {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ 𝑏 < (𝐹‘𝑦)})
14		nfv 1915	. . . . . . . . . . 11 ⊢ Ⅎ𝑦𝜑
15		nfv 1915	. . . . . . . . . . 11 ⊢ Ⅎ𝑦 𝐹 ∈ (SMblFn‘𝑆)
16	14, 15	nfan 1900	. . . . . . . . . 10 ⊢ Ⅎ𝑦(𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆))
17		nfv 1915	. . . . . . . . . 10 ⊢ Ⅎ𝑦 𝑏 ∈ ℝ
18	16, 17	nfan 1900	. . . . . . . . 9 ⊢ Ⅎ𝑦((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ)
19		nfv 1915	. . . . . . . . 9 ⊢ Ⅎ𝑐((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ)
20	1	uniexd 7687	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∪ 𝑆 ∈ V)
21	20	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → ∪ 𝑆 ∈ V)
22		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → 𝐷 ⊆ ∪ 𝑆)
23	21, 22	ssexd 5269	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → 𝐷 ∈ V)
24	5, 23	syldan 591	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → 𝐷 ∈ V)
25		eqid 2736	. . . . . . . . . . 11 ⊢ (𝑆 ↾t 𝐷) = (𝑆 ↾t 𝐷)
26	2, 24, 25	subsalsal 46624	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → (𝑆 ↾t 𝐷) ∈ SAlg)
27	26	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) → (𝑆 ↾t 𝐷) ∈ SAlg)
28		eqid 2736	. . . . . . . . 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 2838	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑦 ∈ ∪ (𝑆 ↾t 𝐷)) → 𝑦 ∈ 𝐷)
33	29, 32	ffvelcdmd 7030	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑦 ∈ ∪ (𝑆 ↾t 𝐷)) → (𝐹‘𝑦) ∈ ℝ)
34	33	rexrd 11184	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑦 ∈ ∪ (𝑆 ↾t 𝐷)) → (𝐹‘𝑦) ∈ ℝ*)
35	34	adantlr 715	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) ∧ 𝑦 ∈ ∪ (𝑆 ↾t 𝐷)) → (𝐹‘𝑦) ∈ ℝ*)
36	2, 4	issmfle 47010	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑐 ∈ ℝ {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))))
37	3, 36	mpbid 232	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑐 ∈ ℝ {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷)))
38	37	simp3d 1144	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → ∀𝑐 ∈ ℝ {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))
39	10	rabeqdv 3414	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} = {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐})
40	39	eleq1d 2821	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → ({𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷) ↔ {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷)))
41	40	ralbidv 3159	. . . . . . . . . . . . 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 3225	. . . . . . . . . . 11 ⊢ ((∀𝑐 ∈ ℝ {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷) ∧ 𝑐 ∈ ℝ) → {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))
46	43, 44, 45	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑐 ∈ ℝ) → {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))
47	46	adantlr 715	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) ∧ 𝑐 ∈ ℝ) → {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))
48		simpr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) → 𝑏 ∈ ℝ)
49	18, 19, 27, 28, 35, 47, 48	salpreimalegt 46974	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) → {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
50	13, 49	eqeltrd 2836	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
51	50	ex 412	. . . . . 6 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → (𝑏 ∈ ℝ → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)))
52	9, 51	ralrimi 3234	. . . . 5 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
53	5, 6, 52	3jca 1128	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)))
54	53	ex 412	. . 3 ⊢ (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) → (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))))
55		nfv 1915	. . . . . . 7 ⊢ Ⅎ𝑦 𝐷 ⊆ ∪ 𝑆
56		nfv 1915	. . . . . . 7 ⊢ Ⅎ𝑦 𝐹:𝐷⟶ℝ
57		nfcv 2898	. . . . . . . 8 ⊢ Ⅎ𝑦ℝ
58		nfrab1 3419	. . . . . . . . 9 ⊢ Ⅎ𝑦{𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)}
59		nfcv 2898	. . . . . . . . 9 ⊢ Ⅎ𝑦(𝑆 ↾t 𝐷)
60	58, 59	nfel 2913	. . . . . . . 8 ⊢ Ⅎ𝑦{𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)
61	57, 60	nfralw 3283	. . . . . . 7 ⊢ Ⅎ𝑦∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)
62	55, 56, 61	nf3an 1902	. . . . . 6 ⊢ Ⅎ𝑦(𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
63	14, 62	nfan 1900	. . . . 5 ⊢ Ⅎ𝑦(𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)))
64		nfv 1915	. . . . . . 7 ⊢ Ⅎ𝑏 𝐷 ⊆ ∪ 𝑆
65		nfv 1915	. . . . . . 7 ⊢ Ⅎ𝑏 𝐹:𝐷⟶ℝ
66		nfra1 3260	. . . . . . 7 ⊢ Ⅎ𝑏∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)
67	64, 65, 66	nf3an 1902	. . . . . 6 ⊢ Ⅎ𝑏(𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
68	7, 67	nfan 1900	. . . . 5 ⊢ Ⅎ𝑏(𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)))
69	1	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))) → 𝑆 ∈ SAlg)
70		simpr1 1195	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))) → 𝐷 ⊆ ∪ 𝑆)
71		simpr2 1196	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))) → 𝐹:𝐷⟶ℝ)
72		simpr3 1197	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))) → ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
73	63, 68, 69, 4, 70, 71, 72	issmfgtlem 47020	. . . 4 ⊢ ((𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))) → 𝐹 ∈ (SMblFn‘𝑆))
74	73	ex 412	. . 3 ⊢ (𝜑 → ((𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)) → 𝐹 ∈ (SMblFn‘𝑆)))
75	54, 74	impbid 212	. 2 ⊢ (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))))
76		breq1 5101	. . . . . . . 8 ⊢ (𝑏 = 𝑎 → (𝑏 < (𝐹‘𝑦) ↔ 𝑎 < (𝐹‘𝑦)))
77	76	rabbidv 3406	. . . . . . 7 ⊢ (𝑏 = 𝑎 → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} = {𝑦 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑦)})
78		fveq2 6834	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → (𝐹‘𝑦) = (𝐹‘𝑥))
79	78	breq2d 5110	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → (𝑎 < (𝐹‘𝑦) ↔ 𝑎 < (𝐹‘𝑥)))
80	79	cbvrabv 3409	. . . . . . . 8 ⊢ {𝑦 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑦)} = {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)}
81	80	a1i 11	. . . . . . 7 ⊢ (𝑏 = 𝑎 → {𝑦 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑦)} = {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)})
82	77, 81	eqtrd 2771	. . . . . 6 ⊢ (𝑏 = 𝑎 → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} = {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)})
83	82	eleq1d 2821	. . . . 5 ⊢ (𝑏 = 𝑎 → ({𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷) ↔ {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)} ∈ (𝑆 ↾t 𝐷)))
84	83	cbvralvw 3214	. . . 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 1086   = wceq 1541   ∈ wcel 2113  ∀wral 3051  {crab 3399  Vcvv 3440   ⊆ wss 3901  ∪ cuni 4863   class class class wbr 5098  dom cdm 5624  ⟶wf 6488  ‘cfv 6492  (class class class)co 7358  ℝcr 11027  ℝ^*cxr 11167   < clt 11168   ≤ cle 11169   ↾_t crest 17342  SAlgcsalg 46573  SMblFncsmblfn 46960

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 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-inf2 9552  ax-cc 10347  ax-ac2 10375  ax-cnex 11084  ax-resscn 11085  ax-1cn 11086  ax-icn 11087  ax-addcl 11088  ax-addrcl 11089  ax-mulcl 11090  ax-mulrcl 11091  ax-mulcom 11092  ax-addass 11093  ax-mulass 11094  ax-distr 11095  ax-i2m1 11096  ax-1ne0 11097  ax-1rid 11098  ax-rnegex 11099  ax-rrecex 11100  ax-cnre 11101  ax-pre-lttri 11102  ax-pre-lttrn 11103  ax-pre-ltadd 11104  ax-pre-mulgt0 11105  ax-pre-sup 11106

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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-iin 4949  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-isom 6501  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-1o 8397  df-er 8635  df-map 8767  df-pm 8768  df-en 8886  df-dom 8887  df-sdom 8888  df-fin 8889  df-sup 9347  df-inf 9348  df-card 9853  df-acn 9856  df-ac 10028  df-pnf 11170  df-mnf 11171  df-xr 11172  df-ltxr 11173  df-le 11174  df-sub 11368  df-neg 11369  df-div 11797  df-nn 12148  df-n0 12404  df-z 12491  df-uz 12754  df-q 12864  df-rp 12908  df-ioo 13267  df-ico 13269  df-fl 13714  df-rest 17344  df-salg 46574  df-smblfn 46961

This theorem is referenced by:  issmfgtd  47026  smfpreimagt  47027