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

Theorem itg1addlem3 25675
Description: Lemma for itg1add 25678. (Contributed by Mario Carneiro, 26-Jun-2014.)
Hypotheses
Ref Expression
i1fadd.1 (𝜑𝐹 ∈ dom ∫1)
i1fadd.2 (𝜑𝐺 ∈ dom ∫1)
itg1add.3 𝐼 = (𝑖 ∈ ℝ, 𝑗 ∈ ℝ ↦ if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((𝐹 “ {𝑖}) ∩ (𝐺 “ {𝑗})))))
Assertion
Ref Expression
itg1addlem3 (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ ¬ (𝐴 = 0 ∧ 𝐵 = 0)) → (𝐴𝐼𝐵) = (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵}))))
Distinct variable groups:   𝑖,𝑗,𝐴   𝐵,𝑖,𝑗   𝑖,𝐹,𝑗   𝑖,𝐺,𝑗   𝜑,𝑖,𝑗
Allowed substitution hints:   𝐼(𝑖,𝑗)

Proof of Theorem itg1addlem3
StepHypRef Expression
1 eqeq1 2741 . . . . 5 (𝑖 = 𝐴 → (𝑖 = 0 ↔ 𝐴 = 0))
2 eqeq1 2741 . . . . 5 (𝑗 = 𝐵 → (𝑗 = 0 ↔ 𝐵 = 0))
31, 2bi2anan9 639 . . . 4 ((𝑖 = 𝐴𝑗 = 𝐵) → ((𝑖 = 0 ∧ 𝑗 = 0) ↔ (𝐴 = 0 ∧ 𝐵 = 0)))
4 sneq 4578 . . . . . . 7 (𝑖 = 𝐴 → {𝑖} = {𝐴})
54imaeq2d 6019 . . . . . 6 (𝑖 = 𝐴 → (𝐹 “ {𝑖}) = (𝐹 “ {𝐴}))
6 sneq 4578 . . . . . . 7 (𝑗 = 𝐵 → {𝑗} = {𝐵})
76imaeq2d 6019 . . . . . 6 (𝑗 = 𝐵 → (𝐺 “ {𝑗}) = (𝐺 “ {𝐵}))
85, 7ineqan12d 4163 . . . . 5 ((𝑖 = 𝐴𝑗 = 𝐵) → ((𝐹 “ {𝑖}) ∩ (𝐺 “ {𝑗})) = ((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵})))
98fveq2d 6838 . . . 4 ((𝑖 = 𝐴𝑗 = 𝐵) → (vol‘((𝐹 “ {𝑖}) ∩ (𝐺 “ {𝑗}))) = (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵}))))
103, 9ifbieq2d 4494 . . 3 ((𝑖 = 𝐴𝑗 = 𝐵) → if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((𝐹 “ {𝑖}) ∩ (𝐺 “ {𝑗})))) = if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵})))))
11 itg1add.3 . . 3 𝐼 = (𝑖 ∈ ℝ, 𝑗 ∈ ℝ ↦ if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((𝐹 “ {𝑖}) ∩ (𝐺 “ {𝑗})))))
12 c0ex 11129 . . . 4 0 ∈ V
13 fvex 6847 . . . 4 (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵}))) ∈ V
1412, 13ifex 4518 . . 3 if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵})))) ∈ V
1510, 11, 14ovmpoa 7515 . 2 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴𝐼𝐵) = if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵})))))
16 iffalse 4476 . 2 (¬ (𝐴 = 0 ∧ 𝐵 = 0) → if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵})))) = (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵}))))
1715, 16sylan9eq 2792 1 (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ ¬ (𝐴 = 0 ∧ 𝐵 = 0)) → (𝐴𝐼𝐵) = (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵}))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1542  wcel 2114  cin 3889  ifcif 4467  {csn 4568  ccnv 5623  dom cdm 5624  cima 5627  cfv 6492  (class class class)co 7360  cmpo 7362  cr 11028  0cc0 11029  volcvol 25440  1citg1 25592
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pr 5370  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-mulcl 11091  ax-i2m1 11097
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fv 6500  df-ov 7363  df-oprab 7364  df-mpo 7365
This theorem is referenced by:  itg1addlem4  25676  itg1addlem5  25677
  Copyright terms: Public domain W3C validator