| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > indval | Structured version Visualization version GIF version | ||
| Description: Value of the indicator function generator for a set 𝐴 and a domain 𝑂, i.e., an indicator function for a given domain 𝑂 and a given subset 𝐴 of the domain. (Contributed by Thierry Arnoux, 2-Feb-2017.) |
| Ref | Expression |
|---|---|
| indval | ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → ((𝟭‘𝑂)‘𝐴) = (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝐴, 1, 0))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | indv 12208 | . . 3 ⊢ (𝑂 ∈ 𝑉 → (𝟭‘𝑂) = (𝑎 ∈ 𝒫 𝑂 ↦ (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0)))) | |
| 2 | 1 | adantr 485 | . 2 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (𝟭‘𝑂) = (𝑎 ∈ 𝒫 𝑂 ↦ (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0)))) |
| 3 | eleq2 2854 | . . . . 5 ⊢ (𝑎 = 𝐴 → (𝑥 ∈ 𝑎 ↔ 𝑥 ∈ 𝐴)) | |
| 4 | 3 | ifbid 4507 | . . . 4 ⊢ (𝑎 = 𝐴 → if(𝑥 ∈ 𝑎, 1, 0) = if(𝑥 ∈ 𝐴, 1, 0)) |
| 5 | 4 | mpteq2dv 5198 | . . 3 ⊢ (𝑎 = 𝐴 → (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0)) = (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝐴, 1, 0))) |
| 6 | 5 | adantl 486 | . 2 ⊢ (((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) ∧ 𝑎 = 𝐴) → (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0)) = (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝐴, 1, 0))) |
| 7 | ssexg 5283 | . . . 4 ⊢ ((𝐴 ⊆ 𝑂 ∧ 𝑂 ∈ 𝑉) → 𝐴 ∈ V) | |
| 8 | 7 | ancoms 463 | . . 3 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → 𝐴 ∈ V) |
| 9 | simpr 489 | . . 3 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → 𝐴 ⊆ 𝑂) | |
| 10 | 8, 9 | elpwd 4564 | . 2 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → 𝐴 ∈ 𝒫 𝑂) |
| 11 | mptexg 7209 | . . 3 ⊢ (𝑂 ∈ 𝑉 → (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝐴, 1, 0)) ∈ V) | |
| 12 | 11 | adantr 485 | . 2 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝐴, 1, 0)) ∈ V) |
| 13 | 2, 6, 10, 12 | fvmptd 6987 | 1 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → ((𝟭‘𝑂)‘𝐴) = (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝐴, 1, 0))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 Vcvv 3457 ⊆ wss 3907 ifcif 4483 𝒫 cpw 4558 ↦ cmpt 5185 ‘cfv 6525 0cc0 11088 1c1 11089 𝟭cind 12206 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5231 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5105 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-ind 12207 |
| This theorem is referenced by: indval2 12211 indf 12212 indfval 12213 indsn 33091 mvrvalind 33840 mplmulmvr 33841 esplyfvaln 33876 indprm 48237 indprmfz 48238 |
| Copyright terms: Public domain | W3C validator |