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

Theorem itgneg 24949
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 24913 . . . . . . . 8 ((𝑥𝐴𝐵) ∈ 𝐿1 → (𝑥𝐴𝐵) ∈ MblFn)
31, 2syl 17 . . . . . . 7 (𝜑 → (𝑥𝐴𝐵) ∈ MblFn)
4 itgcnval.1 . . . . . . 7 ((𝜑𝑥𝐴) → 𝐵𝑉)
53, 4mbfmptcl 24781 . . . . . 6 ((𝜑𝑥𝐴) → 𝐵 ∈ ℂ)
65recld 14886 . . . . 5 ((𝜑𝑥𝐴) → (ℜ‘𝐵) ∈ ℝ)
75iblcn 24944 . . . . . . 7 (𝜑 → ((𝑥𝐴𝐵) ∈ 𝐿1 ↔ ((𝑥𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿1)))
81, 7mpbid 231 . . . . . 6 (𝜑 → ((𝑥𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿1))
98simpld 494 . . . . 5 (𝜑 → (𝑥𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿1)
106, 9itgcl 24929 . . . 4 (𝜑 → ∫𝐴(ℜ‘𝐵) d𝑥 ∈ ℂ)
11 ax-icn 10914 . . . . 5 i ∈ ℂ
125imcld 14887 . . . . . 6 ((𝜑𝑥𝐴) → (ℑ‘𝐵) ∈ ℝ)
138simprd 495 . . . . . 6 (𝜑 → (𝑥𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿1)
1412, 13itgcl 24929 . . . . 5 (𝜑 → ∫𝐴(ℑ‘𝐵) d𝑥 ∈ ℂ)
15 mulcl 10939 . . . . 5 ((i ∈ ℂ ∧ ∫𝐴(ℑ‘𝐵) d𝑥 ∈ ℂ) → (i · ∫𝐴(ℑ‘𝐵) d𝑥) ∈ ℂ)
1611, 14, 15sylancr 586 . . . 4 (𝜑 → (i · ∫𝐴(ℑ‘𝐵) d𝑥) ∈ ℂ)
1710, 16negdid 11328 . . 3 (𝜑 → -(∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)) = (-∫𝐴(ℜ‘𝐵) d𝑥 + -(i · ∫𝐴(ℑ‘𝐵) d𝑥)))
18 0re 10961 . . . . . . . 8 0 ∈ ℝ
19 ifcl 4509 . . . . . . . 8 (((ℜ‘𝐵) ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) ∈ ℝ)
206, 18, 19sylancl 585 . . . . . . 7 ((𝜑𝑥𝐴) → if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) ∈ ℝ)
216iblre 24939 . . . . . . . . 9 (𝜑 → ((𝑥𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿1 ↔ ((𝑥𝐴 ↦ if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0)) ∈ 𝐿1)))
229, 21mpbid 231 . . . . . . . 8 (𝜑 → ((𝑥𝐴 ↦ if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0)) ∈ 𝐿1))
2322simpld 494 . . . . . . 7 (𝜑 → (𝑥𝐴 ↦ if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0)) ∈ 𝐿1)
2420, 23itgcl 24929 . . . . . 6 (𝜑 → ∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥 ∈ ℂ)
256renegcld 11385 . . . . . . . 8 ((𝜑𝑥𝐴) → -(ℜ‘𝐵) ∈ ℝ)
26 ifcl 4509 . . . . . . . 8 ((-(ℜ‘𝐵) ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) ∈ ℝ)
2725, 18, 26sylancl 585 . . . . . . 7 ((𝜑𝑥𝐴) → if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) ∈ ℝ)
2822simprd 495 . . . . . . 7 (𝜑 → (𝑥𝐴 ↦ if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0)) ∈ 𝐿1)
2927, 28itgcl 24929 . . . . . 6 (𝜑 → ∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥 ∈ ℂ)
3024, 29negsubdi2d 11331 . . . . 5 (𝜑 → -(∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥) = (∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥))
316, 9itgreval 24942 . . . . . 6 (𝜑 → ∫𝐴(ℜ‘𝐵) d𝑥 = (∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥))
3231negeqd 11198 . . . . 5 (𝜑 → -∫𝐴(ℜ‘𝐵) d𝑥 = -(∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥))
335negcld 11302 . . . . . . . 8 ((𝜑𝑥𝐴) → -𝐵 ∈ ℂ)
3433recld 14886 . . . . . . 7 ((𝜑𝑥𝐴) → (ℜ‘-𝐵) ∈ ℝ)
354, 1iblneg 24948 . . . . . . . . 9 (𝜑 → (𝑥𝐴 ↦ -𝐵) ∈ 𝐿1)
3633iblcn 24944 . . . . . . . . 9 (𝜑 → ((𝑥𝐴 ↦ -𝐵) ∈ 𝐿1 ↔ ((𝑥𝐴 ↦ (ℜ‘-𝐵)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ (ℑ‘-𝐵)) ∈ 𝐿1)))
3735, 36mpbid 231 . . . . . . . 8 (𝜑 → ((𝑥𝐴 ↦ (ℜ‘-𝐵)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ (ℑ‘-𝐵)) ∈ 𝐿1))
3837simpld 494 . . . . . . 7 (𝜑 → (𝑥𝐴 ↦ (ℜ‘-𝐵)) ∈ 𝐿1)
3934, 38itgreval 24942 . . . . . 6 (𝜑 → ∫𝐴(ℜ‘-𝐵) d𝑥 = (∫𝐴if(0 ≤ (ℜ‘-𝐵), (ℜ‘-𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℜ‘-𝐵), -(ℜ‘-𝐵), 0) d𝑥))
405renegd 14901 . . . . . . . . . 10 ((𝜑𝑥𝐴) → (ℜ‘-𝐵) = -(ℜ‘𝐵))
4140breq2d 5090 . . . . . . . . 9 ((𝜑𝑥𝐴) → (0 ≤ (ℜ‘-𝐵) ↔ 0 ≤ -(ℜ‘𝐵)))
4241, 40ifbieq1d 4488 . . . . . . . 8 ((𝜑𝑥𝐴) → if(0 ≤ (ℜ‘-𝐵), (ℜ‘-𝐵), 0) = if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0))
4342itgeq2dv 24927 . . . . . . 7 (𝜑 → ∫𝐴if(0 ≤ (ℜ‘-𝐵), (ℜ‘-𝐵), 0) d𝑥 = ∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥)
4440negeqd 11198 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → -(ℜ‘-𝐵) = --(ℜ‘𝐵))
456recnd 10987 . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → (ℜ‘𝐵) ∈ ℂ)
4645negnegd 11306 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → --(ℜ‘𝐵) = (ℜ‘𝐵))
4744, 46eqtrd 2779 . . . . . . . . . 10 ((𝜑𝑥𝐴) → -(ℜ‘-𝐵) = (ℜ‘𝐵))
4847breq2d 5090 . . . . . . . . 9 ((𝜑𝑥𝐴) → (0 ≤ -(ℜ‘-𝐵) ↔ 0 ≤ (ℜ‘𝐵)))
4948, 47ifbieq1d 4488 . . . . . . . 8 ((𝜑𝑥𝐴) → if(0 ≤ -(ℜ‘-𝐵), -(ℜ‘-𝐵), 0) = if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0))
5049itgeq2dv 24927 . . . . . . 7 (𝜑 → ∫𝐴if(0 ≤ -(ℜ‘-𝐵), -(ℜ‘-𝐵), 0) d𝑥 = ∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥)
5143, 50oveq12d 7286 . . . . . 6 (𝜑 → (∫𝐴if(0 ≤ (ℜ‘-𝐵), (ℜ‘-𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℜ‘-𝐵), -(ℜ‘-𝐵), 0) d𝑥) = (∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥))
5239, 51eqtrd 2779 . . . . 5 (𝜑 → ∫𝐴(ℜ‘-𝐵) d𝑥 = (∫𝐴if(0 ≤ -(ℜ‘𝐵), -(ℜ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ (ℜ‘𝐵), (ℜ‘𝐵), 0) d𝑥))
5330, 32, 523eqtr4d 2789 . . . 4 (𝜑 → -∫𝐴(ℜ‘𝐵) d𝑥 = ∫𝐴(ℜ‘-𝐵) d𝑥)
54 mulneg2 11395 . . . . . 6 ((i ∈ ℂ ∧ ∫𝐴(ℑ‘𝐵) d𝑥 ∈ ℂ) → (i · -∫𝐴(ℑ‘𝐵) d𝑥) = -(i · ∫𝐴(ℑ‘𝐵) d𝑥))
5511, 14, 54sylancr 586 . . . . 5 (𝜑 → (i · -∫𝐴(ℑ‘𝐵) d𝑥) = -(i · ∫𝐴(ℑ‘𝐵) d𝑥))
56 ifcl 4509 . . . . . . . . . . 11 (((ℑ‘𝐵) ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) ∈ ℝ)
5712, 18, 56sylancl 585 . . . . . . . . . 10 ((𝜑𝑥𝐴) → if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) ∈ ℝ)
5812iblre 24939 . . . . . . . . . . . 12 (𝜑 → ((𝑥𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿1 ↔ ((𝑥𝐴 ↦ if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0)) ∈ 𝐿1)))
5913, 58mpbid 231 . . . . . . . . . . 11 (𝜑 → ((𝑥𝐴 ↦ if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0)) ∈ 𝐿1 ∧ (𝑥𝐴 ↦ if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0)) ∈ 𝐿1))
6059simpld 494 . . . . . . . . . 10 (𝜑 → (𝑥𝐴 ↦ if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0)) ∈ 𝐿1)
6157, 60itgcl 24929 . . . . . . . . 9 (𝜑 → ∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥 ∈ ℂ)
6212renegcld 11385 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → -(ℑ‘𝐵) ∈ ℝ)
63 ifcl 4509 . . . . . . . . . . 11 ((-(ℑ‘𝐵) ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) ∈ ℝ)
6462, 18, 63sylancl 585 . . . . . . . . . 10 ((𝜑𝑥𝐴) → if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) ∈ ℝ)
6559simprd 495 . . . . . . . . . 10 (𝜑 → (𝑥𝐴 ↦ if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0)) ∈ 𝐿1)
6664, 65itgcl 24929 . . . . . . . . 9 (𝜑 → ∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥 ∈ ℂ)
6761, 66negsubdi2d 11331 . . . . . . . 8 (𝜑 → -(∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥) = (∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥))
685imnegd 14902 . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → (ℑ‘-𝐵) = -(ℑ‘𝐵))
6968breq2d 5090 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → (0 ≤ (ℑ‘-𝐵) ↔ 0 ≤ -(ℑ‘𝐵)))
7069, 68ifbieq1d 4488 . . . . . . . . . 10 ((𝜑𝑥𝐴) → if(0 ≤ (ℑ‘-𝐵), (ℑ‘-𝐵), 0) = if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0))
7170itgeq2dv 24927 . . . . . . . . 9 (𝜑 → ∫𝐴if(0 ≤ (ℑ‘-𝐵), (ℑ‘-𝐵), 0) d𝑥 = ∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥)
7268negeqd 11198 . . . . . . . . . . . . 13 ((𝜑𝑥𝐴) → -(ℑ‘-𝐵) = --(ℑ‘𝐵))
7312recnd 10987 . . . . . . . . . . . . . 14 ((𝜑𝑥𝐴) → (ℑ‘𝐵) ∈ ℂ)
7473negnegd 11306 . . . . . . . . . . . . 13 ((𝜑𝑥𝐴) → --(ℑ‘𝐵) = (ℑ‘𝐵))
7572, 74eqtrd 2779 . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → -(ℑ‘-𝐵) = (ℑ‘𝐵))
7675breq2d 5090 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → (0 ≤ -(ℑ‘-𝐵) ↔ 0 ≤ (ℑ‘𝐵)))
7776, 75ifbieq1d 4488 . . . . . . . . . 10 ((𝜑𝑥𝐴) → if(0 ≤ -(ℑ‘-𝐵), -(ℑ‘-𝐵), 0) = if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0))
7877itgeq2dv 24927 . . . . . . . . 9 (𝜑 → ∫𝐴if(0 ≤ -(ℑ‘-𝐵), -(ℑ‘-𝐵), 0) d𝑥 = ∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥)
7971, 78oveq12d 7286 . . . . . . . 8 (𝜑 → (∫𝐴if(0 ≤ (ℑ‘-𝐵), (ℑ‘-𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℑ‘-𝐵), -(ℑ‘-𝐵), 0) d𝑥) = (∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥))
8067, 79eqtr4d 2782 . . . . . . 7 (𝜑 → -(∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥) = (∫𝐴if(0 ≤ (ℑ‘-𝐵), (ℑ‘-𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℑ‘-𝐵), -(ℑ‘-𝐵), 0) d𝑥))
8112, 13itgreval 24942 . . . . . . . 8 (𝜑 → ∫𝐴(ℑ‘𝐵) d𝑥 = (∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥))
8281negeqd 11198 . . . . . . 7 (𝜑 → -∫𝐴(ℑ‘𝐵) d𝑥 = -(∫𝐴if(0 ≤ (ℑ‘𝐵), (ℑ‘𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℑ‘𝐵), -(ℑ‘𝐵), 0) d𝑥))
8333imcld 14887 . . . . . . . 8 ((𝜑𝑥𝐴) → (ℑ‘-𝐵) ∈ ℝ)
8437simprd 495 . . . . . . . 8 (𝜑 → (𝑥𝐴 ↦ (ℑ‘-𝐵)) ∈ 𝐿1)
8583, 84itgreval 24942 . . . . . . 7 (𝜑 → ∫𝐴(ℑ‘-𝐵) d𝑥 = (∫𝐴if(0 ≤ (ℑ‘-𝐵), (ℑ‘-𝐵), 0) d𝑥 − ∫𝐴if(0 ≤ -(ℑ‘-𝐵), -(ℑ‘-𝐵), 0) d𝑥))
8680, 82, 853eqtr4d 2789 . . . . . 6 (𝜑 → -∫𝐴(ℑ‘𝐵) d𝑥 = ∫𝐴(ℑ‘-𝐵) d𝑥)
8786oveq2d 7284 . . . . 5 (𝜑 → (i · -∫𝐴(ℑ‘𝐵) d𝑥) = (i · ∫𝐴(ℑ‘-𝐵) d𝑥))
8855, 87eqtr3d 2781 . . . 4 (𝜑 → -(i · ∫𝐴(ℑ‘𝐵) d𝑥) = (i · ∫𝐴(ℑ‘-𝐵) d𝑥))
8953, 88oveq12d 7286 . . 3 (𝜑 → (-∫𝐴(ℜ‘𝐵) d𝑥 + -(i · ∫𝐴(ℑ‘𝐵) d𝑥)) = (∫𝐴(ℜ‘-𝐵) d𝑥 + (i · ∫𝐴(ℑ‘-𝐵) d𝑥)))
9017, 89eqtrd 2779 . 2 (𝜑 → -(∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)) = (∫𝐴(ℜ‘-𝐵) d𝑥 + (i · ∫𝐴(ℑ‘-𝐵) d𝑥)))
914, 1itgcnval 24945 . . 3 (𝜑 → ∫𝐴𝐵 d𝑥 = (∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)))
9291negeqd 11198 . 2 (𝜑 → -∫𝐴𝐵 d𝑥 = -(∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)))
9333, 35itgcnval 24945 . 2 (𝜑 → ∫𝐴-𝐵 d𝑥 = (∫𝐴(ℜ‘-𝐵) d𝑥 + (i · ∫𝐴(ℑ‘-𝐵) d𝑥)))
9490, 92, 933eqtr4d 2789 1 (𝜑 → -∫𝐴𝐵 d𝑥 = ∫𝐴-𝐵 d𝑥)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2109  ifcif 4464   class class class wbr 5078  cmpt 5161  cfv 6430  (class class class)co 7268  cc 10853  cr 10854  0cc0 10855  ici 10857   + caddc 10858   · cmul 10860  cle 10994  cmin 11188  -cneg 11189  cre 14789  cim 14790  MblFncmbf 24759  𝐿1cibl 24762  citg 24763
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-rep 5213  ax-sep 5226  ax-nul 5233  ax-pow 5291  ax-pr 5355  ax-un 7579  ax-inf2 9360  ax-cnex 10911  ax-resscn 10912  ax-1cn 10913  ax-icn 10914  ax-addcl 10915  ax-addrcl 10916  ax-mulcl 10917  ax-mulrcl 10918  ax-mulcom 10919  ax-addass 10920  ax-mulass 10921  ax-distr 10922  ax-i2m1 10923  ax-1ne0 10924  ax-1rid 10925  ax-rnegex 10926  ax-rrecex 10927  ax-cnre 10928  ax-pre-lttri 10929  ax-pre-lttrn 10930  ax-pre-ltadd 10931  ax-pre-mulgt0 10932  ax-pre-sup 10933  ax-addf 10934
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ne 2945  df-nel 3051  df-ral 3070  df-rex 3071  df-reu 3072  df-rmo 3073  df-rab 3074  df-v 3432  df-sbc 3720  df-csb 3837  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-pss 3910  df-nul 4262  df-if 4465  df-pw 4540  df-sn 4567  df-pr 4569  df-tp 4571  df-op 4573  df-uni 4845  df-int 4885  df-iun 4931  df-disj 5044  df-br 5079  df-opab 5141  df-mpt 5162  df-tr 5196  df-id 5488  df-eprel 5494  df-po 5502  df-so 5503  df-fr 5543  df-se 5544  df-we 5545  df-xp 5594  df-rel 5595  df-cnv 5596  df-co 5597  df-dm 5598  df-rn 5599  df-res 5600  df-ima 5601  df-pred 6199  df-ord 6266  df-on 6267  df-lim 6268  df-suc 6269  df-iota 6388  df-fun 6432  df-fn 6433  df-f 6434  df-f1 6435  df-fo 6436  df-f1o 6437  df-fv 6438  df-isom 6439  df-riota 7225  df-ov 7271  df-oprab 7272  df-mpo 7273  df-of 7524  df-ofr 7525  df-om 7701  df-1st 7817  df-2nd 7818  df-frecs 8081  df-wrecs 8112  df-recs 8186  df-rdg 8225  df-1o 8281  df-2o 8282  df-er 8472  df-map 8591  df-pm 8592  df-en 8708  df-dom 8709  df-sdom 8710  df-fin 8711  df-sup 9162  df-inf 9163  df-oi 9230  df-dju 9643  df-card 9681  df-pnf 10995  df-mnf 10996  df-xr 10997  df-ltxr 10998  df-le 10999  df-sub 11190  df-neg 11191  df-div 11616  df-nn 11957  df-2 12019  df-3 12020  df-4 12021  df-n0 12217  df-z 12303  df-uz 12565  df-q 12671  df-rp 12713  df-xadd 12831  df-ioo 13065  df-ico 13067  df-icc 13068  df-fz 13222  df-fzo 13365  df-fl 13493  df-mod 13571  df-seq 13703  df-exp 13764  df-hash 14026  df-cj 14791  df-re 14792  df-im 14793  df-sqrt 14927  df-abs 14928  df-clim 15178  df-sum 15379  df-xmet 20571  df-met 20572  df-ovol 24609  df-vol 24610  df-mbf 24764  df-itg1 24765  df-itg2 24766  df-ibl 24767  df-itg 24768  df-0p 24815
This theorem is referenced by:  itgsub  24971  itgsubnc  35818  itgmulc2nc  35824  sqwvfourb  43724
  Copyright terms: Public domain W3C validator