Theorem issmfgt 47184

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 47161	. . . . 5 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → 𝐷 ⊆ ∪ 𝑆)
6	2, 3, 4	smff 47160	. . . . 5 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → 𝐹:𝐷⟶ℝ)
7		nfv 1916	. . . . . . 7 ⊢ Ⅎ𝑏𝜑
8		nfv 1916	. . . . . . 7 ⊢ Ⅎ𝑏 𝐹 ∈ (SMblFn‘𝑆)
9	7, 8	nfan 1901	. . . . . 6 ⊢ Ⅎ𝑏(𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆))
10	2, 5	restuni4 45551	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → ∪ (𝑆 ↾t 𝐷) = 𝐷)
11	10	eqcomd 2742	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → 𝐷 = ∪ (𝑆 ↾t 𝐷))
12	11	rabeqdv 3404	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} = {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ 𝑏 < (𝐹‘𝑦)})
13	12	adantr 480	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} = {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ 𝑏 < (𝐹‘𝑦)})
14		nfv 1916	. . . . . . . . . . 11 ⊢ Ⅎ𝑦𝜑
15		nfv 1916	. . . . . . . . . . 11 ⊢ Ⅎ𝑦 𝐹 ∈ (SMblFn‘𝑆)
16	14, 15	nfan 1901	. . . . . . . . . 10 ⊢ Ⅎ𝑦(𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆))
17		nfv 1916	. . . . . . . . . 10 ⊢ Ⅎ𝑦 𝑏 ∈ ℝ
18	16, 17	nfan 1901	. . . . . . . . 9 ⊢ Ⅎ𝑦((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ)
19		nfv 1916	. . . . . . . . 9 ⊢ Ⅎ𝑐((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ)
20	1	uniexd 7696	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∪ 𝑆 ∈ V)
21	20	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → ∪ 𝑆 ∈ V)
22		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → 𝐷 ⊆ ∪ 𝑆)
23	21, 22	ssexd 5265	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐷 ⊆ ∪ 𝑆) → 𝐷 ∈ V)
24	5, 23	syldan 592	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → 𝐷 ∈ V)
25		eqid 2736	. . . . . . . . . . 11 ⊢ (𝑆 ↾t 𝐷) = (𝑆 ↾t 𝐷)
26	2, 24, 25	subsalsal 46787	. . . . . . . . . 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 7037	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑦 ∈ ∪ (𝑆 ↾t 𝐷)) → (𝐹‘𝑦) ∈ ℝ)
34	33	rexrd 11195	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑦 ∈ ∪ (𝑆 ↾t 𝐷)) → (𝐹‘𝑦) ∈ ℝ*)
35	34	adantlr 716	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) ∧ 𝑦 ∈ ∪ (𝑆 ↾t 𝐷)) → (𝐹‘𝑦) ∈ ℝ*)
36	2, 4	issmfle 47173	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑐 ∈ ℝ {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))))
37	3, 36	mpbid 232	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑐 ∈ ℝ {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷)))
38	37	simp3d 1145	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → ∀𝑐 ∈ ℝ {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))
39	10	rabeqdv 3404	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} = {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐})
40	39	eleq1d 2821	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → ({𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷) ↔ {𝑦 ∈ 𝐷 ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷)))
41	40	ralbidv 3160	. . . . . . . . . . . . 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 3226	. . . . . . . . . . 11 ⊢ ((∀𝑐 ∈ ℝ {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷) ∧ 𝑐 ∈ ℝ) → {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))
46	43, 44, 45	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑐 ∈ ℝ) → {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))
47	46	adantlr 716	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) ∧ 𝑐 ∈ ℝ) → {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ (𝐹‘𝑦) ≤ 𝑐} ∈ (𝑆 ↾t 𝐷))
48		simpr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) → 𝑏 ∈ ℝ)
49	18, 19, 27, 28, 35, 47, 48	salpreimalegt 47137	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) → {𝑦 ∈ ∪ (𝑆 ↾t 𝐷) ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
50	13, 49	eqeltrd 2836	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) ∧ 𝑏 ∈ ℝ) → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
51	50	ex 412	. . . . . 6 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → (𝑏 ∈ ℝ → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)))
52	9, 51	ralrimi 3235	. . . . 5 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
53	5, 6, 52	3jca 1129	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (SMblFn‘𝑆)) → (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)))
54	53	ex 412	. . 3 ⊢ (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) → (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))))
55		nfv 1916	. . . . . . 7 ⊢ Ⅎ𝑦 𝐷 ⊆ ∪ 𝑆
56		nfv 1916	. . . . . . 7 ⊢ Ⅎ𝑦 𝐹:𝐷⟶ℝ
57		nfcv 2898	. . . . . . . 8 ⊢ Ⅎ𝑦ℝ
58		nfrab1 3409	. . . . . . . . 9 ⊢ Ⅎ𝑦{𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)}
59		nfcv 2898	. . . . . . . . 9 ⊢ Ⅎ𝑦(𝑆 ↾t 𝐷)
60	58, 59	nfel 2913	. . . . . . . 8 ⊢ Ⅎ𝑦{𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)
61	57, 60	nfralw 3284	. . . . . . 7 ⊢ Ⅎ𝑦∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)
62	55, 56, 61	nf3an 1903	. . . . . 6 ⊢ Ⅎ𝑦(𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
63	14, 62	nfan 1901	. . . . 5 ⊢ Ⅎ𝑦(𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)))
64		nfv 1916	. . . . . . 7 ⊢ Ⅎ𝑏 𝐷 ⊆ ∪ 𝑆
65		nfv 1916	. . . . . . 7 ⊢ Ⅎ𝑏 𝐹:𝐷⟶ℝ
66		nfra1 3261	. . . . . . 7 ⊢ Ⅎ𝑏∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)
67	64, 65, 66	nf3an 1903	. . . . . 6 ⊢ Ⅎ𝑏(𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
68	7, 67	nfan 1901	. . . . 5 ⊢ Ⅎ𝑏(𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)))
69	1	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))) → 𝑆 ∈ SAlg)
70		simpr1 1196	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))) → 𝐷 ⊆ ∪ 𝑆)
71		simpr2 1197	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))) → 𝐹:𝐷⟶ℝ)
72		simpr3 1198	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))) → ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))
73	63, 68, 69, 4, 70, 71, 72	issmfgtlem 47183	. . . 4 ⊢ ((𝜑 ∧ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))) → 𝐹 ∈ (SMblFn‘𝑆))
74	73	ex 412	. . 3 ⊢ (𝜑 → ((𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷)) → 𝐹 ∈ (SMblFn‘𝑆)))
75	54, 74	impbid 212	. 2 ⊢ (𝜑 → (𝐹 ∈ (SMblFn‘𝑆) ↔ (𝐷 ⊆ ∪ 𝑆 ∧ 𝐹:𝐷⟶ℝ ∧ ∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷))))
76		breq1 5088	. . . . . . . 8 ⊢ (𝑏 = 𝑎 → (𝑏 < (𝐹‘𝑦) ↔ 𝑎 < (𝐹‘𝑦)))
77	76	rabbidv 3396	. . . . . . 7 ⊢ (𝑏 = 𝑎 → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} = {𝑦 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑦)})
78		fveq2 6840	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → (𝐹‘𝑦) = (𝐹‘𝑥))
79	78	breq2d 5097	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → (𝑎 < (𝐹‘𝑦) ↔ 𝑎 < (𝐹‘𝑥)))
80	79	cbvrabv 3399	. . . . . . . 8 ⊢ {𝑦 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑦)} = {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)}
81	80	a1i 11	. . . . . . 7 ⊢ (𝑏 = 𝑎 → {𝑦 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑦)} = {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)})
82	77, 81	eqtrd 2771	. . . . . 6 ⊢ (𝑏 = 𝑎 → {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} = {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)})
83	82	eleq1d 2821	. . . . 5 ⊢ (𝑏 = 𝑎 → ({𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷) ↔ {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)} ∈ (𝑆 ↾t 𝐷)))
84	83	cbvralvw 3215	. . . 4 ⊢ (∀𝑏 ∈ ℝ {𝑦 ∈ 𝐷 ∣ 𝑏 < (𝐹‘𝑦)} ∈ (𝑆 ↾t 𝐷) ↔ ∀𝑎 ∈ ℝ {𝑥 ∈ 𝐷 ∣ 𝑎 < (𝐹‘𝑥)} ∈ (𝑆 ↾t 𝐷))
85	84	3anbi3i 1160	. . 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 1542   ∈ wcel 2114  ∀wral 3051  {crab 3389  Vcvv 3429   ⊆ wss 3889  ∪ cuni 4850   class class class wbr 5085  dom cdm 5631  ⟶wf 6494  ‘cfv 6498  (class class class)co 7367  ℝcr 11037  ℝ^*cxr 11178   < clt 11179   ≤ cle 11180   ↾_t crest 17383  SAlgcsalg 46736  SMblFncsmblfn 47123

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-inf2 9562  ax-cc 10357  ax-ac2 10385  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115  ax-pre-sup 11116

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  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 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-iin 4936  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-isom 6507  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-er 8643  df-map 8775  df-pm 8776  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897  df-sup 9355  df-inf 9356  df-card 9863  df-acn 9866  df-ac 10038  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-div 11808  df-nn 12175  df-n0 12438  df-z 12525  df-uz 12789  df-q 12899  df-rp 12943  df-ioo 13302  df-ico 13304  df-fl 13751  df-rest 17385  df-salg 46737  df-smblfn 47124

This theorem is referenced by:  issmfgtd  47189  smfpreimagt  47190