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

Theorem itgneg 25853
Description: Negation of an integral. (Contributed by Mario Carneiro, 25-Aug-2014.)
Hypotheses
Ref Expression
itgcnval.1 ((𝜑𝑥𝐴) → 𝐵𝑉)
itgcnval.2 (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)
Assertion
Ref Expression
itgneg (𝜑 → -∫𝐴𝐵 d𝑥 = ∫𝐴-𝐵 d𝑥)
Distinct variable groups:   𝑥,𝐴   𝜑,𝑥   𝑥,𝑉
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem itgneg
StepHypRef Expression
1 itgcnval.2 . . . . . . . 8 (𝜑 → (𝑥𝐴𝐵) ∈ 𝐿1)
2 iblmbf 25816 . . . . . . . 8 ((𝑥𝐴𝐵) ∈ 𝐿1 → (𝑥𝐴𝐵) ∈ MblFn)
31, 2syl 17 . . . . . . 7 (𝜑 → (𝑥𝐴𝐵) ∈ MblFn)
4 itgcnval.1 . . . . . . 7 ((𝜑𝑥𝐴) → 𝐵𝑉)
53, 4mbfmptcl 25685 . . . . . 6 ((𝜑𝑥𝐴) → 𝐵 ∈ ℂ)
65recld 15211 . . . . 5 ((𝜑𝑥𝐴) → (ℜ‘𝐵) ∈ ℝ)
75iblcn 25848 . . . . . . 7 (𝜑 → ((𝑥𝐴𝐵) ∈ 𝐿1 ↔ ((𝑥𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿1)))
81, 7mpbid 234 . . . . . 6 (𝜑 → ((𝑥𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿1))
98simpld 498 . . . . 5 (𝜑 → (𝑥𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿1)
106, 9itgcl 25833 . . . 4 (𝜑 → ∫𝐴(ℜ‘𝐵) d𝑥 ∈ ℂ)
11 ax-icn 11125 . . . . 5 i ∈ ℂ
125imcld 15212 . . . . . 6 ((𝜑𝑥𝐴) → (ℑ‘𝐵) ∈ ℝ)
138simprd 499 . . . . . 6 (𝜑 → (𝑥𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿1)
1412, 13itgcl 25833 . . . . 5 (𝜑 → ∫𝐴(ℑ‘𝐵) d𝑥 ∈ ℂ)
15 mulcl 11150 . . . . 5 ((i ∈ ℂ ∧ ∫𝐴(ℑ‘𝐵) d𝑥 ∈ ℂ) → (i · ∫𝐴(ℑ‘𝐵) d𝑥) ∈ ℂ)
1611, 14, 15sylancr 596 . . . 4 (𝜑 → (i · ∫𝐴(ℑ‘𝐵) d𝑥) ∈ ℂ)
1710, 16negdid 11548 . . 3 (𝜑 → -(∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)) = (-∫𝐴(ℜ‘𝐵) d𝑥 + -(i · ∫𝐴(ℑ‘𝐵) d𝑥)))
18 0re 11176 . . . . . . . 8 0 ∈ ℝ
19 ifcl 4523 . . . . . . . 8 (((ℜ‘𝐵) ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) ∈ ℝ)
206, 18, 19sylancl 595 . . . . . . 7 ((𝜑𝑥𝐴) → if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) ∈ ℝ)
216iblre 25843 . . . . . . . . 9 (𝜑 → ((𝑥𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿1 ↔ ((𝑥𝐴 ↦ if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0)) ∈ 𝐿1)))
229, 21mpbid 234 . . . . . . . 8 (𝜑 → ((𝑥𝐴 ↦ if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0)) ∈ 𝐿1))
2322simpld 498 . . . . . . 7 (𝜑 → (𝑥𝐴 ↦ if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0)) ∈ 𝐿1)
2420, 23itgcl 25833 . . . . . 6 (𝜑 → ∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥 ∈ ℂ)
256renegcld 11607 . . . . . . . 8 ((𝜑𝑥𝐴) → -(ℜ‘𝐵) ∈ ℝ)
26 ifcl 4523 . . . . . . . 8 ((-(ℜ‘𝐵) ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) ∈ ℝ)
2725, 18, 26sylancl 595 . . . . . . 7 ((𝜑𝑥𝐴) → if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) ∈ ℝ)
2822simprd 499 . . . . . . 7 (𝜑 → (𝑥𝐴 ↦ if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0)) ∈ 𝐿1)
2927, 28itgcl 25833 . . . . . 6 (𝜑 → ∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥 ∈ ℂ)
3024, 29negsubdi2d 11551 . . . . 5 (𝜑 → -(∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥) = (∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥))
316, 9itgreval 25846 . . . . . 6 (𝜑 → ∫𝐴(ℜ‘𝐵) d𝑥 = (∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥))
3231negeqd 11417 . . . . 5 (𝜑 → -∫𝐴(ℜ‘𝐵) d𝑥 = -(∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥))
335negcld 11522 . . . . . . . 8 ((𝜑𝑥𝐴) → -𝐵 ∈ ℂ)
3433recld 15211 . . . . . . 7 ((𝜑𝑥𝐴) → (ℜ‘-𝐵) ∈ ℝ)
354, 1iblneg 25852 . . . . . . . . 9 (𝜑 → (𝑥𝐴 ↦ -𝐵) ∈ 𝐿1)
3633iblcn 25848 . . . . . . . . 9 (𝜑 → ((𝑥𝐴 ↦ -𝐵) ∈ 𝐿1 ↔ ((𝑥𝐴 ↦ (ℜ‘-𝐵)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ (ℑ‘-𝐵)) ∈ 𝐿1)))
3735, 36mpbid 234 . . . . . . . 8 (𝜑 → ((𝑥𝐴 ↦ (ℜ‘-𝐵)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ (ℑ‘-𝐵)) ∈ 𝐿1))
3837simpld 498 . . . . . . 7 (𝜑 → (𝑥𝐴 ↦ (ℜ‘-𝐵)) ∈ 𝐿1)
3934, 38itgreval 25846 . . . . . 6 (𝜑 → ∫𝐴(ℜ‘-𝐵) d𝑥 = (∫𝐴if(0 ≤ (ℜ‘-𝐵), (ℜ‘-𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℜ‘-𝐵), -(ℜ‘-𝐵), 0) d𝑥))
405renegd 15226 . . . . . . . . . 10 ((𝜑𝑥𝐴) → (ℜ‘-𝐵) = -(ℜ‘𝐵))
4140breq2d 5109 . . . . . . . . 9 ((𝜑𝑥𝐴) → (0 ≤ (ℜ‘-𝐵) ↔ 0 ≤ -(ℜ‘𝐵)))
4241, 40ifbieq1d 4502 . . . . . . . 8 ((𝜑𝑥𝐴) → if(0 ≤ (ℜ‘-𝐵), (ℜ‘-𝐵), 0) = if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0))
4342itgeq2dv 25831 . . . . . . 7 (𝜑 → ∫𝐴if(0 ≤ (ℜ‘-𝐵), (ℜ‘-𝐵), 0) d𝑥 = ∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥)
4440negeqd 11417 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → -(ℜ‘-𝐵) = --(ℜ‘𝐵))
456recnd 11203 . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → (ℜ‘𝐵) ∈ ℂ)
4645negnegd 11526 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → --(ℜ‘𝐵) = (ℜ‘𝐵))
4744, 46eqtrd 2796 . . . . . . . . . 10 ((𝜑𝑥𝐴) → -(ℜ‘-𝐵) = (ℜ‘𝐵))
4847breq2d 5109 . . . . . . . . 9 ((𝜑𝑥𝐴) → (0 ≤ -(ℜ‘-𝐵) ↔ 0 ≤ (ℜ‘𝐵)))
4948, 47ifbieq1d 4502 . . . . . . . 8 ((𝜑𝑥𝐴) → if(0 ≤ -(ℜ‘-𝐵), -(ℜ‘-𝐵), 0) = if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0))
5049itgeq2dv 25831 . . . . . . 7 (𝜑 → ∫𝐴if(0 ≤ -(ℜ‘-𝐵), -(ℜ‘-𝐵), 0) d𝑥 = ∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥)
5143, 50oveq12d 7408 . . . . . 6 (𝜑 → (∫𝐴if(0 ≤ (ℜ‘-𝐵), (ℜ‘-𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℜ‘-𝐵), -(ℜ‘-𝐵), 0) d𝑥) = (∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥))
5239, 51eqtrd 2796 . . . . 5 (𝜑 → ∫𝐴(ℜ‘-𝐵) d𝑥 = (∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥))
5330, 32, 523eqtr4d 2806 . . . 4 (𝜑 → -∫𝐴(ℜ‘𝐵) d𝑥 = ∫𝐴(ℜ‘-𝐵) d𝑥)
54 mulneg2 11617 . . . . . 6 ((i ∈ ℂ ∧ ∫𝐴(ℑ‘𝐵) d𝑥 ∈ ℂ) → (i · -∫𝐴(ℑ‘𝐵) d𝑥) = -(i · ∫𝐴(ℑ‘𝐵) d𝑥))
5511, 14, 54sylancr 596 . . . . 5 (𝜑 → (i · -∫𝐴(ℑ‘𝐵) d𝑥) = -(i · ∫𝐴(ℑ‘𝐵) d𝑥))
56 ifcl 4523 . . . . . . . . . . 11 (((ℑ‘𝐵) ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) ∈ ℝ)
5712, 18, 56sylancl 595 . . . . . . . . . 10 ((𝜑𝑥𝐴) → if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) ∈ ℝ)
5812iblre 25843 . . . . . . . . . . . 12 (𝜑 → ((𝑥𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿1 ↔ ((𝑥𝐴 ↦ if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0)) ∈ 𝐿1)))
5913, 58mpbid 234 . . . . . . . . . . 11 (𝜑 → ((𝑥𝐴 ↦ if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0)) ∈ 𝐿1))
6059simpld 498 . . . . . . . . . 10 (𝜑 → (𝑥𝐴 ↦ if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0)) ∈ 𝐿1)
6157, 60itgcl 25833 . . . . . . . . 9 (𝜑 → ∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥 ∈ ℂ)
6212renegcld 11607 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → -(ℑ‘𝐵) ∈ ℝ)
63 ifcl 4523 . . . . . . . . . . 11 ((-(ℑ‘𝐵) ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) ∈ ℝ)
6462, 18, 63sylancl 595 . . . . . . . . . 10 ((𝜑𝑥𝐴) → if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) ∈ ℝ)
6559simprd 499 . . . . . . . . . 10 (𝜑 → (𝑥𝐴 ↦ if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0)) ∈ 𝐿1)
6664, 65itgcl 25833 . . . . . . . . 9 (𝜑 → ∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥 ∈ ℂ)
6761, 66negsubdi2d 11551 . . . . . . . 8 (𝜑 → -(∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥) = (∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥))
685imnegd 15227 . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → (ℑ‘-𝐵) = -(ℑ‘𝐵))
6968breq2d 5109 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → (0 ≤ (ℑ‘-𝐵) ↔ 0 ≤ -(ℑ‘𝐵)))
7069, 68ifbieq1d 4502 . . . . . . . . . 10 ((𝜑𝑥𝐴) → if(0 ≤ (ℑ‘-𝐵), (ℑ‘-𝐵), 0) = if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0))
7170itgeq2dv 25831 . . . . . . . . 9 (𝜑 → ∫𝐴if(0 ≤ (ℑ‘-𝐵), (ℑ‘-𝐵), 0) d𝑥 = ∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥)
7268negeqd 11417 . . . . . . . . . . . . 13 ((𝜑𝑥𝐴) → -(ℑ‘-𝐵) = --(ℑ‘𝐵))
7312recnd 11203 . . . . . . . . . . . . . 14 ((𝜑𝑥𝐴) → (ℑ‘𝐵) ∈ ℂ)
7473negnegd 11526 . . . . . . . . . . . . 13 ((𝜑𝑥𝐴) → --(ℑ‘𝐵) = (ℑ‘𝐵))
7572, 74eqtrd 2796 . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → -(ℑ‘-𝐵) = (ℑ‘𝐵))
7675breq2d 5109 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → (0 ≤ -(ℑ‘-𝐵) ↔ 0 ≤ (ℑ‘𝐵)))
7776, 75ifbieq1d 4502 . . . . . . . . . 10 ((𝜑𝑥𝐴) → if(0 ≤ -(ℑ‘-𝐵), -(ℑ‘-𝐵), 0) = if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0))
7877itgeq2dv 25831 . . . . . . . . 9 (𝜑 → ∫𝐴if(0 ≤ -(ℑ‘-𝐵), -(ℑ‘-𝐵), 0) d𝑥 = ∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥)
7971, 78oveq12d 7408 . . . . . . . 8 (𝜑 → (∫𝐴if(0 ≤ (ℑ‘-𝐵), (ℑ‘-𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℑ‘-𝐵), -(ℑ‘-𝐵), 0) d𝑥) = (∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥))
8067, 79eqtr4d 2799 . . . . . . 7 (𝜑 → -(∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥) = (∫𝐴if(0 ≤ (ℑ‘-𝐵), (ℑ‘-𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℑ‘-𝐵), -(ℑ‘-𝐵), 0) d𝑥))
8112, 13itgreval 25846 . . . . . . . 8 (𝜑 → ∫𝐴(ℑ‘𝐵) d𝑥 = (∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥))
8281negeqd 11417 . . . . . . 7 (𝜑 → -∫𝐴(ℑ‘𝐵) d𝑥 = -(∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥))
8333imcld 15212 . . . . . . . 8 ((𝜑𝑥𝐴) → (ℑ‘-𝐵) ∈ ℝ)
8437simprd 499 . . . . . . . 8 (𝜑 → (𝑥𝐴 ↦ (ℑ‘-𝐵)) ∈ 𝐿1)
8583, 84itgreval 25846 . . . . . . 7 (𝜑 → ∫𝐴(ℑ‘-𝐵) d𝑥 = (∫𝐴if(0 ≤ (ℑ‘-𝐵), (ℑ‘-𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℑ‘-𝐵), -(ℑ‘-𝐵), 0) d𝑥))
8680, 82, 853eqtr4d 2806 . . . . . 6 (𝜑 → -∫𝐴(ℑ‘𝐵) d𝑥 = ∫𝐴(ℑ‘-𝐵) d𝑥)
8786oveq2d 7406 . . . . 5 (𝜑 → (i · -∫𝐴(ℑ‘𝐵) d𝑥) = (i · ∫𝐴(ℑ‘-𝐵) d𝑥))
8855, 87eqtr3d 2798 . . . 4 (𝜑 → -(i · ∫𝐴(ℑ‘𝐵) d𝑥) = (i · ∫𝐴(ℑ‘-𝐵) d𝑥))
8953, 88oveq12d 7408 . . 3 (𝜑 → (-∫𝐴(ℜ‘𝐵) d𝑥 + -(i · ∫𝐴(ℑ‘𝐵) d𝑥)) = (∫𝐴(ℜ‘-𝐵) d𝑥 + (i · ∫𝐴(ℑ‘-𝐵) d𝑥)))
9017, 89eqtrd 2796 . 2 (𝜑 → -(∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)) = (∫𝐴(ℜ‘-𝐵) d𝑥 + (i · ∫𝐴(ℑ‘-𝐵) d𝑥)))
914, 1itgcnval 25849 . . 3 (𝜑 → ∫𝐴𝐵 d𝑥 = (∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)))
9291negeqd 11417 . 2 (𝜑 → -∫𝐴𝐵 d𝑥 = -(∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)))
9333, 35itgcnval 25849 . 2 (𝜑 → ∫𝐴-𝐵 d𝑥 = (∫𝐴(ℜ‘-𝐵) d𝑥 + (i · ∫𝐴(ℑ‘-𝐵) d𝑥)))
9490, 92, 933eqtr4d 2806 1 (𝜑 → -∫𝐴𝐵 d𝑥 = ∫𝐴-𝐵 d𝑥)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  ifcif 4477   class class class wbr 5097  cmpt 5178  cfv 6515  (class class class)co 7390  cc 11064  cr 11065  0cc0 11066  ici 11068   + caddc 11069   · cmul 11071  cle 11210  cmin 11407  -cneg 11408  cre 15114  cim 15115  MblFncmbf 25663  𝐿1cibl 25666  citg 25667
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7712  ax-inf2 9589  ax-cnex 11122  ax-resscn 11123  ax-1cn 11124  ax-icn 11125  ax-addcl 11126  ax-addrcl 11127  ax-mulcl 11128  ax-mulrcl 11129  ax-mulcom 11130  ax-addass 11131  ax-mulass 11132  ax-distr 11133  ax-i2m1 11134  ax-1ne0 11135  ax-1rid 11136  ax-rnegex 11137  ax-rrecex 11138  ax-cnre 11139  ax-pre-lttri 11140  ax-pre-lttrn 11141  ax-pre-ltadd 11142  ax-pre-mulgt0 11143  ax-pre-sup 11144  ax-addf 11145
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3061  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-int 4903  df-iun 4948  df-disj 5065  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5538  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-se 5597  df-we 5598  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-pred 6282  df-ord 6343  df-on 6344  df-lim 6345  df-suc 6346  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-f1 6520  df-fo 6521  df-f1o 6522  df-fv 6523  df-isom 6524  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-of 7654  df-ofr 7655  df-om 7841  df-1st 7964  df-2nd 7965  df-frecs 8255  df-wrecs 8286  df-recs 8335  df-rdg 8374  df-1o 8430  df-2o 8431  df-er 8671  df-map 8803  df-pm 8804  df-en 8921  df-dom 8922  df-sdom 8923  df-fin 8924  df-sup 9381  df-inf 9382  df-oi 9451  df-dju 9852  df-card 9890  df-pnf 11211  df-mnf 11212  df-xr 11213  df-ltxr 11214  df-le 11215  df-sub 11409  df-neg 11410  df-div 11838  df-nn 12204  df-2 12273  df-3 12274  df-4 12275  df-n0 12475  df-z 12562  df-uz 12833  df-q 12943  df-rp 12987  df-xadd 13108  df-ioo 13346  df-ico 13348  df-icc 13349  df-fz 13506  df-fzo 13653  df-fl 13795  df-mod 13873  df-seq 14008  df-exp 14068  df-hash 14337  df-cj 15116  df-re 15117  df-im 15118  df-sqrt 15252  df-abs 15253  df-clim 15505  df-sum 15704  df-xmet 21404  df-met 21405  df-ovol 25513  df-vol 25514  df-mbf 25668  df-itg1 25669  df-itg2 25670  df-ibl 25671  df-itg 25672  df-0p 25719
This theorem is referenced by:  itgsub  25875  itgsubnc  38141  itgmulc2nc  38147  sqwvfourb  46763
  Copyright terms: Public domain W3C validator