Metamath Proof Explorer


Theorem fourierdlem82

Description: Integral by substitution, adding a constant to the function's argument, for a function on an open interval with finite limits ad boundary points. (Contributed by Glauco Siliprandi, 11-Dec-2019)

Ref Expression
Hypotheses fourierdlem82.1 ⊢ G = x ∈ A B ⟼ if x = A R if x = B L F ↾ A B ⁡ x
fourierdlem82.2 ⊢ φ → A ∈ ℝ
fourierdlem82.3 ⊢ φ → B ∈ ℝ
fourierdlem82.4 ⊢ φ → A < B
fourierdlem82.5 ⊢ φ → F : A B ⟶ ℂ
fourierdlem82.6 ⊢ φ → F ↾ A B : A B ⟶cn ℂ
fourierdlem82.7 ⊢ φ → L ∈ F lim ℂ B
fourierdlem82.8 ⊢ φ → R ∈ F lim ℂ A
fourierdlem82.9 ⊢ φ → X ∈ ℝ
Assertion fourierdlem82 ⊢ φ → ∫ A B F ⁡ t dt = ∫ A − X B − X F ⁡ X + t dt

Proof

Step Hyp Ref Expression
1 fourierdlem82.1 ⊢ G = x ∈ A B ⟼ if x = A R if x = B L F ↾ A B ⁡ x
2 fourierdlem82.2 ⊢ φ → A ∈ ℝ
3 fourierdlem82.3 ⊢ φ → B ∈ ℝ
4 fourierdlem82.4 ⊢ φ → A < B
5 fourierdlem82.5 ⊢ φ → F : A B ⟶ ℂ
6 fourierdlem82.6 ⊢ φ → F ↾ A B : A B ⟶cn ℂ
7 fourierdlem82.7 ⊢ φ → L ∈ F lim ℂ B
8 fourierdlem82.8 ⊢ φ → R ∈ F lim ℂ A
9 fourierdlem82.9 ⊢ φ → X ∈ ℝ
10 2 3 4 ltled ⊢ φ → A ≤ B
11 2 3 9 10 lesub1dd ⊢ φ → A − X ≤ B − X
12 11 ditgpos ⊢ φ → ∫ A − X B − X G ⁡ X + t dt = ∫ A − X B − X G ⁡ X + t dt
13 iftrue ⊢ x = A → if x = A R if x = B L F ↾ A B ⁡ x = R
14 13 adantl ⊢ φ ∧ x = A → if x = A R if x = B L F ↾ A B ⁡ x = R
15 iftrue ⊢ x = A → if x = A R if x = B L F ⁡ x = R
16 15 adantl ⊢ φ ∧ x = A → if x = A R if x = B L F ⁡ x = R
17 14 16 eqtr4d ⊢ φ ∧ x = A → if x = A R if x = B L F ↾ A B ⁡ x = if x = A R if x = B L F ⁡ x
18 17 adantlr ⊢ φ ∧ x ∈ A B ∧ x = A → if x = A R if x = B L F ↾ A B ⁡ x = if x = A R if x = B L F ⁡ x
19 iffalse ⊢ ¬ x = A → if x = A R if x = B L F ↾ A B ⁡ x = if x = B L F ↾ A B ⁡ x
20 iftrue ⊢ x = B → if x = B L F ↾ A B ⁡ x = L
21 19 20 sylan9eq ⊢ ¬ x = A ∧ x = B → if x = A R if x = B L F ↾ A B ⁡ x = L
22 21 adantll ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ x = B → if x = A R if x = B L F ↾ A B ⁡ x = L
23 iffalse ⊢ ¬ x = A → if x = A R if x = B L F ⁡ x = if x = B L F ⁡ x
24 iftrue ⊢ x = B → if x = B L F ⁡ x = L
25 23 24 sylan9eq ⊢ ¬ x = A ∧ x = B → if x = A R if x = B L F ⁡ x = L
26 25 adantll ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ x = B → if x = A R if x = B L F ⁡ x = L
27 22 26 eqtr4d ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ x = B → if x = A R if x = B L F ↾ A B ⁡ x = if x = A R if x = B L F ⁡ x
28 iffalse ⊢ ¬ x = B → if x = B L F ↾ A B ⁡ x = F ↾ A B ⁡ x
29 28 adantl ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ ¬ x = B → if x = B L F ↾ A B ⁡ x = F ↾ A B ⁡ x
30 19 ad2antlr ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ ¬ x = B → if x = A R if x = B L F ↾ A B ⁡ x = if x = B L F ↾ A B ⁡ x
31 iffalse ⊢ ¬ x = B → if x = B L F ⁡ x = F ⁡ x
32 31 adantl ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ ¬ x = B → if x = B L F ⁡ x = F ⁡ x
33 23 ad2antlr ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ ¬ x = B → if x = A R if x = B L F ⁡ x = if x = B L F ⁡ x
34 2 rexrd ⊢ φ → A ∈ ℝ *
35 34 ad3antrrr ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ ¬ x = B → A ∈ ℝ *
36 3 rexrd ⊢ φ → B ∈ ℝ *
37 36 ad3antrrr ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ ¬ x = B → B ∈ ℝ *
38 2 adantr ⊢ φ ∧ x ∈ A B → A ∈ ℝ
39 3 adantr ⊢ φ ∧ x ∈ A B → B ∈ ℝ
40 simpr ⊢ φ ∧ x ∈ A B → x ∈ A B
41 eliccre ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ x ∈ A B → x ∈ ℝ
42 38 39 40 41 syl3anc ⊢ φ ∧ x ∈ A B → x ∈ ℝ
43 42 ad2antrr ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ ¬ x = B → x ∈ ℝ
44 2 ad2antrr ⊢ φ ∧ x ∈ A B ∧ ¬ x = A → A ∈ ℝ
45 42 adantr ⊢ φ ∧ x ∈ A B ∧ ¬ x = A → x ∈ ℝ
46 elicc2 ⊢ A ∈ ℝ ∧ B ∈ ℝ → x ∈ A B ↔ x ∈ ℝ ∧ A ≤ x ∧ x ≤ B
47 38 39 46 syl2anc ⊢ φ ∧ x ∈ A B → x ∈ A B ↔ x ∈ ℝ ∧ A ≤ x ∧ x ≤ B
48 40 47 mpbid ⊢ φ ∧ x ∈ A B → x ∈ ℝ ∧ A ≤ x ∧ x ≤ B
49 48 simp2d ⊢ φ ∧ x ∈ A B → A ≤ x
50 49 adantr ⊢ φ ∧ x ∈ A B ∧ ¬ x = A → A ≤ x
51 neqne ⊢ ¬ x = A → x ≠ A
52 51 adantl ⊢ φ ∧ x ∈ A B ∧ ¬ x = A → x ≠ A
53 44 45 50 52 leneltd ⊢ φ ∧ x ∈ A B ∧ ¬ x = A → A < x
54 53 adantr ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ ¬ x = B → A < x
55 42 adantr ⊢ φ ∧ x ∈ A B ∧ ¬ x = B → x ∈ ℝ
56 3 ad2antrr ⊢ φ ∧ x ∈ A B ∧ ¬ x = B → B ∈ ℝ
57 48 simp3d ⊢ φ ∧ x ∈ A B → x ≤ B
58 57 adantr ⊢ φ ∧ x ∈ A B ∧ ¬ x = B → x ≤ B
59 nesym ⊢ B ≠ x ↔ ¬ x = B
60 59 bilanri ⊢ φ ∧ x ∈ A B ∧ ¬ x = B → B ≠ x
61 55 56 58 60 leneltd ⊢ φ ∧ x ∈ A B ∧ ¬ x = B → x < B
62 61 adantlr ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ ¬ x = B → x < B
63 35 37 43 54 62 eliood ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ ¬ x = B → x ∈ A B
64 fvres ⊢ x ∈ A B → F ↾ A B ⁡ x = F ⁡ x
65 63 64 syl ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ ¬ x = B → F ↾ A B ⁡ x = F ⁡ x
66 32 33 65 3eqtr4d ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ ¬ x = B → if x = A R if x = B L F ⁡ x = F ↾ A B ⁡ x
67 29 30 66 3eqtr4d ⊢ φ ∧ x ∈ A B ∧ ¬ x = A ∧ ¬ x = B → if x = A R if x = B L F ↾ A B ⁡ x = if x = A R if x = B L F ⁡ x
68 27 67 pm2.61dan ⊢ φ ∧ x ∈ A B ∧ ¬ x = A → if x = A R if x = B L F ↾ A B ⁡ x = if x = A R if x = B L F ⁡ x
69 18 68 pm2.61dan ⊢ φ ∧ x ∈ A B → if x = A R if x = B L F ↾ A B ⁡ x = if x = A R if x = B L F ⁡ x
70 69 mpteq2dva ⊢ φ → x ∈ A B ⟼ if x = A R if x = B L F ↾ A B ⁡ x = x ∈ A B ⟼ if x = A R if x = B L F ⁡ x
71 1 70 eqtrid ⊢ φ → G = x ∈ A B ⟼ if x = A R if x = B L F ⁡ x
72 71 adantr ⊢ φ ∧ t ∈ A − X B − X → G = x ∈ A B ⟼ if x = A R if x = B L F ⁡ x
73 eqeq1 ⊢ x = X + t → x = A ↔ X + t = A
74 eqeq1 ⊢ x = X + t → x = B ↔ X + t = B
75 fveq2 ⊢ x = X + t → F ⁡ x = F ⁡ X + t
76 74 75 ifbieq2d ⊢ x = X + t → if x = B L F ⁡ x = if X + t = B L F ⁡ X + t
77 73 76 ifbieq2d ⊢ x = X + t → if x = A R if x = B L F ⁡ x = if X + t = A R if X + t = B L F ⁡ X + t
78 2 adantr ⊢ φ ∧ t ∈ A − X B − X → A ∈ ℝ
79 simpr ⊢ φ ∧ t ∈ A − X B − X → t ∈ A − X B − X
80 2 9 resubcld ⊢ φ → A − X ∈ ℝ
81 80 rexrd ⊢ φ → A − X ∈ ℝ *
82 81 adantr ⊢ φ ∧ t ∈ A − X B − X → A − X ∈ ℝ *
83 3 9 resubcld ⊢ φ → B − X ∈ ℝ
84 83 rexrd ⊢ φ → B − X ∈ ℝ *
85 84 adantr ⊢ φ ∧ t ∈ A − X B − X → B − X ∈ ℝ *
86 elioo2 ⊢ A − X ∈ ℝ * ∧ B − X ∈ ℝ * → t ∈ A − X B − X ↔ t ∈ ℝ ∧ A − X < t ∧ t < B − X
87 82 85 86 syl2anc ⊢ φ ∧ t ∈ A − X B − X → t ∈ A − X B − X ↔ t ∈ ℝ ∧ A − X < t ∧ t < B − X
88 79 87 mpbid ⊢ φ ∧ t ∈ A − X B − X → t ∈ ℝ ∧ A − X < t ∧ t < B − X
89 88 simp2d ⊢ φ ∧ t ∈ A − X B − X → A − X < t
90 9 adantr ⊢ φ ∧ t ∈ A − X B − X → X ∈ ℝ
91 88 simp1d ⊢ φ ∧ t ∈ A − X B − X → t ∈ ℝ
92 78 90 91 ltsubadd2d ⊢ φ ∧ t ∈ A − X B − X → A − X < t ↔ A < X + t
93 89 92 mpbid ⊢ φ ∧ t ∈ A − X B − X → A < X + t
94 78 93 gtned ⊢ φ ∧ t ∈ A − X B − X → X + t ≠ A
95 94 neneqd ⊢ φ ∧ t ∈ A − X B − X → ¬ X + t = A
96 95 iffalsed ⊢ φ ∧ t ∈ A − X B − X → if X + t = A R if X + t = B L F ⁡ X + t = if X + t = B L F ⁡ X + t
97 90 91 readdcld ⊢ φ ∧ t ∈ A − X B − X → X + t ∈ ℝ
98 88 simp3d ⊢ φ ∧ t ∈ A − X B − X → t < B − X
99 3 adantr ⊢ φ ∧ t ∈ A − X B − X → B ∈ ℝ
100 90 91 99 ltaddsub2d ⊢ φ ∧ t ∈ A − X B − X → X + t < B ↔ t < B − X
101 98 100 mpbird ⊢ φ ∧ t ∈ A − X B − X → X + t < B
102 97 101 ltned ⊢ φ ∧ t ∈ A − X B − X → X + t ≠ B
103 102 neneqd ⊢ φ ∧ t ∈ A − X B − X → ¬ X + t = B
104 103 iffalsed ⊢ φ ∧ t ∈ A − X B − X → if X + t = B L F ⁡ X + t = F ⁡ X + t
105 96 104 eqtrd ⊢ φ ∧ t ∈ A − X B − X → if X + t = A R if X + t = B L F ⁡ X + t = F ⁡ X + t
106 77 105 sylan9eqr ⊢ φ ∧ t ∈ A − X B − X ∧ x = X + t → if x = A R if x = B L F ⁡ x = F ⁡ X + t
107 78 97 93 ltled ⊢ φ ∧ t ∈ A − X B − X → A ≤ X + t
108 97 99 101 ltled ⊢ φ ∧ t ∈ A − X B − X → X + t ≤ B
109 78 99 97 107 108 eliccd ⊢ φ ∧ t ∈ A − X B − X → X + t ∈ A B
110 5 ffund ⊢ φ → Fun ⁡ F
111 110 adantr ⊢ φ ∧ t ∈ A − X B − X → Fun ⁡ F
112 5 fdmd ⊢ φ → dom ⁡ F = A B
113 112 eqcomd ⊢ φ → A B = dom ⁡ F
114 113 adantr ⊢ φ ∧ t ∈ A − X B − X → A B = dom ⁡ F
115 109 114 eleqtrd ⊢ φ ∧ t ∈ A − X B − X → X + t ∈ dom ⁡ F
116 fvelrn ⊢ Fun ⁡ F ∧ X + t ∈ dom ⁡ F → F ⁡ X + t ∈ ran ⁡ F
117 111 115 116 syl2anc ⊢ φ ∧ t ∈ A − X B − X → F ⁡ X + t ∈ ran ⁡ F
118 72 106 109 117 fvmptd ⊢ φ ∧ t ∈ A − X B − X → G ⁡ X + t = F ⁡ X + t
119 118 itgeq2dv ⊢ φ → ∫ A − X B − X G ⁡ X + t dt = ∫ A − X B − X F ⁡ X + t dt
120 5 frnd ⊢ φ → ran ⁡ F ⊆ ℂ
121 120 adantr ⊢ φ ∧ t ∈ A − X B − X → ran ⁡ F ⊆ ℂ
122 110 adantr ⊢ φ ∧ t ∈ A − X B − X → Fun ⁡ F
123 2 adantr ⊢ φ ∧ t ∈ A − X B − X → A ∈ ℝ
124 3 adantr ⊢ φ ∧ t ∈ A − X B − X → B ∈ ℝ
125 9 adantr ⊢ φ ∧ t ∈ A − X B − X → X ∈ ℝ
126 80 adantr ⊢ φ ∧ t ∈ A − X B − X → A − X ∈ ℝ
127 83 adantr ⊢ φ ∧ t ∈ A − X B − X → B − X ∈ ℝ
128 simpr ⊢ φ ∧ t ∈ A − X B − X → t ∈ A − X B − X
129 eliccre ⊢ A − X ∈ ℝ ∧ B − X ∈ ℝ ∧ t ∈ A − X B − X → t ∈ ℝ
130 126 127 128 129 syl3anc ⊢ φ ∧ t ∈ A − X B − X → t ∈ ℝ
131 125 130 readdcld ⊢ φ ∧ t ∈ A − X B − X → X + t ∈ ℝ
132 elicc2 ⊢ A − X ∈ ℝ ∧ B − X ∈ ℝ → t ∈ A − X B − X ↔ t ∈ ℝ ∧ A − X ≤ t ∧ t ≤ B − X
133 126 127 132 syl2anc ⊢ φ ∧ t ∈ A − X B − X → t ∈ A − X B − X ↔ t ∈ ℝ ∧ A − X ≤ t ∧ t ≤ B − X
134 128 133 mpbid ⊢ φ ∧ t ∈ A − X B − X → t ∈ ℝ ∧ A − X ≤ t ∧ t ≤ B − X
135 134 simp2d ⊢ φ ∧ t ∈ A − X B − X → A − X ≤ t
136 123 125 130 lesubadd2d ⊢ φ ∧ t ∈ A − X B − X → A − X ≤ t ↔ A ≤ X + t
137 135 136 mpbid ⊢ φ ∧ t ∈ A − X B − X → A ≤ X + t
138 134 simp3d ⊢ φ ∧ t ∈ A − X B − X → t ≤ B − X
139 125 130 124 leaddsub2d ⊢ φ ∧ t ∈ A − X B − X → X + t ≤ B ↔ t ≤ B − X
140 138 139 mpbird ⊢ φ ∧ t ∈ A − X B − X → X + t ≤ B
141 123 124 131 137 140 eliccd ⊢ φ ∧ t ∈ A − X B − X → X + t ∈ A B
142 113 adantr ⊢ φ ∧ t ∈ A − X B − X → A B = dom ⁡ F
143 141 142 eleqtrd ⊢ φ ∧ t ∈ A − X B − X → X + t ∈ dom ⁡ F
144 122 143 116 syl2anc ⊢ φ ∧ t ∈ A − X B − X → F ⁡ X + t ∈ ran ⁡ F
145 121 144 sseldd ⊢ φ ∧ t ∈ A − X B − X → F ⁡ X + t ∈ ℂ
146 80 83 145 itgioo ⊢ φ → ∫ A − X B − X F ⁡ X + t dt = ∫ A − X B − X F ⁡ X + t dt
147 12 119 146 3eqtrrd ⊢ φ → ∫ A − X B − X F ⁡ X + t dt = ∫ A − X B − X G ⁡ X + t dt
148 nfv ⊢ Ⅎ x φ
149 2 3 4 5 limcicciooub ⊢ φ → F ↾ A B lim ℂ B = F lim ℂ B
150 7 149 eleqtrrd ⊢ φ → L ∈ F ↾ A B lim ℂ B
151 2 3 4 5 limciccioolb ⊢ φ → F ↾ A B lim ℂ A = F lim ℂ A
152 8 151 eleqtrrd ⊢ φ → R ∈ F ↾ A B lim ℂ A
153 148 1 2 3 6 150 152 cncfiooicc ⊢ φ → G : A B ⟶cn ℂ
154 2 3 10 9 153 itgsbtaddcnst ⊢ φ → ∫ A − X B − X G ⁡ X + t dt = ∫ A B G ⁡ s ds
155 10 ditgpos ⊢ φ → ∫ A B G ⁡ s ds = ∫ A B G ⁡ s ds
156 fveq2 ⊢ s = t → G ⁡ s = G ⁡ t
157 156 cbvitgv ⊢ ∫ A B G ⁡ s ds = ∫ A B G ⁡ t dt
158 1 a1i ⊢ φ ∧ t ∈ A B → G = x ∈ A B ⟼ if x = A R if x = B L F ↾ A B ⁡ x
159 2 ad2antrr ⊢ φ ∧ t ∈ A B ∧ x = t → A ∈ ℝ
160 simplr ⊢ φ ∧ t ∈ A B ∧ x = t → t ∈ A B
161 34 ad2antrr ⊢ φ ∧ t ∈ A B ∧ x = t → A ∈ ℝ *
162 36 ad2antrr ⊢ φ ∧ t ∈ A B ∧ x = t → B ∈ ℝ *
163 elioo2 ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → t ∈ A B ↔ t ∈ ℝ ∧ A < t ∧ t < B
164 161 162 163 syl2anc ⊢ φ ∧ t ∈ A B ∧ x = t → t ∈ A B ↔ t ∈ ℝ ∧ A < t ∧ t < B
165 160 164 mpbid ⊢ φ ∧ t ∈ A B ∧ x = t → t ∈ ℝ ∧ A < t ∧ t < B
166 165 simp2d ⊢ φ ∧ t ∈ A B ∧ x = t → A < t
167 simpr ⊢ φ ∧ t ∈ A B ∧ x = t → x = t
168 166 167 breqtrrd ⊢ φ ∧ t ∈ A B ∧ x = t → A < x
169 159 168 gtned ⊢ φ ∧ t ∈ A B ∧ x = t → x ≠ A
170 169 neneqd ⊢ φ ∧ t ∈ A B ∧ x = t → ¬ x = A
171 170 iffalsed ⊢ φ ∧ t ∈ A B ∧ x = t → if x = A R if x = B L F ↾ A B ⁡ x = if x = B L F ↾ A B ⁡ x
172 165 simp1d ⊢ φ ∧ t ∈ A B ∧ x = t → t ∈ ℝ
173 167 172 eqeltrd ⊢ φ ∧ t ∈ A B ∧ x = t → x ∈ ℝ
174 165 simp3d ⊢ φ ∧ t ∈ A B ∧ x = t → t < B
175 167 174 eqbrtrd ⊢ φ ∧ t ∈ A B ∧ x = t → x < B
176 173 175 ltned ⊢ φ ∧ t ∈ A B ∧ x = t → x ≠ B
177 176 neneqd ⊢ φ ∧ t ∈ A B ∧ x = t → ¬ x = B
178 177 iffalsed ⊢ φ ∧ t ∈ A B ∧ x = t → if x = B L F ↾ A B ⁡ x = F ↾ A B ⁡ x
179 167 160 eqeltrd ⊢ φ ∧ t ∈ A B ∧ x = t → x ∈ A B
180 179 64 syl ⊢ φ ∧ t ∈ A B ∧ x = t → F ↾ A B ⁡ x = F ⁡ x
181 fveq2 ⊢ x = t → F ⁡ x = F ⁡ t
182 181 adantl ⊢ φ ∧ t ∈ A B ∧ x = t → F ⁡ x = F ⁡ t
183 180 182 eqtrd ⊢ φ ∧ t ∈ A B ∧ x = t → F ↾ A B ⁡ x = F ⁡ t
184 171 178 183 3eqtrd ⊢ φ ∧ t ∈ A B ∧ x = t → if x = A R if x = B L F ↾ A B ⁡ x = F ⁡ t
185 ioossicc ⊢ A B ⊆ A B
186 simpr ⊢ φ ∧ t ∈ A B → t ∈ A B
187 185 186 sselid ⊢ φ ∧ t ∈ A B → t ∈ A B
188 110 adantr ⊢ φ ∧ t ∈ A B → Fun ⁡ F
189 113 adantr ⊢ φ ∧ t ∈ A B → A B = dom ⁡ F
190 187 189 eleqtrd ⊢ φ ∧ t ∈ A B → t ∈ dom ⁡ F
191 fvelrn ⊢ Fun ⁡ F ∧ t ∈ dom ⁡ F → F ⁡ t ∈ ran ⁡ F
192 188 190 191 syl2anc ⊢ φ ∧ t ∈ A B → F ⁡ t ∈ ran ⁡ F
193 158 184 187 192 fvmptd ⊢ φ ∧ t ∈ A B → G ⁡ t = F ⁡ t
194 193 itgeq2dv ⊢ φ → ∫ A B G ⁡ t dt = ∫ A B F ⁡ t dt
195 157 194 eqtrid ⊢ φ → ∫ A B G ⁡ s ds = ∫ A B F ⁡ t dt
196 5 ffvelcdmda ⊢ φ ∧ t ∈ A B → F ⁡ t ∈ ℂ
197 2 3 196 itgioo ⊢ φ → ∫ A B F ⁡ t dt = ∫ A B F ⁡ t dt
198 155 195 197 3eqtrd ⊢ φ → ∫ A B G ⁡ s ds = ∫ A B F ⁡ t dt
199 147 154 198 3eqtrrd ⊢ φ → ∫ A B F ⁡ t dt = ∫ A − X B − X F ⁡ X + t dt