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

Theorem itg1addlem3 24301
Description: Lemma for itg1add 24304. (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 2827 . . . . 5 (𝑖 = 𝐴 → (𝑖 = 0 ↔ 𝐴 = 0))
2 eqeq1 2827 . . . . 5 (𝑗 = 𝐵 → (𝑗 = 0 ↔ 𝐵 = 0))
31, 2bi2anan9 637 . . . 4 ((𝑖 = 𝐴𝑗 = 𝐵) → ((𝑖 = 0 ∧ 𝑗 = 0) ↔ (𝐴 = 0 ∧ 𝐵 = 0)))
4 sneq 4579 . . . . . . 7 (𝑖 = 𝐴 → {𝑖} = {𝐴})
54imaeq2d 5931 . . . . . 6 (𝑖 = 𝐴 → (𝐹 “ {𝑖}) = (𝐹 “ {𝐴}))
6 sneq 4579 . . . . . . 7 (𝑗 = 𝐵 → {𝑗} = {𝐵})
76imaeq2d 5931 . . . . . 6 (𝑗 = 𝐵 → (𝐺 “ {𝑗}) = (𝐺 “ {𝐵}))
85, 7ineqan12d 4193 . . . . 5 ((𝑖 = 𝐴𝑗 = 𝐵) → ((𝐹 “ {𝑖}) ∩ (𝐺 “ {𝑗})) = ((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵})))
98fveq2d 6676 . . . 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 10637 . . . 4 0 ∈ V
13 fvex 6685 . . . 4 (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵}))) ∈ V
1412, 13ifex 4517 . . 3 if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵})))) ∈ V
1510, 11, 14ovmpoa 7307 . 2 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴𝐼𝐵) = if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵})))))
16 iffalse 4478 . 2 (¬ (𝐴 = 0 ∧ 𝐵 = 0) → if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵})))) = (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵}))))
1715, 16sylan9eq 2878 1 (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ ¬ (𝐴 = 0 ∧ 𝐵 = 0)) → (𝐴𝐼𝐵) = (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵}))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 398   = wceq 1537  wcel 2114  cin 3937  ifcif 4469  {csn 4569  ccnv 5556  dom cdm 5557  cima 5560  cfv 6357  (class class class)co 7158  cmpo 7160  cr 10538  0cc0 10539  volcvol 24066  1citg1 24218
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-mulcl 10601  ax-i2m1 10607
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fv 6365  df-ov 7161  df-oprab 7162  df-mpo 7163
This theorem is referenced by:  itg1addlem4  24302  itg1addlem5  24303
  Copyright terms: Public domain W3C validator