| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > itg1addlem3 | Structured version Visualization version GIF version | ||
| Description: Lemma for itg1add 25860. (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 2767 | . . . . 5 ⊢ (𝑖 = 𝐴 → (𝑖 = 0 ↔ 𝐴 = 0)) | |
| 2 | eqeq1 2767 | . . . . 5 ⊢ (𝑗 = 𝐵 → (𝑗 = 0 ↔ 𝐵 = 0)) | |
| 3 | 1, 2 | bi2anan9 649 | . . . 4 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → ((𝑖 = 0 ∧ 𝑗 = 0) ↔ (𝐴 = 0 ∧ 𝐵 = 0))) |
| 4 | sneq 4599 | . . . . . . 7 ⊢ (𝑖 = 𝐴 → {𝑖} = {𝐴}) | |
| 5 | 4 | imaeq2d 6062 | . . . . . 6 ⊢ (𝑖 = 𝐴 → (◡𝐹 “ {𝑖}) = (◡𝐹 “ {𝐴})) |
| 6 | sneq 4599 | . . . . . . 7 ⊢ (𝑗 = 𝐵 → {𝑗} = {𝐵}) | |
| 7 | 6 | imaeq2d 6062 | . . . . . 6 ⊢ (𝑗 = 𝐵 → (◡𝐺 “ {𝑗}) = (◡𝐺 “ {𝐵})) |
| 8 | 5, 7 | ineqan12d 4175 | . . . . 5 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → ((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗})) = ((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))) |
| 9 | 8 | fveq2d 6885 | . . . 4 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗}))) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) |
| 10 | 3, 9 | ifbieq2d 4514 | . . 3 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗})))) = if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))))) |
| 11 | itg1add.3 | . . 3 ⊢ 𝐼 = (𝑖 ∈ ℝ, 𝑗 ∈ ℝ ↦ if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗}))))) | |
| 12 | c0ex 11195 | . . . 4 ⊢ 0 ∈ V | |
| 13 | fvex 6894 | . . . 4 ⊢ (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))) ∈ V | |
| 14 | 12, 13 | ifex 4538 | . . 3 ⊢ if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) ∈ V |
| 15 | 10, 11, 14 | ovmpoa 7565 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴𝐼𝐵) = if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))))) |
| 16 | iffalse 4496 | . 2 ⊢ (¬ (𝐴 = 0 ∧ 𝐵 = 0) → if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) | |
| 17 | 15, 16 | sylan9eq 2818 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ ¬ (𝐴 = 0 ∧ 𝐵 = 0)) → (𝐴𝐼𝐵) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∩ cin 3904 ifcif 4487 {csn 4589 ◡ccnv 5660 dom cdm 5661 “ cima 5664 ‘cfv 6536 (class class class)co 7410 ∈ cmpo 7412 ℝcr 11094 0cc0 11095 volcvol 25622 ∫1citg1 25774 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pr 5404 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-mulcl 11157 ax-i2m1 11163 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3745 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 |
| This theorem is referenced by: itg1addlem4 25858 itg1addlem5 25859 |
| Copyright terms: Public domain | W3C validator |