| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > i1f1lem | Structured version Visualization version GIF version | ||
| Description: Lemma for i1f1 25739 and itg11 25740. (Contributed by Mario Carneiro, 18-Jun-2014.) |
| Ref | Expression |
|---|---|
| i1f1.1 | ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 1, 0)) |
| Ref | Expression |
|---|---|
| i1f1lem | ⊢ (𝐹:ℝ⟶{0, 1} ∧ (𝐴 ∈ dom vol → (◡𝐹 “ {1}) = 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1ex 11169 | . . . . . 6 ⊢ 1 ∈ V | |
| 2 | 1 | prid2 4719 | . . . . 5 ⊢ 1 ∈ {0, 1} |
| 3 | c0ex 11166 | . . . . . 6 ⊢ 0 ∈ V | |
| 4 | 3 | prid1 4718 | . . . . 5 ⊢ 0 ∈ {0, 1} |
| 5 | 2, 4 | ifcli 4525 | . . . 4 ⊢ if(𝑥 ∈ 𝐴, 1, 0) ∈ {0, 1} |
| 6 | 5 | rgenw 3079 | . . 3 ⊢ ∀𝑥 ∈ ℝ if(𝑥 ∈ 𝐴, 1, 0) ∈ {0, 1} |
| 7 | i1f1.1 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 1, 0)) | |
| 8 | 7 | fmpt 7085 | . . 3 ⊢ (∀𝑥 ∈ ℝ if(𝑥 ∈ 𝐴, 1, 0) ∈ {0, 1} ↔ 𝐹:ℝ⟶{0, 1}) |
| 9 | 6, 8 | mpbi 232 | . 2 ⊢ 𝐹:ℝ⟶{0, 1} |
| 10 | 5 | a1i 11 | . . . . . . 7 ⊢ ((𝐴 ∈ dom vol ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, 1, 0) ∈ {0, 1}) |
| 11 | 10, 7 | fmptd 7089 | . . . . . 6 ⊢ (𝐴 ∈ dom vol → 𝐹:ℝ⟶{0, 1}) |
| 12 | ffn 6685 | . . . . . 6 ⊢ (𝐹:ℝ⟶{0, 1} → 𝐹 Fn ℝ) | |
| 13 | elpreima 7033 | . . . . . 6 ⊢ (𝐹 Fn ℝ → (𝑦 ∈ (◡𝐹 “ {1}) ↔ (𝑦 ∈ ℝ ∧ (𝐹‘𝑦) ∈ {1}))) | |
| 14 | 11, 12, 13 | 3syl 18 | . . . . 5 ⊢ (𝐴 ∈ dom vol → (𝑦 ∈ (◡𝐹 “ {1}) ↔ (𝑦 ∈ ℝ ∧ (𝐹‘𝑦) ∈ {1}))) |
| 15 | fvex 6874 | . . . . . . . 8 ⊢ (𝐹‘𝑦) ∈ V | |
| 16 | 15 | elsn 4594 | . . . . . . 7 ⊢ ((𝐹‘𝑦) ∈ {1} ↔ (𝐹‘𝑦) = 1) |
| 17 | eleq1w 2844 | . . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
| 18 | 17 | ifbid 4501 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → if(𝑥 ∈ 𝐴, 1, 0) = if(𝑦 ∈ 𝐴, 1, 0)) |
| 19 | 1, 3 | ifex 4528 | . . . . . . . . . 10 ⊢ if(𝑦 ∈ 𝐴, 1, 0) ∈ V |
| 20 | 18, 7, 19 | fvmpt 6969 | . . . . . . . . 9 ⊢ (𝑦 ∈ ℝ → (𝐹‘𝑦) = if(𝑦 ∈ 𝐴, 1, 0)) |
| 21 | 20 | eqeq1d 2763 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → ((𝐹‘𝑦) = 1 ↔ if(𝑦 ∈ 𝐴, 1, 0) = 1)) |
| 22 | 0ne1 12282 | . . . . . . . . . . 11 ⊢ 0 ≠ 1 | |
| 23 | iffalse 4486 | . . . . . . . . . . . . 13 ⊢ (¬ 𝑦 ∈ 𝐴 → if(𝑦 ∈ 𝐴, 1, 0) = 0) | |
| 24 | 23 | eqeq1d 2763 | . . . . . . . . . . . 12 ⊢ (¬ 𝑦 ∈ 𝐴 → (if(𝑦 ∈ 𝐴, 1, 0) = 1 ↔ 0 = 1)) |
| 25 | 24 | necon3bbid 2993 | . . . . . . . . . . 11 ⊢ (¬ 𝑦 ∈ 𝐴 → (¬ if(𝑦 ∈ 𝐴, 1, 0) = 1 ↔ 0 ≠ 1)) |
| 26 | 22, 25 | mpbiri 260 | . . . . . . . . . 10 ⊢ (¬ 𝑦 ∈ 𝐴 → ¬ if(𝑦 ∈ 𝐴, 1, 0) = 1) |
| 27 | 26 | con4i 114 | . . . . . . . . 9 ⊢ (if(𝑦 ∈ 𝐴, 1, 0) = 1 → 𝑦 ∈ 𝐴) |
| 28 | iftrue 4483 | . . . . . . . . 9 ⊢ (𝑦 ∈ 𝐴 → if(𝑦 ∈ 𝐴, 1, 0) = 1) | |
| 29 | 27, 28 | impbii 211 | . . . . . . . 8 ⊢ (if(𝑦 ∈ 𝐴, 1, 0) = 1 ↔ 𝑦 ∈ 𝐴) |
| 30 | 21, 29 | bitrdi 289 | . . . . . . 7 ⊢ (𝑦 ∈ ℝ → ((𝐹‘𝑦) = 1 ↔ 𝑦 ∈ 𝐴)) |
| 31 | 16, 30 | bitrid 285 | . . . . . 6 ⊢ (𝑦 ∈ ℝ → ((𝐹‘𝑦) ∈ {1} ↔ 𝑦 ∈ 𝐴)) |
| 32 | 31 | pm5.32i 582 | . . . . 5 ⊢ ((𝑦 ∈ ℝ ∧ (𝐹‘𝑦) ∈ {1}) ↔ (𝑦 ∈ ℝ ∧ 𝑦 ∈ 𝐴)) |
| 33 | 14, 32 | bitrdi 289 | . . . 4 ⊢ (𝐴 ∈ dom vol → (𝑦 ∈ (◡𝐹 “ {1}) ↔ (𝑦 ∈ ℝ ∧ 𝑦 ∈ 𝐴))) |
| 34 | mblss 25580 | . . . . . 6 ⊢ (𝐴 ∈ dom vol → 𝐴 ⊆ ℝ) | |
| 35 | 34 | sseld 3933 | . . . . 5 ⊢ (𝐴 ∈ dom vol → (𝑦 ∈ 𝐴 → 𝑦 ∈ ℝ)) |
| 36 | 35 | pm4.71rd 570 | . . . 4 ⊢ (𝐴 ∈ dom vol → (𝑦 ∈ 𝐴 ↔ (𝑦 ∈ ℝ ∧ 𝑦 ∈ 𝐴))) |
| 37 | 33, 36 | bitr4d 284 | . . 3 ⊢ (𝐴 ∈ dom vol → (𝑦 ∈ (◡𝐹 “ {1}) ↔ 𝑦 ∈ 𝐴)) |
| 38 | 37 | eqrdv 2759 | . 2 ⊢ (𝐴 ∈ dom vol → (◡𝐹 “ {1}) = 𝐴) |
| 39 | 9, 38 | pm3.2i 474 | 1 ⊢ (𝐹:ℝ⟶{0, 1} ∧ (𝐴 ∈ dom vol → (◡𝐹 “ {1}) = 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 ∀wral 3075 ifcif 4477 {csn 4579 {cpr 4581 ↦ cmpt 5178 ◡ccnv 5642 dom cdm 5643 “ cima 5646 Fn wfn 6510 ⟶wf 6511 ‘cfv 6515 ℝcr 11065 0cc0 11066 1c1 11067 volcvol 25512 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7712 ax-cnex 11122 ax-resscn 11123 ax-1cn 11124 ax-icn 11125 ax-addcl 11126 ax-addrcl 11127 ax-mulcl 11128 ax-mulrcl 11129 ax-mulcom 11130 ax-addass 11131 ax-mulass 11132 ax-distr 11133 ax-i2m1 11134 ax-1ne0 11135 ax-1rid 11136 ax-rnegex 11137 ax-rrecex 11138 ax-cnre 11139 ax-pre-lttri 11140 ax-pre-lttrn 11141 ax-pre-ltadd 11142 ax-pre-mulgt0 11143 ax-pre-sup 11144 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7841 df-1st 7964 df-2nd 7965 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-rdg 8374 df-er 8671 df-map 8803 df-en 8921 df-dom 8922 df-sdom 8923 df-sup 9381 df-inf 9382 df-pnf 11211 df-mnf 11212 df-xr 11213 df-ltxr 11214 df-le 11215 df-sub 11409 df-neg 11410 df-div 11838 df-nn 12204 df-2 12273 df-3 12274 df-n0 12475 df-z 12562 df-uz 12833 df-rp 12987 df-ico 13348 df-icc 13349 df-fz 13506 df-seq 14008 df-exp 14068 df-cj 15116 df-re 15117 df-im 15118 df-sqrt 15252 df-abs 15253 df-ovol 25513 df-vol 25514 |
| This theorem is referenced by: i1f1 25739 itg11 25740 |
| Copyright terms: Public domain | W3C validator |