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

Theorem iblcnlem 24953
Description: Expand out the universal quantifier in isibl2 24931. (Contributed by Mario Carneiro, 6-Aug-2014.)
Hypotheses
Ref Expression
itgcnlem.r 𝑅 = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘𝐵)), (ℜ‘𝐵), 0)))
itgcnlem.s 𝑆 = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘𝐵)), -(ℜ‘𝐵), 0)))
itgcnlem.t 𝑇 = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘𝐵)), (ℑ‘𝐵), 0)))
itgcnlem.u 𝑈 = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘𝐵)), -(ℑ‘𝐵), 0)))
itgcnlem.v ((𝜑𝑥𝐴) → 𝐵𝑉)
Assertion
Ref Expression
iblcnlem (𝜑 → ((𝑥𝐴𝐵) ∈ 𝐿1 ↔ ((𝑥𝐴𝐵) ∈ MblFn ∧ (𝑅 ∈ ℝ ∧ 𝑆 ∈ ℝ) ∧ (𝑇 ∈ ℝ ∧ 𝑈 ∈ ℝ))))
Distinct variable groups:   𝑥,𝐴   𝜑,𝑥   𝑥,𝑉
Allowed substitution hints:   𝐵(𝑥)   𝑅(𝑥)   𝑆(𝑥)   𝑇(𝑥)   𝑈(𝑥)

