| 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 25918. (Contributed by Thierry Arnoux, 21-Aug-2017.) |
| Ref | Expression |
|---|---|
| indpi1 | ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (◡((𝟭‘𝑂)‘𝐴) “ {1}) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ind1a 12254 | . . . . 5 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂 ∧ 𝑥 ∈ 𝑂) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) = 1 ↔ 𝑥 ∈ 𝐴)) | |
| 2 | 1 | 3expia 1139 | . . . 4 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (𝑥 ∈ 𝑂 → ((((𝟭‘𝑂)‘𝐴)‘𝑥) = 1 ↔ 𝑥 ∈ 𝐴))) |
| 3 | 2 | pm5.32d 588 | . . 3 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → ((𝑥 ∈ 𝑂 ∧ (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1) ↔ (𝑥 ∈ 𝑂 ∧ 𝑥 ∈ 𝐴))) |
| 4 | indf 12249 | . . . 4 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → ((𝟭‘𝑂)‘𝐴):𝑂⟶{0, 1}) | |
| 5 | ffn 6703 | . . . 4 ⊢ (((𝟭‘𝑂)‘𝐴):𝑂⟶{0, 1} → ((𝟭‘𝑂)‘𝐴) Fn 𝑂) | |
| 6 | fniniseg 7053 | . . . 4 ⊢ (((𝟭‘𝑂)‘𝐴) Fn 𝑂 → (𝑥 ∈ (◡((𝟭‘𝑂)‘𝐴) “ {1}) ↔ (𝑥 ∈ 𝑂 ∧ (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1))) | |
| 7 | 4, 5, 6 | 3syl 19 | . . 3 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (𝑥 ∈ (◡((𝟭‘𝑂)‘𝐴) “ {1}) ↔ (𝑥 ∈ 𝑂 ∧ (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1))) |
| 8 | ssel 3925 | . . . . 5 ⊢ (𝐴 ⊆ 𝑂 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝑂)) | |
| 9 | 8 | pm4.71rd 572 | . . . 4 ⊢ (𝐴 ⊆ 𝑂 → (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝑂 ∧ 𝑥 ∈ 𝐴))) |
| 10 | 9 | adantl 487 | . . 3 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝑂 ∧ 𝑥 ∈ 𝐴))) |
| 11 | 3, 7, 10 | 3bitr4d 314 | . 2 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (𝑥 ∈ (◡((𝟭‘𝑂)‘𝐴) “ {1}) ↔ 𝑥 ∈ 𝐴)) |
| 12 | 11 | eqrdv 2758 | 1 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (◡((𝟭‘𝑂)‘𝐴) “ {1}) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 {csn 4584 {cpr 4586 ◡ccnv 5654 “ cima 5658 Fn wfn 6528 ⟶wf 6529 ‘cfv 6533 0cc0 11125 1c1 11126 𝟭cind 12243 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-i2m1 11193 ax-1ne0 11194 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7417 df-ind 12244 |
| This theorem is used by: indf1ofs 33313 indsupp 33314 eulerpartlemgf 34891 |
| Copyright terms: Public domain | W3C validator |