| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > indpi1 | Structured version Visualization version GIF version | ||
| Description: Preimage of the singleton {1} by the indicator function. See i1f1lem 26022. (Contributed by Thierry Arnoux, 21-Aug-2017.) |
| Ref | Expression |
|---|---|
| indpi1 | ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (◡((𝟭‘𝑂)‘𝐴) “ {1}) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ind1a 12341 | . . . . 5 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂 ∧ 𝑥 ∈ 𝑂) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) = 1 ↔ 𝑥 ∈ 𝐴)) | |
| 2 | 1 | 3expia 1139 | . . . 4 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (𝑥 ∈ 𝑂 → ((((𝟭‘𝑂)‘𝐴)‘𝑥) = 1 ↔ 𝑥 ∈ 𝐴))) |
| 3 | 2 | pm5.32d 588 | . . 3 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → ((𝑥 ∈ 𝑂 ∧ (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1) ↔ (𝑥 ∈ 𝑂 ∧ 𝑥 ∈ 𝐴))) |
| 4 | indf 12336 | . . . 4 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → ((𝟭‘𝑂)‘𝐴):𝑂⟶{0, 1}) | |
| 5 | ffn 6717 | . . . 4 ⊢ (((𝟭‘𝑂)‘𝐴):𝑂⟶{0, 1} → ((𝟭‘𝑂)‘𝐴) Fn 𝑂) | |
| 6 | fniniseg 7067 | . . . 4 ⊢ (((𝟭‘𝑂)‘𝐴) Fn 𝑂 → (𝑥 ∈ (◡((𝟭‘𝑂)‘𝐴) “ {1}) ↔ (𝑥 ∈ 𝑂 ∧ (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1))) | |
| 7 | 4, 5, 6 | 3syl 19 | . . 3 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (𝑥 ∈ (◡((𝟭‘𝑂)‘𝐴) “ {1}) ↔ (𝑥 ∈ 𝑂 ∧ (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1))) |
| 8 | ssel 3906 | . . . . 5 ⊢ (𝐴 ⊆ 𝑂 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝑂)) | |
| 9 | 8 | pm4.71rd 572 | . . . 4 ⊢ (𝐴 ⊆ 𝑂 → (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝑂 ∧ 𝑥 ∈ 𝐴))) |
| 10 | 9 | adantl 487 | . . 3 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝑂 ∧ 𝑥 ∈ 𝐴))) |
| 11 | 3, 7, 10 | 3bitr4d 314 | . 2 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (𝑥 ∈ (◡((𝟭‘𝑂)‘𝐴) “ {1}) ↔ 𝑥 ∈ 𝐴)) |
| 12 | 11 | eqrdv 2761 | 1 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (◡((𝟭‘𝑂)‘𝐴) “ {1}) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2146 ⊆ wss 3899 {csn 4587 {cpr 4589 ◡ccnv 5653 “ cima 5657 Fn wfn 6541 ⟶wf 6542 ‘cfv 6546 0cc0 11210 1c1 11211 𝟭cind 12330 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-i2m1 11278 ax-1ne0 11279 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-id 5549 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-ov 7430 df-ind 12331 |
| This theorem is used by: indf1ofs 33486 indsupp 33487 eulerpartlemgf 35064 |
| Copyright terms: Public domain | W3C validator |