| 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 12190 | . . 3 ⊢ (𝑂 ∈ 𝑉 → (𝟭‘𝑂) = (𝑎 ∈ 𝒫 𝑂 ↦ (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0)))) | |
| 2 | 1 | adantr 484 | . 2 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (𝟭‘𝑂) = (𝑎 ∈ 𝒫 𝑂 ↦ (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0)))) |
| 3 | eleq2 2850 | . . . . 5 ⊢ (𝑎 = 𝐴 → (𝑥 ∈ 𝑎 ↔ 𝑥 ∈ 𝐴)) | |
| 4 | 3 | ifbid 4501 | . . . 4 ⊢ (𝑎 = 𝐴 → if(𝑥 ∈ 𝑎, 1, 0) = if(𝑥 ∈ 𝐴, 1, 0)) |
| 5 | 4 | mpteq2dv 5191 | . . 3 ⊢ (𝑎 = 𝐴 → (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0)) = (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝐴, 1, 0))) |
| 6 | 5 | adantl 485 | . 2 ⊢ (((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) ∧ 𝑎 = 𝐴) → (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0)) = (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝐴, 1, 0))) |
| 7 | ssexg 5276 | . . . 4 ⊢ ((𝐴 ⊆ 𝑂 ∧ 𝑂 ∈ 𝑉) → 𝐴 ∈ V) | |
| 8 | 7 | ancoms 462 | . . 3 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → 𝐴 ∈ V) |
| 9 | simpr 488 | . . 3 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → 𝐴 ⊆ 𝑂) | |
| 10 | 8, 9 | elpwd 4558 | . 2 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → 𝐴 ∈ 𝒫 𝑂) |
| 11 | mptexg 7199 | . . 3 ⊢ (𝑂 ∈ 𝑉 → (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝐴, 1, 0)) ∈ V) | |
| 12 | 11 | adantr 484 | . 2 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝐴, 1, 0)) ∈ V) |
| 13 | 2, 6, 10, 12 | fvmptd 6977 | 1 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → ((𝟭‘𝑂)‘𝐴) = (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝐴, 1, 0))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 Vcvv 3453 ⊆ wss 3902 ifcif 4477 𝒫 cpw 4552 ↦ cmpt 5178 ‘cfv 6515 0cc0 11066 1c1 11067 𝟭cind 12188 |
| 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-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 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-ral 3076 df-rex 3086 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-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-id 5538 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-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-ind 12189 |
| This theorem is referenced by: indval2 12193 indf 12194 indfval 12195 indsn 33001 mvrvalind 33795 mplmulmvr 33796 esplyfvaln 33831 indprm 48198 indprmfz 48199 |
| Copyright terms: Public domain | W3C validator |