| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > i1f1lem | Structured version Visualization version GIF version | ||
| Description: Lemma for i1f1 25591 and itg11 25592. (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 11170 | . . . . . 6 ⊢ 1 ∈ V | |
| 2 | 1 | prid2 4727 | . . . . 5 ⊢ 1 ∈ {0, 1} |
| 3 | c0ex 11168 | . . . . . 6 ⊢ 0 ∈ V | |
| 4 | 3 | prid1 4726 | . . . . 5 ⊢ 0 ∈ {0, 1} |
| 5 | 2, 4 | ifcli 4536 | . . . 4 ⊢ if(𝑥 ∈ 𝐴, 1, 0) ∈ {0, 1} |
| 6 | 5 | rgenw 3048 | . . 3 ⊢ ∀𝑥 ∈ ℝ if(𝑥 ∈ 𝐴, 1, 0) ∈ {0, 1} |
| 7 | i1f1.1 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 1, 0)) | |
| 8 | 7 | fmpt 7082 | . . 3 ⊢ (∀𝑥 ∈ ℝ if(𝑥 ∈ 𝐴, 1, 0) ∈ {0, 1} ↔ 𝐹:ℝ⟶{0, 1}) |
| 9 | 6, 8 | mpbi 230 | . 2 ⊢ 𝐹:ℝ⟶{0, 1} |
| 10 | 5 | a1i 11 | . . . . . . 7 ⊢ ((𝐴 ∈ dom vol ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, 1, 0) ∈ {0, 1}) |
| 11 | 10, 7 | fmptd 7086 | . . . . . 6 ⊢ (𝐴 ∈ dom vol → 𝐹:ℝ⟶{0, 1}) |
| 12 | ffn 6688 | . . . . . 6 ⊢ (𝐹:ℝ⟶{0, 1} → 𝐹 Fn ℝ) | |
| 13 | elpreima 7030 | . . . . . 6 ⊢ (𝐹 Fn ℝ → (𝑦 ∈ (◡𝐹 “ {1}) ↔ (𝑦 ∈ ℝ ∧ (𝐹‘𝑦) ∈ {1}))) | |
| 14 | 11, 12, 13 | 3syl 18 | . . . . 5 ⊢ (𝐴 ∈ dom vol → (𝑦 ∈ (◡𝐹 “ {1}) ↔ (𝑦 ∈ ℝ ∧ (𝐹‘𝑦) ∈ {1}))) |
| 15 | fvex 6871 | . . . . . . . 8 ⊢ (𝐹‘𝑦) ∈ V | |
| 16 | 15 | elsn 4604 | . . . . . . 7 ⊢ ((𝐹‘𝑦) ∈ {1} ↔ (𝐹‘𝑦) = 1) |
| 17 | eleq1w 2811 | . . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
| 18 | 17 | ifbid 4512 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → if(𝑥 ∈ 𝐴, 1, 0) = if(𝑦 ∈ 𝐴, 1, 0)) |
| 19 | 1, 3 | ifex 4539 | . . . . . . . . . 10 ⊢ if(𝑦 ∈ 𝐴, 1, 0) ∈ V |
| 20 | 18, 7, 19 | fvmpt 6968 | . . . . . . . . 9 ⊢ (𝑦 ∈ ℝ → (𝐹‘𝑦) = if(𝑦 ∈ 𝐴, 1, 0)) |
| 21 | 20 | eqeq1d 2731 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → ((𝐹‘𝑦) = 1 ↔ if(𝑦 ∈ 𝐴, 1, 0) = 1)) |
| 22 | 0ne1 12257 | . . . . . . . . . . 11 ⊢ 0 ≠ 1 | |
| 23 | iffalse 4497 | . . . . . . . . . . . . 13 ⊢ (¬ 𝑦 ∈ 𝐴 → if(𝑦 ∈ 𝐴, 1, 0) = 0) | |
| 24 | 23 | eqeq1d 2731 | . . . . . . . . . . . 12 ⊢ (¬ 𝑦 ∈ 𝐴 → (if(𝑦 ∈ 𝐴, 1, 0) = 1 ↔ 0 = 1)) |
| 25 | 24 | necon3bbid 2962 | . . . . . . . . . . 11 ⊢ (¬ 𝑦 ∈ 𝐴 → (¬ if(𝑦 ∈ 𝐴, 1, 0) = 1 ↔ 0 ≠ 1)) |
| 26 | 22, 25 | mpbiri 258 | . . . . . . . . . 10 ⊢ (¬ 𝑦 ∈ 𝐴 → ¬ if(𝑦 ∈ 𝐴, 1, 0) = 1) |
| 27 | 26 | con4i 114 | . . . . . . . . 9 ⊢ (if(𝑦 ∈ 𝐴, 1, 0) = 1 → 𝑦 ∈ 𝐴) |
| 28 | iftrue 4494 | . . . . . . . . 9 ⊢ (𝑦 ∈ 𝐴 → if(𝑦 ∈ 𝐴, 1, 0) = 1) | |
| 29 | 27, 28 | impbii 209 | . . . . . . . 8 ⊢ (if(𝑦 ∈ 𝐴, 1, 0) = 1 ↔ 𝑦 ∈ 𝐴) |
| 30 | 21, 29 | bitrdi 287 | . . . . . . 7 ⊢ (𝑦 ∈ ℝ → ((𝐹‘𝑦) = 1 ↔ 𝑦 ∈ 𝐴)) |
| 31 | 16, 30 | bitrid 283 | . . . . . 6 ⊢ (𝑦 ∈ ℝ → ((𝐹‘𝑦) ∈ {1} ↔ 𝑦 ∈ 𝐴)) |
| 32 | 31 | pm5.32i 574 | . . . . 5 ⊢ ((𝑦 ∈ ℝ ∧ (𝐹‘𝑦) ∈ {1}) ↔ (𝑦 ∈ ℝ ∧ 𝑦 ∈ 𝐴)) |
| 33 | 14, 32 | bitrdi 287 | . . . 4 ⊢ (𝐴 ∈ dom vol → (𝑦 ∈ (◡𝐹 “ {1}) ↔ (𝑦 ∈ ℝ ∧ 𝑦 ∈ 𝐴))) |
| 34 | mblss 25432 | . . . . . 6 ⊢ (𝐴 ∈ dom vol → 𝐴 ⊆ ℝ) | |
| 35 | 34 | sseld 3945 | . . . . 5 ⊢ (𝐴 ∈ dom vol → (𝑦 ∈ 𝐴 → 𝑦 ∈ ℝ)) |
| 36 | 35 | pm4.71rd 562 | . . . 4 ⊢ (𝐴 ∈ dom vol → (𝑦 ∈ 𝐴 ↔ (𝑦 ∈ ℝ ∧ 𝑦 ∈ 𝐴))) |
| 37 | 33, 36 | bitr4d 282 | . . 3 ⊢ (𝐴 ∈ dom vol → (𝑦 ∈ (◡𝐹 “ {1}) ↔ 𝑦 ∈ 𝐴)) |
| 38 | 37 | eqrdv 2727 | . 2 ⊢ (𝐴 ∈ dom vol → (◡𝐹 “ {1}) = 𝐴) |
| 39 | 9, 38 | pm3.2i 470 | 1 ⊢ (𝐹:ℝ⟶{0, 1} ∧ (𝐴 ∈ dom vol → (◡𝐹 “ {1}) = 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∀wral 3044 ifcif 4488 {csn 4589 {cpr 4591 ↦ cmpt 5188 ◡ccnv 5637 dom cdm 5638 “ cima 5641 Fn wfn 6506 ⟶wf 6507 ‘cfv 6511 ℝcr 11067 0cc0 11068 1c1 11069 volcvol 25364 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-pre-sup 11146 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-er 8671 df-map 8801 df-en 8919 df-dom 8920 df-sdom 8921 df-sup 9393 df-inf 9394 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-div 11836 df-nn 12187 df-2 12249 df-3 12250 df-n0 12443 df-z 12530 df-uz 12794 df-rp 12952 df-ico 13312 df-icc 13313 df-fz 13469 df-seq 13967 df-exp 14027 df-cj 15065 df-re 15066 df-im 15067 df-sqrt 15201 df-abs 15202 df-ovol 25365 df-vol 25366 |
| This theorem is referenced by: i1f1 25591 itg11 25592 |
| Copyright terms: Public domain | W3C validator |