Proof of Theorem iblcnlem
StepHypRef Expression
1 iblmbf 24932 . . 3 ((𝑥𝐴𝐵) ∈ 𝐿1 → (𝑥𝐴𝐵) ∈ MblFn)
21a1i 11 . 2 (𝜑 → ((𝑥𝐴𝐵) ∈ 𝐿1 → (𝑥𝐴𝐵) ∈ MblFn))
3 simp1 1135 . . 3 (((𝑥𝐴𝐵) ∈ MblFn ∧ (𝑅 ∈ ℝ ∧ 𝑆 ∈ ℝ) ∧ (𝑇 ∈ ℝ ∧ 𝑈 ∈ ℝ)) → (𝑥𝐴𝐵) ∈ MblFn)
43a1i 11 . 2 (𝜑 → (((𝑥𝐴𝐵) ∈ MblFn ∧ (𝑅 ∈ ℝ ∧ 𝑆 ∈ ℝ) ∧ (𝑇 ∈ ℝ ∧ 𝑈 ∈ ℝ)) → (𝑥𝐴𝐵) ∈ MblFn))
5 eqid 2738 . . . . . 6 (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0)))
6 eqid 2738 . . . . . 6 (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0)))
7 eqid 2738 . . . . . 6 (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0)))
8 eqid 2738 . . . . . 6 (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0)))
9 0cn 10967 . . . . . . . 8 0 ∈ ℂ
109elimel 4528 . . . . . . 7 if(𝐵 ∈ ℂ, 𝐵, 0) ∈ ℂ
1110a1i 11 . . . . . 6 ((𝜑𝑥𝐴) → if(𝐵 ∈ ℂ, 𝐵, 0) ∈ ℂ)
125, 6, 7, 8, 11iblcnlem1 24952 . . . . 5 (𝜑 → ((𝑥𝐴 ↦ if(𝐵 ∈ ℂ, 𝐵, 0)) ∈ 𝐿1 ↔ ((𝑥𝐴 ↦ if(𝐵 ∈ ℂ, 𝐵, 0)) ∈ MblFn ∧ ((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ) ∧ ((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ))))
1312adantr 481 . . . 4 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → ((𝑥𝐴 ↦ if(𝐵 ∈ ℂ, 𝐵, 0)) ∈ 𝐿1 ↔ ((𝑥𝐴 ↦ if(𝐵 ∈ ℂ, 𝐵, 0)) ∈ MblFn ∧ ((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ) ∧ ((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ))))
14 eqid 2738 . . . . . 6 𝐴 = 𝐴
15 mbff 24789 . . . . . . . . 9 ((𝑥𝐴𝐵) ∈ MblFn → (𝑥𝐴𝐵):dom (𝑥𝐴𝐵)⟶ℂ)
16 eqid 2738 . . . . . . . . . . . 12 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
17 itgcnlem.v . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → 𝐵𝑉)
1816, 17dmmptd 6578 . . . . . . . . . . 11 (𝜑 → dom (𝑥𝐴𝐵) = 𝐴)
1918feq2d 6586 . . . . . . . . . 10 (𝜑 → ((𝑥𝐴𝐵):dom (𝑥𝐴𝐵)⟶ℂ ↔ (𝑥𝐴𝐵):𝐴⟶ℂ))
2019biimpa 477 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐴𝐵):dom (𝑥𝐴𝐵)⟶ℂ) → (𝑥𝐴𝐵):𝐴⟶ℂ)
2115, 20sylan2 593 . . . . . . . 8 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (𝑥𝐴𝐵):𝐴⟶ℂ)
2216fmpt 6984 . . . . . . . 8 (∀𝑥𝐴 𝐵 ∈ ℂ ↔ (𝑥𝐴𝐵):𝐴⟶ℂ)
2321, 22sylibr 233 . . . . . . 7 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → ∀𝑥𝐴 𝐵 ∈ ℂ)
24 iftrue 4465 . . . . . . . 8 (𝐵 ∈ ℂ → if(𝐵 ∈ ℂ, 𝐵, 0) = 𝐵)
2524ralimi 3087 . . . . . . 7 (∀𝑥𝐴 𝐵 ∈ ℂ → ∀𝑥𝐴 if(𝐵 ∈ ℂ, 𝐵, 0) = 𝐵)
2623, 25syl 17 . . . . . 6 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → ∀𝑥𝐴 if(𝐵 ∈ ℂ, 𝐵, 0) = 𝐵)
27 mpteq12 5166 . . . . . 6 ((𝐴 = 𝐴 ∧ ∀𝑥𝐴 if(𝐵 ∈ ℂ, 𝐵, 0) = 𝐵) → (𝑥𝐴 ↦ if(𝐵 ∈ ℂ, 𝐵, 0)) = (𝑥𝐴𝐵))
2814, 26, 27sylancr 587 . . . . 5 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (𝑥𝐴 ↦ if(𝐵 ∈ ℂ, 𝐵, 0)) = (𝑥𝐴𝐵))
2928eleq1d 2823 . . . 4 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → ((𝑥𝐴 ↦ if(𝐵 ∈ ℂ, 𝐵, 0)) ∈ 𝐿1 ↔ (𝑥𝐴𝐵) ∈ 𝐿1))
3028eleq1d 2823 . . . . 5 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → ((𝑥𝐴 ↦ if(𝐵 ∈ ℂ, 𝐵, 0)) ∈ MblFn ↔ (𝑥𝐴𝐵) ∈ MblFn))
31 eqid 2738 . . . . . . . . . 10 ℝ = ℝ
3224imim2i 16 . . . . . . . . . . . . . . . 16 ((𝑥𝐴𝐵 ∈ ℂ) → (𝑥𝐴 → if(𝐵 ∈ ℂ, 𝐵, 0) = 𝐵))
3332imp 407 . . . . . . . . . . . . . . 15 (((𝑥𝐴𝐵 ∈ ℂ) ∧ 𝑥𝐴) → if(𝐵 ∈ ℂ, 𝐵, 0) = 𝐵)
3433fveq2d 6778 . . . . . . . . . . . . . 14 (((𝑥𝐴𝐵 ∈ ℂ) ∧ 𝑥𝐴) → (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)) = (ℜ‘𝐵))
3534ibllem 24929 . . . . . . . . . . . . 13 ((𝑥𝐴𝐵 ∈ ℂ) → if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ (ℜ‘𝐵)), (ℜ‘𝐵), 0))
3635a1d 25 . . . . . . . . . . . 12 ((𝑥𝐴𝐵 ∈ ℂ) → (𝑥 ∈ ℝ → if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ (ℜ‘𝐵)), (ℜ‘𝐵), 0)))
3736ralimi2 3084 . . . . . . . . . . 11 (∀𝑥𝐴 𝐵 ∈ ℂ → ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ (ℜ‘𝐵)), (ℜ‘𝐵), 0))
3823, 37syl 17 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ (ℜ‘𝐵)), (ℜ‘𝐵), 0))
39 mpteq12 5166 . . . . . . . . . 10 ((ℝ = ℝ ∧ ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ (ℜ‘𝐵)), (ℜ‘𝐵), 0)) → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘𝐵)), (ℜ‘𝐵), 0)))
4031, 38, 39sylancr 587 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘𝐵)), (ℜ‘𝐵), 0)))
4140fveq2d 6778 . . . . . . . 8 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘𝐵)), (ℜ‘𝐵), 0))))
42 itgcnlem.r . . . . . . . 8 𝑅 = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘𝐵)), (ℜ‘𝐵), 0)))
4341, 42eqtr4di 2796 . . . . . . 7 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) = 𝑅)
4443eleq1d 2823 . . . . . 6 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → ((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ ↔ 𝑅 ∈ ℝ))
4534negeqd 11215 . . . . . . . . . . . . . 14 (((𝑥𝐴𝐵 ∈ ℂ) ∧ 𝑥𝐴) → -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)) = -(ℜ‘𝐵))
4645ibllem 24929 . . . . . . . . . . . . 13 ((𝑥𝐴𝐵 ∈ ℂ) → if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘𝐵)), -(ℜ‘𝐵), 0))
4746a1d 25 . . . . . . . . . . . 12 ((𝑥𝐴𝐵 ∈ ℂ) → (𝑥 ∈ ℝ → if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘𝐵)), -(ℜ‘𝐵), 0)))
4847ralimi2 3084 . . . . . . . . . . 11 (∀𝑥𝐴 𝐵 ∈ ℂ → ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘𝐵)), -(ℜ‘𝐵), 0))
4923, 48syl 17 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘𝐵)), -(ℜ‘𝐵), 0))
50 mpteq12 5166 . . . . . . . . . 10 ((ℝ = ℝ ∧ ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘𝐵)), -(ℜ‘𝐵), 0)) → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘𝐵)), -(ℜ‘𝐵), 0)))
5131, 49, 50sylancr 587 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘𝐵)), -(ℜ‘𝐵), 0)))
5251fveq2d 6778 . . . . . . . 8 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘𝐵)), -(ℜ‘𝐵), 0))))
53 itgcnlem.s . . . . . . . 8 𝑆 = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘𝐵)), -(ℜ‘𝐵), 0)))
5452, 53eqtr4di 2796 . . . . . . 7 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) = 𝑆)
5554eleq1d 2823 . . . . . 6 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → ((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ ↔ 𝑆 ∈ ℝ))
5644, 55anbi12d 631 . . . . 5 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ) ↔ (𝑅 ∈ ℝ ∧ 𝑆 ∈ ℝ)))
5733fveq2d 6778 . . . . . . . . . . . . . 14 (((𝑥𝐴𝐵 ∈ ℂ) ∧ 𝑥𝐴) → (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)) = (ℑ‘𝐵))
5857ibllem 24929 . . . . . . . . . . . . 13 ((𝑥𝐴𝐵 ∈ ℂ) → if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ (ℑ‘𝐵)), (ℑ‘𝐵), 0))
5958a1d 25 . . . . . . . . . . . 12 ((𝑥𝐴𝐵 ∈ ℂ) → (𝑥 ∈ ℝ → if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ (ℑ‘𝐵)), (ℑ‘𝐵), 0)))
6059ralimi2 3084 . . . . . . . . . . 11 (∀𝑥𝐴 𝐵 ∈ ℂ → ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ (ℑ‘𝐵)), (ℑ‘𝐵), 0))
6123, 60syl 17 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ (ℑ‘𝐵)), (ℑ‘𝐵), 0))
62 mpteq12 5166 . . . . . . . . . 10 ((ℝ = ℝ ∧ ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ (ℑ‘𝐵)), (ℑ‘𝐵), 0)) → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘𝐵)), (ℑ‘𝐵), 0)))
6331, 61, 62sylancr 587 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘𝐵)), (ℑ‘𝐵), 0)))
6463fveq2d 6778 . . . . . . . 8 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘𝐵)), (ℑ‘𝐵), 0))))
65 itgcnlem.t . . . . . . . 8 𝑇 = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘𝐵)), (ℑ‘𝐵), 0)))
6664, 65eqtr4di 2796 . . . . . . 7 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) = 𝑇)
6766eleq1d 2823 . . . . . 6 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → ((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ ↔ 𝑇 ∈ ℝ))
6857negeqd 11215 . . . . . . . . . . . . . 14 (((𝑥𝐴𝐵 ∈ ℂ) ∧ 𝑥𝐴) → -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)) = -(ℑ‘𝐵))
6968ibllem 24929 . . . . . . . . . . . . 13 ((𝑥𝐴𝐵 ∈ ℂ) → if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘𝐵)), -(ℑ‘𝐵), 0))
7069a1d 25 . . . . . . . . . . . 12 ((𝑥𝐴𝐵 ∈ ℂ) → (𝑥 ∈ ℝ → if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘𝐵)), -(ℑ‘𝐵), 0)))
7170ralimi2 3084 . . . . . . . . . . 11 (∀𝑥𝐴 𝐵 ∈ ℂ → ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘𝐵)), -(ℑ‘𝐵), 0))
7223, 71syl 17 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘𝐵)), -(ℑ‘𝐵), 0))
73 mpteq12 5166 . . . . . . . . . 10 ((ℝ = ℝ ∧ ∀𝑥 ∈ ℝ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0) = if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘𝐵)), -(ℑ‘𝐵), 0)) → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘𝐵)), -(ℑ‘𝐵), 0)))
7431, 72, 73sylancr 587 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘𝐵)), -(ℑ‘𝐵), 0)))
7574fveq2d 6778 . . . . . . . 8 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘𝐵)), -(ℑ‘𝐵), 0))))
76 itgcnlem.u . . . . . . . 8 𝑈 = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘𝐵)), -(ℑ‘𝐵), 0)))
7775, 76eqtr4di 2796 . . . . . . 7 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) = 𝑈)
7877eleq1d 2823 . . . . . 6 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → ((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ ↔ 𝑈 ∈ ℝ))
7967, 78anbi12d 631 . . . . 5 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ) ↔ (𝑇 ∈ ℝ ∧ 𝑈 ∈ ℝ)))
8030, 56, 793anbi123d 1435 . . . 4 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (((𝑥𝐴 ↦ if(𝐵 ∈ ℂ, 𝐵, 0)) ∈ MblFn ∧ ((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℜ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ) ∧ ((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), (ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ ∧ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0))), -(ℑ‘if(𝐵 ∈ ℂ, 𝐵, 0)), 0))) ∈ ℝ)) ↔ ((𝑥𝐴𝐵) ∈ MblFn ∧ (𝑅 ∈ ℝ ∧ 𝑆 ∈ ℝ) ∧ (𝑇 ∈ ℝ ∧ 𝑈 ∈ ℝ))))
8113, 29, 803bitr3d 309 . . 3 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → ((𝑥𝐴𝐵) ∈ 𝐿1 ↔ ((𝑥𝐴𝐵) ∈ MblFn ∧ (𝑅 ∈ ℝ ∧ 𝑆 ∈ ℝ) ∧ (𝑇 ∈ ℝ ∧ 𝑈 ∈ ℝ))))
8281ex 413 . 2 (𝜑 → ((𝑥𝐴𝐵) ∈ MblFn → ((𝑥𝐴𝐵) ∈ 𝐿1 ↔ ((𝑥𝐴𝐵) ∈ MblFn ∧ (𝑅 ∈ ℝ ∧ 𝑆 ∈ ℝ) ∧ (𝑇 ∈ ℝ ∧ 𝑈 ∈ ℝ)))))
832, 4, 82pm5.21ndd 381 1 (𝜑 → ((𝑥𝐴𝐵) ∈ 𝐿1 ↔ ((𝑥𝐴𝐵) ∈ MblFn ∧ (𝑅 ∈ ℝ ∧ 𝑆 ∈ ℝ) ∧ (𝑇 ∈ ℝ ∧ 𝑈 ∈ ℝ))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1086   = wceq 1539  wcel 2106  wral 3064  ifcif 4459   class class class wbr 5074  cmpt 5157  dom cdm 5589  wf 6429  cfv 6433  cc 10869  cr 10870  0cc0 10871  cle 11010  -cneg 11206  cre 14808  cim 14809  MblFncmbf 24778  2citg2 24780  𝐿1cibl 24781
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-er 8498  df-pm 8618  df-en 8734  df-dom 8735  df-sdom 8736  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-div 11633  df-nn 11974  df-2 12036  df-3 12037  df-n0 12234  df-z 12320  df-uz 12583  df-fz 13240  df-seq 13722  df-exp 13783  df-cj 14810  df-re 14811  df-im 14812  df-mbf 24783  df-ibl 24786
This theorem is referenced by:  itgcnlem  24954  iblrelem  24955  ibladd  24985  ibladdnc  35834
  Copyright terms: Public domain W3C validator