| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > itg1addlem3 | Structured version Visualization version GIF version | ||
| Description: Lemma for itg1add 25649. (Contributed by Mario Carneiro, 26-Jun-2014.) |
| Ref | Expression |
|---|---|
| i1fadd.1 | ⊢ (𝜑 → 𝐹 ∈ dom ∫1) |
| i1fadd.2 | ⊢ (𝜑 → 𝐺 ∈ dom ∫1) |
| itg1add.3 | ⊢ 𝐼 = (𝑖 ∈ ℝ, 𝑗 ∈ ℝ ↦ if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗}))))) |
| Ref | Expression |
|---|---|
| itg1addlem3 | ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ ¬ (𝐴 = 0 ∧ 𝐵 = 0)) → (𝐴𝐼𝐵) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1 2737 | . . . . 5 ⊢ (𝑖 = 𝐴 → (𝑖 = 0 ↔ 𝐴 = 0)) | |
| 2 | eqeq1 2737 | . . . . 5 ⊢ (𝑗 = 𝐵 → (𝑗 = 0 ↔ 𝐵 = 0)) | |
| 3 | 1, 2 | bi2anan9 638 | . . . 4 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → ((𝑖 = 0 ∧ 𝑗 = 0) ↔ (𝐴 = 0 ∧ 𝐵 = 0))) |
| 4 | sneq 4587 | . . . . . . 7 ⊢ (𝑖 = 𝐴 → {𝑖} = {𝐴}) | |
| 5 | 4 | imaeq2d 6016 | . . . . . 6 ⊢ (𝑖 = 𝐴 → (◡𝐹 “ {𝑖}) = (◡𝐹 “ {𝐴})) |
| 6 | sneq 4587 | . . . . . . 7 ⊢ (𝑗 = 𝐵 → {𝑗} = {𝐵}) | |
| 7 | 6 | imaeq2d 6016 | . . . . . 6 ⊢ (𝑗 = 𝐵 → (◡𝐺 “ {𝑗}) = (◡𝐺 “ {𝐵})) |
| 8 | 5, 7 | ineqan12d 4171 | . . . . 5 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → ((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗})) = ((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))) |
| 9 | 8 | fveq2d 6835 | . . . 4 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗}))) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) |
| 10 | 3, 9 | ifbieq2d 4503 | . . 3 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗})))) = if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))))) |
| 11 | itg1add.3 | . . 3 ⊢ 𝐼 = (𝑖 ∈ ℝ, 𝑗 ∈ ℝ ↦ if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗}))))) | |
| 12 | c0ex 11117 | . . . 4 ⊢ 0 ∈ V | |
| 13 | fvex 6844 | . . . 4 ⊢ (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))) ∈ V | |
| 14 | 12, 13 | ifex 4527 | . . 3 ⊢ if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) ∈ V |
| 15 | 10, 11, 14 | ovmpoa 7510 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴𝐼𝐵) = if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))))) |
| 16 | iffalse 4485 | . 2 ⊢ (¬ (𝐴 = 0 ∧ 𝐵 = 0) → if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) | |
| 17 | 15, 16 | sylan9eq 2788 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ ¬ (𝐴 = 0 ∧ 𝐵 = 0)) → (𝐴𝐼𝐵) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∩ cin 3897 ifcif 4476 {csn 4577 ◡ccnv 5620 dom cdm 5621 “ cima 5624 ‘cfv 6489 (class class class)co 7355 ∈ cmpo 7357 ℝcr 11016 0cc0 11017 volcvol 25411 ∫1citg1 25563 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pr 5374 ax-1cn 11075 ax-icn 11076 ax-addcl 11077 ax-mulcl 11079 ax-i2m1 11085 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-sbc 3738 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4477 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-br 5096 df-opab 5158 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6445 df-fun 6491 df-fv 6497 df-ov 7358 df-oprab 7359 df-mpo 7360 |
| This theorem is referenced by: itg1addlem4 25647 itg1addlem5 25648 |
| Copyright terms: Public domain | W3C validator |