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 26255

Description: Lemma for ftc2ditg 26256. (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 490	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ 𝐵)
2	1	ditgpos 26066	. 2 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ⨜[𝐴 → 𝐵]((ℝ D 𝐹)‘𝑡) d𝑡 = ∫(𝐴(,)𝐵)((ℝ D 𝐹)‘𝑡) d𝑡)
3		ftc2ditg.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ ℝ)
4		ftc2ditg.y	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ ℝ)
5		iccssre 13472	. . . . . . 7 ⊢ ((𝑋 ∈ ℝ ∧ 𝑌 ∈ ℝ) → (𝑋[,]𝑌) ⊆ ℝ)
6	3, 4, 5	syl2anc 596	. . . . . 6 ⊢ (𝜑 → (𝑋[,]𝑌) ⊆ ℝ)
7		ftc2ditg.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (𝑋[,]𝑌))
8	6, 7	sseldd 3939	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ)
9	8	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ ℝ)
10		ftc2ditg.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ (𝑋[,]𝑌))
11	6, 10	sseldd 3939	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ)
12	11	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ)
13		ax-resscn 11172	. . . . . . . 8 ⊢ ℝ ⊆ ℂ
14	13	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ℝ ⊆ ℂ)
15		ftc2ditg.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ ((𝑋[,]𝑌)–cn→ℂ))
16		cncff 25103	. . . . . . . . 9 ⊢ (𝐹 ∈ ((𝑋[,]𝑌)–cn→ℂ) → 𝐹:(𝑋[,]𝑌)⟶ℂ)
17	15, 16	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝐹:(𝑋[,]𝑌)⟶ℂ)
18	17	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐹:(𝑋[,]𝑌)⟶ℂ)
19	6	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝑋[,]𝑌) ⊆ ℝ)
20		iccssre 13472	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
21	8, 11, 20	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ)
22	21	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝐴[,]𝐵) ⊆ ℝ)
23		eqid 2765	. . . . . . . 8 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
24		tgioo4 25013	. . . . . . . 8 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
25	23, 24	dvres 26121	. . . . . . 7 ⊢ (((ℝ ⊆ ℂ ∧ 𝐹:(𝑋[,]𝑌)⟶ℂ) ∧ ((𝑋[,]𝑌) ⊆ ℝ ∧ (𝐴[,]𝐵) ⊆ ℝ)) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) = ((ℝ D 𝐹) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))))
26	14, 18, 19, 22, 25	syl22anc 852	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) = ((ℝ D 𝐹) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))))
27		iccntr 25030	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵))
28	8, 11, 27	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵))
29	28	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵))
30	29	reseq2d 5980	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D 𝐹) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))) = ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)))
31	26, 30	eqtrd 2800	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) = ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)))
32	3	rexrd 11274	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ ℝ^*)
33		elicc2 13454	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ ℝ ∧ 𝑌 ∈ ℝ) → (𝐴 ∈ (𝑋[,]𝑌) ↔ (𝐴 ∈ ℝ ∧ 𝑋 ≤ 𝐴 ∧ 𝐴 ≤ 𝑌)))
34	3, 4, 33	syl2anc 596	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 ∈ (𝑋[,]𝑌) ↔ (𝐴 ∈ ℝ ∧ 𝑋 ≤ 𝐴 ∧ 𝐴 ≤ 𝑌)))
35	7, 34	mpbid 235	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 ∈ ℝ ∧ 𝑋 ≤ 𝐴 ∧ 𝐴 ≤ 𝑌))
36	35	simp2d 1161	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ≤ 𝐴)
37		iooss1 13423	. . . . . . . . 9 ⊢ ((𝑋 ∈ ℝ^* ∧ 𝑋 ≤ 𝐴) → (𝐴(,)𝐵) ⊆ (𝑋(,)𝐵))
38	32, 36, 37	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ (𝑋(,)𝐵))
39	4	rexrd 11274	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ ℝ^*)
40		elicc2 13454	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ ℝ ∧ 𝑌 ∈ ℝ) → (𝐵 ∈ (𝑋[,]𝑌) ↔ (𝐵 ∈ ℝ ∧ 𝑋 ≤ 𝐵 ∧ 𝐵 ≤ 𝑌)))
41	3, 4, 40	syl2anc 596	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐵 ∈ (𝑋[,]𝑌) ↔ (𝐵 ∈ ℝ ∧ 𝑋 ≤ 𝐵 ∧ 𝐵 ≤ 𝑌)))
42	10, 41	mpbid 235	. . . . . . . . . 10 ⊢ (𝜑 → (𝐵 ∈ ℝ ∧ 𝑋 ≤ 𝐵 ∧ 𝐵 ≤ 𝑌))
43	42	simp3d 1162	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ≤ 𝑌)
44		iooss2 13424	. . . . . . . . 9 ⊢ ((𝑌 ∈ ℝ^* ∧ 𝐵 ≤ 𝑌) → (𝑋(,)𝐵) ⊆ (𝑋(,)𝑌))
45	39, 43, 44	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → (𝑋(,)𝐵) ⊆ (𝑋(,)𝑌))
46	38, 45	sstrd 3948	. . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ (𝑋(,)𝑌))
47	46	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝐴(,)𝐵) ⊆ (𝑋(,)𝑌))
48		ftc2ditg.c	. . . . . . 7 ⊢ (𝜑 → (ℝ D 𝐹) ∈ ((𝑋(,)𝑌)–cn→ℂ))
49	48	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D 𝐹) ∈ ((𝑋(,)𝑌)–cn→ℂ))
50		rescncf 25107	. . . . . 6 ⊢ ((𝐴(,)𝐵) ⊆ (𝑋(,)𝑌) → ((ℝ D 𝐹) ∈ ((𝑋(,)𝑌)–cn→ℂ) → ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)) ∈ ((𝐴(,)𝐵)–cn→ℂ)))
51	47, 49, 50	sylc 66	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)) ∈ ((𝐴(,)𝐵)–cn→ℂ))
52	31, 51	eqeltrd 2865	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
53		cncff 25103	. . . . . . . . . . 11 ⊢ ((ℝ D 𝐹) ∈ ((𝑋(,)𝑌)–cn→ℂ) → (ℝ D 𝐹):(𝑋(,)𝑌)⟶ℂ)
54	48, 53	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D 𝐹):(𝑋(,)𝑌)⟶ℂ)
55	54	feqmptd 6953	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D 𝐹) = (𝑡 ∈ (𝑋(,)𝑌) ↦ ((ℝ D 𝐹)‘𝑡)))
56	55	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D 𝐹) = (𝑡 ∈ (𝑋(,)𝑌) ↦ ((ℝ D 𝐹)‘𝑡)))
57	56	reseq1d 5979	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)) = ((𝑡 ∈ (𝑋(,)𝑌) ↦ ((ℝ D 𝐹)‘𝑡)) ↾ (𝐴(,)𝐵)))
58	47	resmptd 6044	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((𝑡 ∈ (𝑋(,)𝑌) ↦ ((ℝ D 𝐹)‘𝑡)) ↾ (𝐴(,)𝐵)) = (𝑡 ∈ (𝐴(,)𝐵) ↦ ((ℝ D 𝐹)‘𝑡)))
59	57, 58	eqtrd 2800	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D 𝐹) ↾ (𝐴(,)𝐵)) = (𝑡 ∈ (𝐴(,)𝐵) ↦ ((ℝ D 𝐹)‘𝑡)))
60	31, 59	eqtrd 2800	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) = (𝑡 ∈ (𝐴(,)𝐵) ↦ ((ℝ D 𝐹)‘𝑡)))
61		ioombl 25775	. . . . . . 7 ⊢ (𝐴(,)𝐵) ∈ dom vol
62	61	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝐴(,)𝐵) ∈ dom vol)
63		fvexd 6900	. . . . . 6 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑡 ∈ (𝑋(,)𝑌)) → ((ℝ D 𝐹)‘𝑡) ∈ V)
64		ftc2ditg.i	. . . . . . . 8 ⊢ (𝜑 → (ℝ D 𝐹) ∈ 𝐿¹)
65	64	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D 𝐹) ∈ 𝐿¹)
66	56, 65	eqeltrrd 2866	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝑡 ∈ (𝑋(,)𝑌) ↦ ((ℝ D 𝐹)‘𝑡)) ∈ 𝐿¹)
67	47, 62, 63, 66	iblss 26015	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝑡 ∈ (𝐴(,)𝐵) ↦ ((ℝ D 𝐹)‘𝑡)) ∈ 𝐿¹)
68	60, 67	eqeltrd 2865	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (ℝ D (𝐹 ↾ (𝐴[,]𝐵))) ∈ 𝐿¹)
69		iccss2 13460	. . . . . . 7 ⊢ ((𝐴 ∈ (𝑋[,]𝑌) ∧ 𝐵 ∈ (𝑋[,]𝑌)) → (𝐴[,]𝐵) ⊆ (𝑋[,]𝑌))
70	7, 10, 69	syl2anc 596	. . . . . 6 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ (𝑋[,]𝑌))
71		rescncf 25107	. . . . . 6 ⊢ ((𝐴[,]𝐵) ⊆ (𝑋[,]𝑌) → (𝐹 ∈ ((𝑋[,]𝑌)–cn→ℂ) → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℂ)))
72	70, 15, 71	sylc 66	. . . . 5 ⊢ (𝜑 → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℂ))
73	72	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (𝐹 ↾ (𝐴[,]𝐵)) ∈ ((𝐴[,]𝐵)–cn→ℂ))
74	9, 12, 1, 52, 68, 73	ftc2 26254	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∫(𝐴(,)𝐵)((ℝ D (𝐹 ↾ (𝐴[,]𝐵)))‘𝑡) d𝑡 = (((𝐹 ↾ (𝐴[,]𝐵))‘𝐵) − ((𝐹 ↾ (𝐴[,]𝐵))‘𝐴)))
75	31	fveq1d 6887	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ((ℝ D (𝐹 ↾ (𝐴[,]𝐵)))‘𝑡) = (((ℝ D 𝐹) ↾ (𝐴(,)𝐵))‘𝑡))
76		fvres 6904	. . . . 5 ⊢ (𝑡 ∈ (𝐴(,)𝐵) → (((ℝ D 𝐹) ↾ (𝐴(,)𝐵))‘𝑡) = ((ℝ D 𝐹)‘𝑡))
77	75, 76	sylan9eq 2820	. . . 4 ⊢ (((𝜑 ∧ 𝐴 ≤ 𝐵) ∧ 𝑡 ∈ (𝐴(,)𝐵)) → ((ℝ D (𝐹 ↾ (𝐴[,]𝐵)))‘𝑡) = ((ℝ D 𝐹)‘𝑡))
78	77	itgeq2dv 25992	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∫(𝐴(,)𝐵)((ℝ D (𝐹 ↾ (𝐴[,]𝐵)))‘𝑡) d𝑡 = ∫(𝐴(,)𝐵)((ℝ D 𝐹)‘𝑡) d𝑡)
79	9	rexrd 11274	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ ℝ^*)
80	12	rexrd 11274	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ^*)
81		ubicc2 13508	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ (𝐴[,]𝐵))
82		lbicc2 13507	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ (𝐴[,]𝐵))
83		fvres 6904	. . . . . 6 ⊢ (𝐵 ∈ (𝐴[,]𝐵) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝐵) = (𝐹‘𝐵))
84		fvres 6904	. . . . . 6 ⊢ (𝐴 ∈ (𝐴[,]𝐵) → ((𝐹 ↾ (𝐴[,]𝐵))‘𝐴) = (𝐹‘𝐴))
85	83, 84	oveqan12d 7438	. . . . 5 ⊢ ((𝐵 ∈ (𝐴[,]𝐵) ∧ 𝐴 ∈ (𝐴[,]𝐵)) → (((𝐹 ↾ (𝐴[,]𝐵))‘𝐵) − ((𝐹 ↾ (𝐴[,]𝐵))‘𝐴)) = ((𝐹‘𝐵) − (𝐹‘𝐴)))
86	81, 82, 85	syl2anc 596	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵) → (((𝐹 ↾ (𝐴[,]𝐵))‘𝐵) − ((𝐹 ↾ (𝐴[,]𝐵))‘𝐴)) = ((𝐹‘𝐵) − (𝐹‘𝐴)))
87	79, 80, 1, 86	syl3anc 1398	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → (((𝐹 ↾ (𝐴[,]𝐵))‘𝐵) − ((𝐹 ↾ (𝐴[,]𝐵))‘𝐴)) = ((𝐹‘𝐵) − (𝐹‘𝐴)))
88	74, 78, 87	3eqtr3d 2808	. 2 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∫(𝐴(,)𝐵)((ℝ D 𝐹)‘𝑡) d𝑡 = ((𝐹‘𝐵) − (𝐹‘𝐴)))
89	2, 88	eqtrd 2800	1 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ⨜[𝐴 → 𝐵]((ℝ D 𝐹)‘𝑡) d𝑡 = ((𝐹‘𝐵) − (𝐹‘𝐴)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 Vcvv 3457 ⊆ wss 3906 class class class wbr 5111 ↦ cmpt 5194 dom cdm 5663 ran crn 5664 ↾ cres 5665 ⟶wf 6536 ‘cfv 6540 (class class class)co 7419 ℂcc 11113 ℝcr 11114 ℝ^*cxr 11257 ≤ cle 11259 − cmin 11456 (,)cioo 13388 [,]cicc 13391 TopOpenctopn 17496 topGenctg 17512 ℂ_fldccnfld 21572 intcnt 23224 –cn→ccncf 25086 volcvol 25673 𝐿¹cibl 25827 ∫citg 25828 ⨜cdit 26056 D cdv 26073

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-inf2 9617 ax-cc 10434 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 ax-pre-sup 11193 ax-addf 11194

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-symdif 4206 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-iin 4961 df-disj 5079 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-of 7684 df-ofr 7685 df-om 7869 df-1st 7992 df-2nd 7993 df-supp 8163 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-oadd 8463 df-omul 8464 df-er 8700 df-map 8832 df-pm 8833 df-ixp 8902 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-fsupp 9329 df-fi 9378 df-sup 9409 df-inf 9410 df-oi 9479 df-dju 9903 df-card 9941 df-acn 9944 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-div 11887 df-nn 12249 df-2 12318 df-3 12319 df-4 12320 df-5 12321 df-6 12322 df-7 12323 df-8 12324 df-9 12325 df-n0 12520 df-z 12607 df-dec 12728 df-uz 12879 df-q 12989 df-rp 13033 df-xneg 13153 df-xadd 13154 df-xmul 13155 df-ioo 13392 df-ioc 13393 df-ico 13394 df-icc 13395 df-fz 13552 df-fzo 13700 df-fl 13843 df-mod 13921 df-seq 14056 df-exp 14116 df-hash 14385 df-cj 15174 df-re 15175 df-im 15176 df-sqrt 15310 df-abs 15311 df-clim 15563 df-rlim 15564 df-sum 15762 df-struct 17229 df-sets 17246 df-slot 17264 df-ndx 17276 df-base 17292 df-ress 17313 df-plusg 17345 df-mulr 17346 df-starv 17347 df-sca 17348 df-vsca 17349 df-ip 17350 df-tset 17351 df-ple 17352 df-ds 17354 df-unif 17355 df-hom 17356 df-cco 17357 df-rest 17497 df-topn 17498 df-0g 17516 df-gsum 17517 df-topgen 17518 df-pt 17519 df-prds 17522 df-xrs 17578 df-qtop 17583 df-imas 17584 df-xps 17586 df-mre 17660 df-mrc 17661 df-acs 17663 df-mgm 18720 df-sgrp 18809 df-mnd 18825 df-submnd 18879 df-mulg 19178 df-cntz 19431 df-cmn 19896 df-psmet 21564 df-xmet 21565 df-met 21566 df-bl 21567 df-mopn 21568 df-fbas 21569 df-fg 21570 df-cnfld 21573 df-top 23101 df-topon 23118 df-topsp 23140 df-bases 23153 df-cld 23226 df-ntr 23227 df-cls 23228 df-nei 23305 df-lp 23343 df-perf 23344 df-cn 23434 df-cnp 23435 df-haus 23522 df-cmp 23594 df-tx 23770 df-hmeo 23963 df-fil 24054 df-fm 24146 df-flim 24147 df-flf 24148 df-xms 24528 df-ms 24529 df-tms 24530 df-cncf 25088 df-ovol 25674 df-vol 25675 df-mbf 25829 df-itg1 25830 df-itg2 25831 df-ibl 25832 df-itg 25833 df-0p 25880 df-ditg 26057 df-limc 26076 df-dv 26077

This theorem is used by: ftc2ditg 26256

W3C validator