| 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 26010. (Contributed by Thierry Arnoux, 21-Aug-2017.) |
| Ref | Expression |
|---|---|
| indpi1 | ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (◡((𝟭‘𝑂)‘𝐴) “ {1}) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ind1a 12331 | . . . . 5 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂 ∧ 𝑥 ∈ 𝑂) → ((((𝟭‘𝑂)‘𝐴)‘𝑥) = 1 ↔ 𝑥 ∈ 𝐴)) | |
| 2 | 1 | 3expia 1139 | . . . 4 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → (𝑥 ∈ 𝑂 → ((((𝟭‘𝑂)‘𝐴)‘𝑥) = 1 ↔ 𝑥 ∈ 𝐴))) |
| 3 | 2 | pm5.32d 588 | . . 3 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → ((𝑥 ∈ 𝑂 ∧ (((𝟭‘𝑂)‘𝐴)‘𝑥) = 1) ↔ (𝑥 ∈ 𝑂 ∧ 𝑥 ∈ 𝐴))) |
| 4 | indf 12326 | . . . 4 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂) → ((𝟭‘𝑂)‘𝐴):𝑂⟶{0, 1}) | |
| 5 | ffn 6709 | . . . 4 ⊢ (((𝟭‘𝑂)‘𝐴):𝑂⟶{0, 1} → ((𝟭‘𝑂)‘𝐴) Fn 𝑂) | |
| 6 | fniniseg 7059 | . . . 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 2759 | 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 5650 “ cima 5654 Fn wfn 6533 ⟶wf 6534 ‘cfv 6538 0cc0 11200 1c1 11201 𝟭cind 12320 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-i2m1 11268 ax-1ne0 11269 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 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 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-ind 12321 |
| This theorem is used by: indf1ofs 33433 indsupp 33434 eulerpartlemgf 35011 |
| Copyright terms: Public domain | W3C validator |