ftc2ditglem - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ftc2ditglem		Structured version Visualization version GIF version

Theorem ftc2ditglem 26101

Description: Lemma for ftc2ditg 26102. (Contributed by Mario Carneiro, 3-Sep-2014.)

**Hypotheses**
Ref	Expression
ftc2ditg.x	⊢ (𝜑 → 𝑋 ∈ ℝ)
ftc2ditg.y	⊢ (𝜑 → 𝑌 ∈ ℝ)
ftc2ditg.a	⊢ (𝜑 → 𝐴 ∈ (𝑋[,]𝑌))
ftc2ditg.b	⊢ (𝜑 → 𝐵 ∈ (𝑋[,]𝑌))
ftc2ditg.c	⊢ (𝜑 → (ℝ D 𝐹) ∈ ((𝑋(,)𝑌)–cn→ℂ))
ftc2ditg.i	⊢ (𝜑 → (ℝ D 𝐹) ∈ 𝐿¹)
ftc2ditg.f	⊢ (𝜑 → 𝐹 ∈ ((𝑋[,]𝑌)–cn→ℂ))

**Assertion**
Ref	Expression
ftc2ditglem	⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ⨜[𝐴 → 𝐵]((ℝ D 𝐹)‘𝑡) d𝑡 = ((𝐹‘𝐵) − (𝐹‘𝐴)))

Distinct variable groups: 𝑡,𝐴 𝑡,𝐵 𝑡,𝐹 𝜑,𝑡 𝑡,𝑋 𝑡,𝑌

