| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > itg1addlem3 | Structured version Visualization version GIF version | ||
| Description: Lemma for itg1add 25668. (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 2740 | . . . . 5 ⊢ (𝑖 = 𝐴 → (𝑖 = 0 ↔ 𝐴 = 0)) | |
| 2 | eqeq1 2740 | . . . . 5 ⊢ (𝑗 = 𝐵 → (𝑗 = 0 ↔ 𝐵 = 0)) | |
| 3 | 1, 2 | bi2anan9 639 | . . . 4 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → ((𝑖 = 0 ∧ 𝑗 = 0) ↔ (𝐴 = 0 ∧ 𝐵 = 0))) |
| 4 | sneq 4577 | . . . . . . 7 ⊢ (𝑖 = 𝐴 → {𝑖} = {𝐴}) | |
| 5 | 4 | imaeq2d 6025 | . . . . . 6 ⊢ (𝑖 = 𝐴 → (◡𝐹 “ {𝑖}) = (◡𝐹 “ {𝐴})) |
| 6 | sneq 4577 | . . . . . . 7 ⊢ (𝑗 = 𝐵 → {𝑗} = {𝐵}) | |
| 7 | 6 | imaeq2d 6025 | . . . . . 6 ⊢ (𝑗 = 𝐵 → (◡𝐺 “ {𝑗}) = (◡𝐺 “ {𝐵})) |
| 8 | 5, 7 | ineqan12d 4162 | . . . . 5 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → ((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗})) = ((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))) |
| 9 | 8 | fveq2d 6844 | . . . 4 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗}))) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) |
| 10 | 3, 9 | ifbieq2d 4493 | . . 3 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗})))) = if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))))) |
| 11 | itg1add.3 | . . 3 ⊢ 𝐼 = (𝑖 ∈ ℝ, 𝑗 ∈ ℝ ↦ if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗}))))) | |
| 12 | c0ex 11138 | . . . 4 ⊢ 0 ∈ V | |
| 13 | fvex 6853 | . . . 4 ⊢ (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))) ∈ V | |
| 14 | 12, 13 | ifex 4517 | . . 3 ⊢ if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) ∈ V |
| 15 | 10, 11, 14 | ovmpoa 7522 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴𝐼𝐵) = if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))))) |
| 16 | iffalse 4475 | . 2 ⊢ (¬ (𝐴 = 0 ∧ 𝐵 = 0) → if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) | |
| 17 | 15, 16 | sylan9eq 2791 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ ¬ (𝐴 = 0 ∧ 𝐵 = 0)) → (𝐴𝐼𝐵) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∩ cin 3888 ifcif 4466 {csn 4567 ◡ccnv 5630 dom cdm 5631 “ cima 5634 ‘cfv 6498 (class class class)co 7367 ∈ cmpo 7369 ℝcr 11037 0cc0 11038 volcvol 25430 ∫1citg1 25582 |
| 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 2708 ax-sep 5231 ax-nul 5241 ax-pr 5375 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-mulcl 11100 ax-i2m1 11106 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-sbc 3729 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 |
| This theorem is referenced by: itg1addlem4 25666 itg1addlem5 25667 |
| Copyright terms: Public domain | W3C validator |