![]() |
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 11293 | . . 3 ⊢ (𝑂 ∈ 𝑉 → 0 ∈ ℝ) | |
3 | 1red 11291 | . . 3 ⊢ (𝑂 ∈ 𝑉 → 1 ∈ ℝ) | |
4 | 0ne1 12364 | . . . 4 ⊢ 0 ≠ 1 | |
5 | 4 | a1i 11 | . . 3 ⊢ (𝑂 ∈ 𝑉 → 0 ≠ 1) |
6 | eqid 2740 | . . 3 ⊢ (𝑎 ∈ 𝒫 𝑂 ↦ (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0))) = (𝑎 ∈ 𝒫 𝑂 ↦ (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0))) | |
7 | 1, 2, 3, 5, 6 | pw2f1o 9143 | . 2 ⊢ (𝑂 ∈ 𝑉 → (𝑎 ∈ 𝒫 𝑂 ↦ (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0))):𝒫 𝑂–1-1-onto→({0, 1} ↑m 𝑂)) |
8 | indv 33976 | . . 3 ⊢ (𝑂 ∈ 𝑉 → (𝟭‘𝑂) = (𝑎 ∈ 𝒫 𝑂 ↦ (𝑥 ∈ 𝑂 ↦ if(𝑥 ∈ 𝑎, 1, 0)))) | |
9 | 8 | f1oeq1d 6857 | . 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 2108 ≠ wne 2946 ifcif 4548 𝒫 cpw 4622 {cpr 4650 ↦ cmpt 5249 –1-1-onto→wf1o 6572 ‘cfv 6573 (class class class)co 7448 ↑m cmap 8884 ℝcr 11183 0cc0 11184 1c1 11185 𝟭cind 33974 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-i2m1 11252 ax-1ne0 11253 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-ov 7451 df-oprab 7452 df-mpo 7453 df-map 8886 df-ind 33975 |
This theorem is referenced by: indf1ofs 33990 eulerpartgbij 34337 |
Copyright terms: Public domain | W3C validator |