![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > itg1addlem3 | Structured version Visualization version GIF version |
Description: Lemma for itg1add 25210. (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 2736 | . . . . 5 ⊢ (𝑖 = 𝐴 → (𝑖 = 0 ↔ 𝐴 = 0)) | |
2 | eqeq1 2736 | . . . . 5 ⊢ (𝑗 = 𝐵 → (𝑗 = 0 ↔ 𝐵 = 0)) | |
3 | 1, 2 | bi2anan9 637 | . . . 4 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → ((𝑖 = 0 ∧ 𝑗 = 0) ↔ (𝐴 = 0 ∧ 𝐵 = 0))) |
4 | sneq 4637 | . . . . . . 7 ⊢ (𝑖 = 𝐴 → {𝑖} = {𝐴}) | |
5 | 4 | imaeq2d 6057 | . . . . . 6 ⊢ (𝑖 = 𝐴 → (◡𝐹 “ {𝑖}) = (◡𝐹 “ {𝐴})) |
6 | sneq 4637 | . . . . . . 7 ⊢ (𝑗 = 𝐵 → {𝑗} = {𝐵}) | |
7 | 6 | imaeq2d 6057 | . . . . . 6 ⊢ (𝑗 = 𝐵 → (◡𝐺 “ {𝑗}) = (◡𝐺 “ {𝐵})) |
8 | 5, 7 | ineqan12d 4213 | . . . . 5 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → ((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗})) = ((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))) |
9 | 8 | fveq2d 6892 | . . . 4 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗}))) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) |
10 | 3, 9 | ifbieq2d 4553 | . . 3 ⊢ ((𝑖 = 𝐴 ∧ 𝑗 = 𝐵) → if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗})))) = if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))))) |
11 | itg1add.3 | . . 3 ⊢ 𝐼 = (𝑖 ∈ ℝ, 𝑗 ∈ ℝ ↦ if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((◡𝐹 “ {𝑖}) ∩ (◡𝐺 “ {𝑗}))))) | |
12 | c0ex 11204 | . . . 4 ⊢ 0 ∈ V | |
13 | fvex 6901 | . . . 4 ⊢ (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))) ∈ V | |
14 | 12, 13 | ifex 4577 | . . 3 ⊢ if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) ∈ V |
15 | 10, 11, 14 | ovmpoa 7559 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴𝐼𝐵) = if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵}))))) |
16 | iffalse 4536 | . 2 ⊢ (¬ (𝐴 = 0 ∧ 𝐵 = 0) → if((𝐴 = 0 ∧ 𝐵 = 0), 0, (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) | |
17 | 15, 16 | sylan9eq 2792 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ ¬ (𝐴 = 0 ∧ 𝐵 = 0)) → (𝐴𝐼𝐵) = (vol‘((◡𝐹 “ {𝐴}) ∩ (◡𝐺 “ {𝐵})))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∩ cin 3946 ifcif 4527 {csn 4627 ◡ccnv 5674 dom cdm 5675 “ cima 5678 ‘cfv 6540 (class class class)co 7405 ∈ cmpo 7407 ℝcr 11105 0cc0 11106 volcvol 24971 ∫1citg1 25123 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5298 ax-nul 5305 ax-pr 5426 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-mulcl 11168 ax-i2m1 11174 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rab 3433 df-v 3476 df-sbc 3777 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-br 5148 df-opab 5210 df-id 5573 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-iota 6492 df-fun 6542 df-fv 6548 df-ov 7408 df-oprab 7409 df-mpo 7410 |
This theorem is referenced by: itg1addlem4 25207 itg1addlem4OLD 25208 itg1addlem5 25209 |
Copyright terms: Public domain | W3C validator |