| 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 26065. (Contributed by Thierry Arnoux, 21-Aug-2017.) |
| Ref | Expression |
|---|---|
| indpi1 | ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (◡((𝟭‘𝑂)‘𝐴) “ {1}) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ind1a 12371 | . . . . 5 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂 ∧ 𝑥 ∈ 𝑂) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) = 1 ↔ 𝑥 ∈ 𝐴)) | |
| 2 | 1 | 3expia 1139 | . . . 4 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (𝑥 ∈ 𝑂 → ((((𝟭‘𝑂)‘𝐴)‘𝑥) = 1 ↔ 𝑥 ∈ 𝐴))) |
| 3 | 2 | pm5.32d 588 | . . 3 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → ((𝑥 ∈ 𝑂 ∧ (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1) ↔ (𝑥 ∈ 𝑂 ∧ 𝑥 ∈ 𝐴))) |
| 4 | indf 12366 | . . . 4 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → ((𝟭‘𝑂)‘𝐴):𝑂⟶{0, 1}) | |
| 5 | ffn 6739 | . . . 4 ⊢ (((𝟭‘𝑂)‘𝐴):𝑂⟶{0, 1} → ((𝟭‘𝑂)‘𝐴) Fn 𝑂) | |
| 6 | fniniseg 7091 | . . . 4 ⊢ (((𝟭‘𝑂)‘𝐴) Fn 𝑂 → (𝑥 ∈ (◡((𝟭‘𝑂)‘𝐴) “ {1}) ↔ (𝑥 ∈ 𝑂 ∧ (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1))) | |
| 7 | 4, 5, 6 | 3syl 19 | . . 3 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (𝑥 ∈ (◡((𝟭‘𝑂)‘𝐴) “ {1}) ↔ (𝑥 ∈ 𝑂 ∧ (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1))) |
| 8 | ssel 3907 | . . . . 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 1570 ∈ wcel 2147 ⊆ wss 3900 {csn 4588 {cpr 4590 ◡ccnv 5657 “ cima 5661 Fn wfn 6561 ⟶wf 6562 ‘cfv 6566 0cc0 11239 1c1 11240 𝟭cind 12360 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-i2m1 11307 ax-1ne0 11308 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-ind 12361 |
| This theorem is used by: indf1ofs 33529 indsupp 33530 eulerpartlemgf 35122 |
| Copyright terms: Public domain | W3C validator |