**Proof of Theorem ftc2ditglem**
Step	Hyp	Ref	Expression
1		simpr 484	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ 𝐵)
2	1	ditgpos 25906	. 2 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ⨜[𝐴 → 𝐵]((ℝ D 𝐹)‘𝑡) d𝑡 = ∫(𝐴(,)𝐵)((ℝ D 𝐹)‘𝑡) d𝑡)
3		ftc2ditg.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ ℝ)
4		ftc2ditg.y	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ ℝ)
5		iccssre 13466	. . . . . . 7 ⊢ ((𝑋 ∈ ℝ ∧ 𝑌 ∈ ℝ) → (𝑋[,]𝑌) ⊆ ℝ)
6	3, 4, 5	syl2anc 584	. . . . . 6 ⊢ (𝜑 → (𝑋[,]𝑌) ⊆ ℝ)
7		ftc2ditg.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (𝑋[,]𝑌))
8	6, 7	sseldd 3996	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ)
9	8	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ ℝ)
10		ftc2ditg.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ (𝑋[,]𝑌))
11	6, 10	sseldd 3996	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ)
12	11	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ)
13		ax-resscn 11210	. . . . . . . 8 ⊢ ℝ ⊆ ℂ
14	13	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ℝ ⊆ ℂ)
15		ftc2ditg.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ ((𝑋[,]𝑌)–cn→ℂ))
16		cncff 24933	. . . . . . . . 9 ⊢ (𝐹 ∈ ((𝑋[,]𝑌)–cn→ℂ) → 𝐹:(𝑋[,]𝑌)⟶ℂ)
17	15, 16	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐹:(𝑋[,]𝑌)⟶ℂ)
18	17	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐹:(𝑋[,]𝑌)⟶ℂ)
19	6	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝑋[,]𝑌) ⊆ ℝ)
20		iccssre 13466	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
21	8, 11, 20	syl2anc 584	. . . . . . . 8 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ)
22	21	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝐴[,]𝐵) ⊆ ℝ)
23		eqid 2735	. . . . . . . 8 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
24	23	tgioo2 24839	. . . . . . . 8 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
25	23, 24	dvres 25961	. . . . . . 7 ⊢ (((ℝ ⊆ ℂ ∧ 𝐹:(𝑋[,]𝑌)⟶ℂ) ∧ ((𝑋[,]𝑌) ⊆ ℝ ∧ (𝐴[,]𝐵) ⊆ ℝ)) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) = ((ℝ D 𝐹) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))))
26	14, 18, 19, 22, 25	syl22anc 839	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) = ((ℝ D 𝐹) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))))
27		iccntr 24857	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵))
28	8, 11, 27	syl2anc 584	. . . . . . . 8 ⊢ (𝜑 → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵))
29	28	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵))
30	29	reseq2d 6000	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D 𝐹) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))) = ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)))
31	26, 30	eqtrd 2775	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) = ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)))
32	3	rexrd 11309	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ ℝ^*)
33		elicc2 13449	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ ℝ ∧ 𝑌 ∈ ℝ) → (𝐴 ∈ (𝑋[,]𝑌) ↔ (𝐴 ∈ ℝ ∧ 𝑋 ≤ 𝐴 ∧ 𝐴 ≤ 𝑌)))
34	3, 4, 33	syl2anc 584	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 ∈ (𝑋[,]𝑌) ↔ (𝐴 ∈ ℝ ∧ 𝑋 ≤ 𝐴 ∧ 𝐴 ≤ 𝑌)))
35	7, 34	mpbid 232	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 ∈ ℝ ∧ 𝑋 ≤ 𝐴 ∧ 𝐴 ≤ 𝑌))
36	35	simp2d 1142	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ≤ 𝐴)
37		iooss1 13419	. . . . . . . . 9 ⊢ ((𝑋 ∈ ℝ^* ∧ 𝑋 ≤ 𝐴) → (𝐴(,)𝐵) ⊆ (𝑋(,)𝐵))
38	32, 36, 37	syl2anc 584	. . . . . . . 8 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ (𝑋(,)𝐵))
39	4	rexrd 11309	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ ℝ^*)
40		elicc2 13449	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ ℝ ∧ 𝑌 ∈ ℝ) → (𝐵 ∈ (𝑋[,]𝑌) ↔ (𝐵 ∈ ℝ ∧ 𝑋 ≤ 𝐵 ∧ 𝐵 ≤ 𝑌)))
41	3, 4, 40	syl2anc 584	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐵 ∈ (𝑋[,]𝑌) ↔ (𝐵 ∈ ℝ ∧ 𝑋 ≤ 𝐵 ∧ 𝐵 ≤ 𝑌)))
42	10, 41	mpbid 232	. . . . . . . . . 10 ⊢ (𝜑 → (𝐵 ∈ ℝ ∧ 𝑋 ≤ 𝐵 ∧ 𝐵 ≤ 𝑌))
43	42	simp3d 1143	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ≤ 𝑌)
44		iooss2 13420	. . . . . . . . 9 ⊢ ((𝑌 ∈ ℝ^* ∧ 𝐵 ≤ 𝑌) → (𝑋(,)𝐵) ⊆ (𝑋(,)𝑌))
45	39, 43, 44	syl2anc 584	. . . . . . . 8 ⊢ (𝜑 → (𝑋(,)𝐵) ⊆ (𝑋(,)𝑌))
46	38, 45	sstrd 4006	. . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ (𝑋(,)𝑌))
47	46	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝐴(,)𝐵) ⊆ (𝑋(,)𝑌))
48		ftc2ditg.c	. . . . . . 7 ⊢ (𝜑 → (ℝ D 𝐹) ∈ ((𝑋(,)𝑌)–cn→ℂ))
49	48	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D 𝐹) ∈ ((𝑋(,)𝑌)–cn→ℂ))
50		rescncf 24937	. . . . . 6 ⊢ ((𝐴(,)𝐵) ⊆ (𝑋(,)𝑌) → ((ℝ D 𝐹) ∈ ((𝑋(,)𝑌)–cn→ℂ) → ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)) ∈ ((𝐴(,)𝐵)–cn→ℂ)))
51	47, 49, 50	sylc 65	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)) ∈ ((𝐴(,)𝐵)–cn→ℂ))
52	31, 51	eqeltrd 2839	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
53		cncff 24933	. . . . . . . . . . 11 ⊢ ((ℝ D 𝐹) ∈ ((𝑋(,)𝑌)–cn→ℂ) → (ℝ D 𝐹):(𝑋(,)𝑌)⟶ℂ)
54	48, 53	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D 𝐹):(𝑋(,)𝑌)⟶ℂ)
55	54	feqmptd 6977	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D 𝐹) = (𝑡 ∈ (𝑋(,)𝑌) ↦ ((ℝ D 𝐹)‘𝑡)))
56	55	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D 𝐹) = (𝑡 ∈ (𝑋(,)𝑌) ↦ ((ℝ D 𝐹)‘𝑡)))
57	56	reseq1d 5999	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)) = ((𝑡 ∈ (𝑋(,)𝑌) ↦ ((ℝ D 𝐹)‘𝑡)) ↾ (𝐴(,)𝐵)))
58	47	resmptd 6060	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((𝑡 ∈ (𝑋(,)𝑌) ↦ ((ℝ D 𝐹)‘𝑡)) ↾ (𝐴(,)𝐵)) = (𝑡 ∈ (𝐴(,)𝐵) ↦ ((ℝ D 𝐹)‘𝑡)))
59	57, 58	eqtrd 2775	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)) = (𝑡 ∈ (𝐴(,)𝐵) ↦ ((ℝ D 𝐹)‘𝑡)))
60	31, 59	eqtrd 2775	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) = (𝑡 ∈ (𝐴(,)𝐵) ↦ ((ℝ D 𝐹)‘𝑡)))
61		ioombl 25614	. . . . . . 7 ⊢ (𝐴(,)𝐵) ∈ dom vol
62	61	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝐴(,)𝐵) ∈ dom vol)
63		fvexd 6922	. . . . . 6 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑡 ∈ (𝑋(,)𝑌)) → ((ℝ D 𝐹)‘𝑡) ∈ V)
64		ftc2ditg.i	. . . . . . . 8 ⊢ (𝜑 → (ℝ D 𝐹) ∈ 𝐿¹)
65	64	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D 𝐹) ∈ 𝐿¹)
66	56, 65	eqeltrrd 2840	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝑡 ∈ (𝑋(,)𝑌) ↦ ((ℝ D 𝐹)‘𝑡)) ∈ 𝐿¹)
67	47, 62, 63, 66	iblss 25855	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝑡 ∈ (𝐴(,)𝐵) ↦ ((ℝ D 𝐹)‘𝑡)) ∈ 𝐿¹)
68	60, 67	eqeltrd 2839	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) ∈ 𝐿¹)
69		iccss2 13455	. . . . . . 7 ⊢ ((𝐴 ∈ (𝑋[,]𝑌) ∧ 𝐵 ∈ (𝑋[,]𝑌)) → (𝐴[,]𝐵) ⊆ (𝑋[,]𝑌))
70	7, 10, 69	syl2anc 584	. . . . . 6 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ (𝑋[,]𝑌))
71		rescncf 24937	. . . . . 6 ⊢ ((𝐴[,]𝐵) ⊆ (𝑋[,]𝑌) → (𝐹 ∈ ((𝑋[,]𝑌)–cn→ℂ) → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℂ)))
72	70, 15, 71	sylc 65	. . . . 5 ⊢ (𝜑 → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℂ))
73	72	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℂ))
74	9, 12, 1, 52, 68, 73	ftc2 26100	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∫(𝐴(,)𝐵)((ℝ D (𝐹 ↾ (𝐴[,]𝐵)))‘𝑡) d𝑡 = (((𝐹 ↾ (𝐴[,]𝐵))‘𝐵) − ((𝐹 ↾ (𝐴[,]𝐵))‘𝐴)))
75	31	fveq1d 6909	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D (𝐹 ↾ (𝐴[,]𝐵)))‘𝑡) = (((ℝ D 𝐹) ↾ (𝐴(,)𝐵))‘𝑡))
76		fvres 6926	. . . . 5 ⊢ (𝑡 ∈ (𝐴(,)𝐵) → (((ℝ D 𝐹) ↾ (𝐴(,)𝐵))‘𝑡) = ((ℝ D 𝐹)‘𝑡))
77	75, 76	sylan9eq 2795	. . . 4 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑡 ∈ (𝐴(,)𝐵)) → ((ℝ D (𝐹 ↾ (𝐴[,]𝐵)))‘𝑡) = ((ℝ D 𝐹)‘𝑡))
78	77	itgeq2dv 25832	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∫(𝐴(,)𝐵)((ℝ D (𝐹 ↾ (𝐴[,]𝐵)))‘𝑡) d𝑡 = ∫(𝐴(,)𝐵)((ℝ D 𝐹)‘𝑡) d𝑡)
79	9	rexrd 11309	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ ℝ^*)
80	12	rexrd 11309	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ^*)
81		ubicc2 13502	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ (𝐴[,]𝐵))
82		lbicc2 13501	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ (𝐴[,]𝐵))
83		fvres 6926	. . . . . 6 ⊢ (𝐵 ∈ (𝐴[,]𝐵) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝐵) = (𝐹‘𝐵))
84		fvres 6926	. . . . . 6 ⊢ (𝐴 ∈ (𝐴[,]𝐵) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝐴) = (𝐹‘𝐴))
85	83, 84	oveqan12d 7450	. . . . 5 ⊢ ((𝐵 ∈ (𝐴[,]𝐵) ∧ 𝐴 ∈ (𝐴[,]𝐵)) → (((𝐹 ↾ (𝐴[,]𝐵))‘𝐵) − ((𝐹 ↾ (𝐴[,]𝐵))‘𝐴)) = ((𝐹‘𝐵) − (𝐹‘𝐴)))
86	81, 82, 85	syl2anc 584	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵) → (((𝐹 ↾ (𝐴[,]𝐵))‘𝐵) − ((𝐹 ↾ (𝐴[,]𝐵))‘𝐴)) = ((𝐹‘𝐵) − (𝐹‘𝐴)))
87	79, 80, 1, 86	syl3anc 1370	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (((𝐹 ↾ (𝐴[,]𝐵))‘𝐵) − ((𝐹 ↾ (𝐴[,]𝐵))‘𝐴)) = ((𝐹‘𝐵) − (𝐹‘𝐴)))
88	74, 78, 87	3eqtr3d 2783	. 2 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∫(𝐴(,)𝐵)((ℝ D 𝐹)‘𝑡) d𝑡 = ((𝐹‘𝐵) − (𝐹‘𝐴)))
89	2, 88	eqtrd 2775	1 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ⨜[𝐴 → 𝐵]((ℝ D 𝐹)‘𝑡) d𝑡 = ((𝐹‘𝐵) − (𝐹‘𝐴)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 Vcvv 3478 ⊆ wss 3963 class class class wbr 5148 ↦ cmpt 5231 dom cdm 5689 ran crn 5690 ↾ cres 5691 ⟶wf 6559 ‘cfv 6563 (class class class)co 7431 ℂcc 11151 ℝcr 11152 ℝ^*cxr 11292 ≤ cle 11294 − cmin 11490 (,)cioo 13384 [,]cicc 13387 TopOpenctopn 17468 topGenctg 17484 ℂ_fldccnfld 21382 intcnt 23041 –cn→ccncf 24916 volcvol 25512 𝐿¹cibl 25666 ∫citg 25667 ⨜cdit 25896 D cdv 25913

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-inf2 9679 ax-cc 10473 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 ax-pre-sup 11231 ax-addf 11232

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-symdif 4259 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-tp 4636 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-iin 4999 df-disj 5116 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-se 5642 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-isom 6572 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-of 7697 df-ofr 7698 df-om 7888 df-1st 8013 df-2nd 8014 df-supp 8185 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-2o 8506 df-oadd 8509 df-omul 8510 df-er 8744 df-map 8867 df-pm 8868 df-ixp 8937 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-fsupp 9400 df-fi 9449 df-sup 9480 df-inf 9481 df-oi 9548 df-dju 9939 df-card 9977 df-acn 9980 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-div 11919 df-nn 12265 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12525 df-z 12612 df-dec 12732 df-uz 12877 df-q 12989 df-rp 13033 df-xneg 13152 df-xadd 13153 df-xmul 13154 df-ioo 13388 df-ioc 13389 df-ico 13390 df-icc 13391 df-fz 13545 df-fzo 13692 df-fl 13829 df-mod 13907 df-seq 14040 df-exp 14100 df-hash 14367 df-cj 15135 df-re 15136 df-im 15137 df-sqrt 15271 df-abs 15272 df-clim 15521 df-rlim 15522 df-sum 15720 df-struct 17181 df-sets 17198 df-slot 17216 df-ndx 17228 df-base 17246 df-ress 17275 df-plusg 17311 df-mulr 17312 df-starv 17313 df-sca 17314 df-vsca 17315 df-ip 17316 df-tset 17317 df-ple 17318 df-ds 17320 df-unif 17321 df-hom 17322 df-cco 17323 df-rest 17469 df-topn 17470 df-0g 17488 df-gsum 17489 df-topgen 17490 df-pt 17491 df-prds 17494 df-xrs 17549 df-qtop 17554 df-imas 17555 df-xps 17557 df-mre 17631 df-mrc 17632 df-acs 17634 df-mgm 18666 df-sgrp 18745 df-mnd 18761 df-submnd 18810 df-mulg 19099 df-cntz 19348 df-cmn 19815 df-psmet 21374 df-xmet 21375 df-met 21376 df-bl 21377 df-mopn 21378 df-fbas 21379 df-fg 21380 df-cnfld 21383 df-top 22916 df-topon 22933 df-topsp 22955 df-bases 22969 df-cld 23043 df-ntr 23044 df-cls 23045 df-nei 23122 df-lp 23160 df-perf 23161 df-cn 23251 df-cnp 23252 df-haus 23339 df-cmp 23411 df-tx 23586 df-hmeo 23779 df-fil 23870 df-fm 23962 df-flim 23963 df-flf 23964 df-xms 24346 df-ms 24347 df-tms 24348 df-cncf 24918 df-ovol 25513 df-vol 25514 df-mbf 25668 df-itg1 25669 df-itg2 25670 df-ibl 25671 df-itg 25672 df-0p 25719 df-ditg 25897 df-limc 25916 df-dv 25917

This theorem is referenced by: ftc2ditg 26102

W3C validator