| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > itg1addlem3 | Structured version Visualization version GIF version | ||
| Description: Lemma for itg1add 25624. (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 2735 | . . . . 5 ⊢ (𝑖 = 𝐴 → (𝑖 = 0 ↔ 𝐴 = 0)) | |
| 2 | eqeq1 2735 | . . . . 5 ⊢ (𝑗 = 𝐵 → (𝑗 = 0 ↔ 𝐵 = 0)) | |
| 3 | 1, 2 | bi2anan9 638 | . . . 4 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → ((𝑖 = 0 ∧ 𝑗 = 0) ↔ (𝐴 = 0 ∧ 𝐵 = 0))) |
| 4 | sneq 4581 | . . . . . . 7 ⊢ (𝑖 = 𝐴 → {𝑖} = {𝐴}) | |
| 5 | 4 | imaeq2d 6004 | . . . . . 6 ⊢ (𝑖 = 𝐴 → (◡𝐹 “ {𝑖}) = (◡𝐹 “ {𝐴})) |
| 6 | sneq 4581 | . . . . . . 7 ⊢ (𝑗 = 𝐵 → {𝑗} = {𝐵}) | |
| 7 | 6 | imaeq2d 6004 | . . . . . 6 ⊢ (𝑗 = 𝐵 → (◡𝐺 “ {𝑗}) = (◡𝐺 “ {𝐵})) |
| 8 | 5, 7 | ineqan12d 4167 | . . . . 5 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → ((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗})) = ((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))) |
| 9 | 8 | fveq2d 6821 | . . . 4 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗}))) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) |
| 10 | 3, 9 | ifbieq2d 4497 | . . 3 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗})))) = if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))))) |
| 11 | itg1add.3 | . . 3 ⊢ 𝐼 = (𝑖 ∈ ℝ, 𝑗 ∈ ℝ ↦ if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗}))))) | |
| 12 | c0ex 11101 | . . . 4 ⊢ 0 ∈ V | |
| 13 | fvex 6830 | . . . 4 ⊢ (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))) ∈ V | |
| 14 | 12, 13 | ifex 4521 | . . 3 ⊢ if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) ∈ V |
| 15 | 10, 11, 14 | ovmpoa 7496 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴𝐼𝐵) = if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))))) |
| 16 | iffalse 4479 | . 2 ⊢ (¬ (𝐴 = 0 ∧ 𝐵 = 0) → if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) | |
| 17 | 15, 16 | sylan9eq 2786 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ ¬ (𝐴 = 0 ∧ 𝐵 = 0)) → (𝐴𝐼𝐵) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ∩ cin 3896 ifcif 4470 {csn 4571 ◡ccnv 5610 dom cdm 5611 “ cima 5614 ‘cfv 6476 (class class class)co 7341 ∈ cmpo 7343 ℝcr 11000 0cc0 11001 volcvol 25386 ∫1citg1 25538 |
| 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 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5229 ax-nul 5239 ax-pr 5365 ax-1cn 11059 ax-icn 11060 ax-addcl 11061 ax-mulcl 11063 ax-i2m1 11069 |
| 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 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-sbc 3737 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4279 df-if 4471 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4855 df-br 5087 df-opab 5149 df-id 5506 df-xp 5617 df-rel 5618 df-cnv 5619 df-co 5620 df-dm 5621 df-rn 5622 df-res 5623 df-ima 5624 df-iota 6432 df-fun 6478 df-fv 6484 df-ov 7344 df-oprab 7345 df-mpo 7346 |
| This theorem is referenced by: itg1addlem4 25622 itg1addlem5 25623 |
| Copyright terms: Public domain | W3C validator |