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 25998

Description: Lemma for ftc2ditg 25999. (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 483	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ 𝐵)
2	1	ditgpos 25803	. 2 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ⨜[𝐴 → 𝐵]((ℝ D 𝐹)‘𝑡) d𝑡 = ∫(𝐴(,)𝐵)((ℝ D 𝐹)‘𝑡) d𝑡)
3		ftc2ditg.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ ℝ)
4		ftc2ditg.y	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ ℝ)
5		iccssre 13444	. . . . . . 7 ⊢ ((𝑋 ∈ ℝ ∧ 𝑌 ∈ ℝ) → (𝑋[,]𝑌) ⊆ ℝ)
6	3, 4, 5	syl2anc 582	. . . . . 6 ⊢ (𝜑 → (𝑋[,]𝑌) ⊆ ℝ)
7		ftc2ditg.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (𝑋[,]𝑌))
8	6, 7	sseldd 3981	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ)
9	8	adantr 479	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ ℝ)
10		ftc2ditg.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ (𝑋[,]𝑌))
11	6, 10	sseldd 3981	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ)
12	11	adantr 479	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ)
13		ax-resscn 11201	. . . . . . . 8 ⊢ ℝ ⊆ ℂ
14	13	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ℝ ⊆ ℂ)
15		ftc2ditg.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ ((𝑋[,]𝑌)–cn→ℂ))
16		cncff 24831	. . . . . . . . 9 ⊢ (𝐹 ∈ ((𝑋[,]𝑌)–cn→ℂ) → 𝐹:(𝑋[,]𝑌)⟶ℂ)
17	15, 16	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐹:(𝑋[,]𝑌)⟶ℂ)
18	17	adantr 479	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐹:(𝑋[,]𝑌)⟶ℂ)
19	6	adantr 479	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝑋[,]𝑌) ⊆ ℝ)
20		iccssre 13444	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
21	8, 11, 20	syl2anc 582	. . . . . . . 8 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ)
22	21	adantr 479	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝐴[,]𝐵) ⊆ ℝ)
23		eqid 2727	. . . . . . . 8 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
24	23	tgioo2 24737	. . . . . . . 8 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
25	23, 24	dvres 25858	. . . . . . 7 ⊢ (((ℝ ⊆ ℂ ∧ 𝐹:(𝑋[,]𝑌)⟶ℂ) ∧ ((𝑋[,]𝑌) ⊆ ℝ ∧ (𝐴[,]𝐵) ⊆ ℝ)) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) = ((ℝ D 𝐹) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))))
26	14, 18, 19, 22, 25	syl22anc 837	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) = ((ℝ D 𝐹) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))))
27		iccntr 24755	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵))
28	8, 11, 27	syl2anc 582	. . . . . . . 8 ⊢ (𝜑 → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵))
29	28	adantr 479	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵))
30	29	reseq2d 5987	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D 𝐹) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))) = ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)))
31	26, 30	eqtrd 2767	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) = ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)))
32	3	rexrd 11300	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ ℝ^*)
33		elicc2 13427	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ ℝ ∧ 𝑌 ∈ ℝ) → (𝐴 ∈ (𝑋[,]𝑌) ↔ (𝐴 ∈ ℝ ∧ 𝑋 ≤ 𝐴 ∧ 𝐴 ≤ 𝑌)))
34	3, 4, 33	syl2anc 582	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 ∈ (𝑋[,]𝑌) ↔ (𝐴 ∈ ℝ ∧ 𝑋 ≤ 𝐴 ∧ 𝐴 ≤ 𝑌)))
35	7, 34	mpbid 231	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 ∈ ℝ ∧ 𝑋 ≤ 𝐴 ∧ 𝐴 ≤ 𝑌))
36	35	simp2d 1140	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ≤ 𝐴)
37		iooss1 13397	. . . . . . . . 9 ⊢ ((𝑋 ∈ ℝ^* ∧ 𝑋 ≤ 𝐴) → (𝐴(,)𝐵) ⊆ (𝑋(,)𝐵))
38	32, 36, 37	syl2anc 582	. . . . . . . 8 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ (𝑋(,)𝐵))
39	4	rexrd 11300	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ ℝ^*)
40		elicc2 13427	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ ℝ ∧ 𝑌 ∈ ℝ) → (𝐵 ∈ (𝑋[,]𝑌) ↔ (𝐵 ∈ ℝ ∧ 𝑋 ≤ 𝐵 ∧ 𝐵 ≤ 𝑌)))
41	3, 4, 40	syl2anc 582	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐵 ∈ (𝑋[,]𝑌) ↔ (𝐵 ∈ ℝ ∧ 𝑋 ≤ 𝐵 ∧ 𝐵 ≤ 𝑌)))
42	10, 41	mpbid 231	. . . . . . . . . 10 ⊢ (𝜑 → (𝐵 ∈ ℝ ∧ 𝑋 ≤ 𝐵 ∧ 𝐵 ≤ 𝑌))
43	42	simp3d 1141	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ≤ 𝑌)
44		iooss2 13398	. . . . . . . . 9 ⊢ ((𝑌 ∈ ℝ^* ∧ 𝐵 ≤ 𝑌) → (𝑋(,)𝐵) ⊆ (𝑋(,)𝑌))
45	39, 43, 44	syl2anc 582	. . . . . . . 8 ⊢ (𝜑 → (𝑋(,)𝐵) ⊆ (𝑋(,)𝑌))
46	38, 45	sstrd 3990	. . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ (𝑋(,)𝑌))
47	46	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝐴(,)𝐵) ⊆ (𝑋(,)𝑌))
48		ftc2ditg.c	. . . . . . 7 ⊢ (𝜑 → (ℝ D 𝐹) ∈ ((𝑋(,)𝑌)–cn→ℂ))
49	48	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D 𝐹) ∈ ((𝑋(,)𝑌)–cn→ℂ))
50		rescncf 24835	. . . . . 6 ⊢ ((𝐴(,)𝐵) ⊆ (𝑋(,)𝑌) → ((ℝ D 𝐹) ∈ ((𝑋(,)𝑌)–cn→ℂ) → ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)) ∈ ((𝐴(,)𝐵)–cn→ℂ)))
51	47, 49, 50	sylc 65	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)) ∈ ((𝐴(,)𝐵)–cn→ℂ))
52	31, 51	eqeltrd 2828	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
53		cncff 24831	. . . . . . . . . . 11 ⊢ ((ℝ D 𝐹) ∈ ((𝑋(,)𝑌)–cn→ℂ) → (ℝ D 𝐹):(𝑋(,)𝑌)⟶ℂ)
54	48, 53	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D 𝐹):(𝑋(,)𝑌)⟶ℂ)
55	54	feqmptd 6970	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D 𝐹) = (𝑡 ∈ (𝑋(,)𝑌) ↦ ((ℝ D 𝐹)‘𝑡)))
56	55	adantr 479	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D 𝐹) = (𝑡 ∈ (𝑋(,)𝑌) ↦ ((ℝ D 𝐹)‘𝑡)))
57	56	reseq1d 5986	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)) = ((𝑡 ∈ (𝑋(,)𝑌) ↦ ((ℝ D 𝐹)‘𝑡)) ↾ (𝐴(,)𝐵)))
58	47	resmptd 6047	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((𝑡 ∈ (𝑋(,)𝑌) ↦ ((ℝ D 𝐹)‘𝑡)) ↾ (𝐴(,)𝐵)) = (𝑡 ∈ (𝐴(,)𝐵) ↦ ((ℝ D 𝐹)‘𝑡)))
59	57, 58	eqtrd 2767	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)) = (𝑡 ∈ (𝐴(,)𝐵) ↦ ((ℝ D 𝐹)‘𝑡)))
60	31, 59	eqtrd 2767	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) = (𝑡 ∈ (𝐴(,)𝐵) ↦ ((ℝ D 𝐹)‘𝑡)))
61		ioombl 25512	. . . . . . 7 ⊢ (𝐴(,)𝐵) ∈ dom vol
62	61	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝐴(,)𝐵) ∈ dom vol)
63		fvexd 6915	. . . . . 6 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑡 ∈ (𝑋(,)𝑌)) → ((ℝ D 𝐹)‘𝑡) ∈ V)
64		ftc2ditg.i	. . . . . . . 8 ⊢ (𝜑 → (ℝ D 𝐹) ∈ 𝐿¹)
65	64	adantr 479	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D 𝐹) ∈ 𝐿¹)
66	56, 65	eqeltrrd 2829	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝑡 ∈ (𝑋(,)𝑌) ↦ ((ℝ D 𝐹)‘𝑡)) ∈ 𝐿¹)
67	47, 62, 63, 66	iblss 25752	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝑡 ∈ (𝐴(,)𝐵) ↦ ((ℝ D 𝐹)‘𝑡)) ∈ 𝐿¹)
68	60, 67	eqeltrd 2828	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) ∈ 𝐿¹)
69		iccss2 13433	. . . . . . 7 ⊢ ((𝐴 ∈ (𝑋[,]𝑌) ∧ 𝐵 ∈ (𝑋[,]𝑌)) → (𝐴[,]𝐵) ⊆ (𝑋[,]𝑌))
70	7, 10, 69	syl2anc 582	. . . . . 6 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ (𝑋[,]𝑌))
71		rescncf 24835	. . . . . 6 ⊢ ((𝐴[,]𝐵) ⊆ (𝑋[,]𝑌) → (𝐹 ∈ ((𝑋[,]𝑌)–cn→ℂ) → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℂ)))
72	70, 15, 71	sylc 65	. . . . 5 ⊢ (𝜑 → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℂ))
73	72	adantr 479	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℂ))
74	9, 12, 1, 52, 68, 73	ftc2 25997	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∫(𝐴(,)𝐵)((ℝ D (𝐹 ↾ (𝐴[,]𝐵)))‘𝑡) d𝑡 = (((𝐹 ↾ (𝐴[,]𝐵))‘𝐵) − ((𝐹 ↾ (𝐴[,]𝐵))‘𝐴)))
75	31	fveq1d 6902	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D (𝐹 ↾ (𝐴[,]𝐵)))‘𝑡) = (((ℝ D 𝐹) ↾ (𝐴(,)𝐵))‘𝑡))
76		fvres 6919	. . . . 5 ⊢ (𝑡 ∈ (𝐴(,)𝐵) → (((ℝ D 𝐹) ↾ (𝐴(,)𝐵))‘𝑡) = ((ℝ D 𝐹)‘𝑡))
77	75, 76	sylan9eq 2787	. . . 4 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑡 ∈ (𝐴(,)𝐵)) → ((ℝ D (𝐹 ↾ (𝐴[,]𝐵)))‘𝑡) = ((ℝ D 𝐹)‘𝑡))
78	77	itgeq2dv 25729	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∫(𝐴(,)𝐵)((ℝ D (𝐹 ↾ (𝐴[,]𝐵)))‘𝑡) d𝑡 = ∫(𝐴(,)𝐵)((ℝ D 𝐹)‘𝑡) d𝑡)
79	9	rexrd 11300	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ ℝ^*)
80	12	rexrd 11300	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ^*)
81		ubicc2 13480	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ (𝐴[,]𝐵))
82		lbicc2 13479	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ (𝐴[,]𝐵))
83		fvres 6919	. . . . . 6 ⊢ (𝐵 ∈ (𝐴[,]𝐵) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝐵) = (𝐹‘𝐵))
84		fvres 6919	. . . . . 6 ⊢ (𝐴 ∈ (𝐴[,]𝐵) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝐴) = (𝐹‘𝐴))
85	83, 84	oveqan12d 7443	. . . . 5 ⊢ ((𝐵 ∈ (𝐴[,]𝐵) ∧ 𝐴 ∈ (𝐴[,]𝐵)) → (((𝐹 ↾ (𝐴[,]𝐵))‘𝐵) − ((𝐹 ↾ (𝐴[,]𝐵))‘𝐴)) = ((𝐹‘𝐵) − (𝐹‘𝐴)))
86	81, 82, 85	syl2anc 582	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵) → (((𝐹 ↾ (𝐴[,]𝐵))‘𝐵) − ((𝐹 ↾ (𝐴[,]𝐵))‘𝐴)) = ((𝐹‘𝐵) − (𝐹‘𝐴)))
87	79, 80, 1, 86	syl3anc 1368	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (((𝐹 ↾ (𝐴[,]𝐵))‘𝐵) − ((𝐹 ↾ (𝐴[,]𝐵))‘𝐴)) = ((𝐹‘𝐵) − (𝐹‘𝐴)))
88	74, 78, 87	3eqtr3d 2775	. 2 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∫(𝐴(,)𝐵)((ℝ D 𝐹)‘𝑡) d𝑡 = ((𝐹‘𝐵) − (𝐹‘𝐴)))
89	2, 88	eqtrd 2767	1 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ⨜[𝐴 → 𝐵]((ℝ D 𝐹)‘𝑡) d𝑡 = ((𝐹‘𝐵) − (𝐹‘𝐴)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 Vcvv 3471 ⊆ wss 3947 class class class wbr 5150 ↦ cmpt 5233 dom cdm 5680 ran crn 5681 ↾ cres 5682 ⟶wf 6547 ‘cfv 6551 (class class class)co 7424 ℂcc 11142 ℝcr 11143 ℝ^*cxr 11283 ≤ cle 11285 − cmin 11480 (,)cioo 13362 [,]cicc 13365 TopOpenctopn 17408 topGenctg 17424 ℂ_fldccnfld 21284 intcnt 22939 –cn→ccncf 24814 volcvol 25410 𝐿¹cibl 25564 ∫citg 25565 ⨜cdit 25793 D cdv 25810

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2698 ax-rep 5287 ax-sep 5301 ax-nul 5308 ax-pow 5367 ax-pr 5431 ax-un 7744 ax-inf2 9670 ax-cc 10464 ax-cnex 11200 ax-resscn 11201 ax-1cn 11202 ax-icn 11203 ax-addcl 11204 ax-addrcl 11205 ax-mulcl 11206 ax-mulrcl 11207 ax-mulcom 11208 ax-addass 11209 ax-mulass 11210 ax-distr 11211 ax-i2m1 11212 ax-1ne0 11213 ax-1rid 11214 ax-rnegex 11215 ax-rrecex 11216 ax-cnre 11217 ax-pre-lttri 11218 ax-pre-lttrn 11219 ax-pre-ltadd 11220 ax-pre-mulgt0 11221 ax-pre-sup 11222 ax-addf 11223

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2937 df-nel 3043 df-ral 3058 df-rex 3067 df-rmo 3372 df-reu 3373 df-rab 3429 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-symdif 4243 df-nul 4325 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-tp 4635 df-op 4637 df-uni 4911 df-int 4952 df-iun 5000 df-iin 5001 df-disj 5116 df-br 5151 df-opab 5213 df-mpt 5234 df-tr 5268 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5635 df-se 5636 df-we 5637 df-xp 5686 df-rel 5687 df-cnv 5688 df-co 5689 df-dm 5690 df-rn 5691 df-res 5692 df-ima 5693 df-pred 6308 df-ord 6375 df-on 6376 df-lim 6377 df-suc 6378 df-iota 6503 df-fun 6553 df-fn 6554 df-f 6555 df-f1 6556 df-fo 6557 df-f1o 6558 df-fv 6559 df-isom 6560 df-riota 7380 df-ov 7427 df-oprab 7428 df-mpo 7429 df-of 7689 df-ofr 7690 df-om 7875 df-1st 7997 df-2nd 7998 df-supp 8170 df-frecs 8291 df-wrecs 8322 df-recs 8396 df-rdg 8435 df-1o 8491 df-2o 8492 df-oadd 8495 df-omul 8496 df-er 8729 df-map 8851 df-pm 8852 df-ixp 8921 df-en 8969 df-dom 8970 df-sdom 8971 df-fin 8972 df-fsupp 9392 df-fi 9440 df-sup 9471 df-inf 9472 df-oi 9539 df-dju 9930 df-card 9968 df-acn 9971 df-pnf 11286 df-mnf 11287 df-xr 11288 df-ltxr 11289 df-le 11290 df-sub 11482 df-neg 11483 df-div 11908 df-nn 12249 df-2 12311 df-3 12312 df-4 12313 df-5 12314 df-6 12315 df-7 12316 df-8 12317 df-9 12318 df-n0 12509 df-z 12595 df-dec 12714 df-uz 12859 df-q 12969 df-rp 13013 df-xneg 13130 df-xadd 13131 df-xmul 13132 df-ioo 13366 df-ioc 13367 df-ico 13368 df-icc 13369 df-fz 13523 df-fzo 13666 df-fl 13795 df-mod 13873 df-seq 14005 df-exp 14065 df-hash 14328 df-cj 15084 df-re 15085 df-im 15086 df-sqrt 15220 df-abs 15221 df-clim 15470 df-rlim 15471 df-sum 15671 df-struct 17121 df-sets 17138 df-slot 17156 df-ndx 17168 df-base 17186 df-ress 17215 df-plusg 17251 df-mulr 17252 df-starv 17253 df-sca 17254 df-vsca 17255 df-ip 17256 df-tset 17257 df-ple 17258 df-ds 17260 df-unif 17261 df-hom 17262 df-cco 17263 df-rest 17409 df-topn 17410 df-0g 17428 df-gsum 17429 df-topgen 17430 df-pt 17431 df-prds 17434 df-xrs 17489 df-qtop 17494 df-imas 17495 df-xps 17497 df-mre 17571 df-mrc 17572 df-acs 17574 df-mgm 18605 df-sgrp 18684 df-mnd 18700 df-submnd 18746 df-mulg 19029 df-cntz 19273 df-cmn 19742 df-psmet 21276 df-xmet 21277 df-met 21278 df-bl 21279 df-mopn 21280 df-fbas 21281 df-fg 21282 df-cnfld 21285 df-top 22814 df-topon 22831 df-topsp 22853 df-bases 22867 df-cld 22941 df-ntr 22942 df-cls 22943 df-nei 23020 df-lp 23058 df-perf 23059 df-cn 23149 df-cnp 23150 df-haus 23237 df-cmp 23309 df-tx 23484 df-hmeo 23677 df-fil 23768 df-fm 23860 df-flim 23861 df-flf 23862 df-xms 24244 df-ms 24245 df-tms 24246 df-cncf 24816 df-ovol 25411 df-vol 25412 df-mbf 25566 df-itg1 25567 df-itg2 25568 df-ibl 25569 df-itg 25570 df-0p 25617 df-ditg 25794 df-limc 25813 df-dv 25814

This theorem is referenced by: ftc2ditg 25999

W3C validator