![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > indf1o | Structured version Visualization version GIF version |
Description: The bijection between a power set and the set of indicator functions. (Contributed by Thierry Arnoux, 14-Aug-2017.) |
Ref | Expression |
---|---|
indf1o | ⊢ (𝑂 ∈ 𝑉 → (𝟭‘𝑂):𝒫 𝑂–1-1-onto→({0, 1} ↑m 𝑂)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | id 22 | . . 3 ⊢ (𝑂 ∈ 𝑉 → 𝑂 ∈ 𝑉) | |
2 | 0red 11224 | . . 3 ⊢ (𝑂 ∈ 𝑉 → 0 ∈ ℝ) | |
3 | 1red 11222 | . . 3 ⊢ (𝑂 ∈ 𝑉 → 1 ∈ ℝ) | |
4 | 0ne1 12290 | . . . 4 ⊢ 0 ≠ 1 | |
5 | 4 | a1i 11 | . . 3 ⊢ (𝑂 ∈ 𝑉 → 0 ≠ 1) |
6 | eqid 2731 | . . 3 ⊢ (𝑎 ∈ 𝒫 𝑂 ↦ (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0))) = (𝑎 ∈ 𝒫 𝑂 ↦ (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0))) | |
7 | 1, 2, 3, 5, 6 | pw2f1o 9083 | . 2 ⊢ (𝑂 ∈ 𝑉 → (𝑎 ∈ 𝒫 𝑂 ↦ (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0))):𝒫 𝑂–1-1-onto→({0, 1} ↑m 𝑂)) |
8 | indv 33475 | . . 3 ⊢ (𝑂 ∈ 𝑉 → (𝟭‘𝑂) = (𝑎 ∈ 𝒫 𝑂 ↦ (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0)))) | |
9 | 8 | f1oeq1d 6828 | . 2 ⊢ (𝑂 ∈ 𝑉 → ((𝟭‘𝑂):𝒫 𝑂–1-1-onto→({0, 1} ↑m 𝑂) ↔ (𝑎 ∈ 𝒫 𝑂 ↦ (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0))):𝒫 𝑂–1-1-onto→({0, 1} ↑m 𝑂))) |
10 | 7, 9 | mpbird 257 | 1 ⊢ (𝑂 ∈ 𝑉 → (𝟭‘𝑂):𝒫 𝑂–1-1-onto→({0, 1} ↑m 𝑂)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2105 ≠ wne 2939 ifcif 4528 𝒫 cpw 4602 {cpr 4630 ↦ cmpt 5231 –1-1-onto→wf1o 6542 ‘cfv 6543 (class class class)co 7412 ↑m cmap 8826 ℝcr 11115 0cc0 11116 1c1 11117 𝟭cind 33473 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7729 ax-1cn 11174 ax-icn 11175 ax-addcl 11176 ax-addrcl 11177 ax-mulcl 11178 ax-mulrcl 11179 ax-i2m1 11184 ax-1ne0 11185 ax-rnegex 11187 ax-rrecex 11188 ax-cnre 11189 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7415 df-oprab 7416 df-mpo 7417 df-map 8828 df-ind 33474 |
This theorem is referenced by: indf1ofs 33489 eulerpartgbij 33836 |
Copyright terms: Public domain | W3C validator |