| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ind1a | Structured version Visualization version GIF version | ||
| Description: Value of the indicator function where it is 1. (Contributed by Thierry Arnoux, 22-Aug-2017.) |
| Ref | Expression |
|---|---|
| ind1a | ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂 ∧ 𝑋 ∈ 𝑂) → ((((𝟭‘𝑂)‘𝐴)‘𝑋) = 1 ↔ 𝑋 ∈ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | indfval 12252 | . . 3 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂 ∧ 𝑋 ∈ 𝑂) → (((𝟭‘𝑂)‘𝐴)‘𝑋) = if(𝑋 ∈ 𝐴, 1, 0)) | |
| 2 | 1 | eqeq1d 2762 | . 2 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂 ∧ 𝑋 ∈ 𝑂) → ((((𝟭‘𝑂)‘𝐴)‘𝑋) = 1 ↔ if(𝑋 ∈ 𝐴, 1, 0) = 1)) |
| 3 | eqid 2760 | . . . . 5 ⊢ 1 = 1 | |
| 4 | 3 | biantru 539 | . . . 4 ⊢ (𝑋 ∈ 𝐴 ↔ (𝑋 ∈ 𝐴 ∧ 1 = 1)) |
| 5 | ax-1ne0 11196 | . . . . . 6 ⊢ 1 ≠ 0 | |
| 6 | 5 | neii 2957 | . . . . 5 ⊢ ¬ 1 = 0 |
| 7 | 6 | biorfri 953 | . . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 1 = 1) ↔ ((𝑋 ∈ 𝐴 ∧ 1 = 1) ∨ 1 = 0)) |
| 8 | 6 | bianfi 543 | . . . . 5 ⊢ (1 = 0 ↔ (¬ 𝑋 ∈ 𝐴 ∧ 1 = 0)) |
| 9 | 8 | orbi2i 926 | . . . 4 ⊢ (((𝑋 ∈ 𝐴 ∧ 1 = 1) ∨ 1 = 0) ↔ ((𝑋 ∈ 𝐴 ∧ 1 = 1) ∨ (¬ 𝑋 ∈ 𝐴 ∧ 1 = 0))) |
| 10 | 4, 7, 9 | 3bitri 300 | . . 3 ⊢ (𝑋 ∈ 𝐴 ↔ ((𝑋 ∈ 𝐴 ∧ 1 = 1) ∨ (¬ 𝑋 ∈ 𝐴 ∧ 1 = 0))) |
| 11 | eqif 4524 | . . 3 ⊢ (1 = if(𝑋 ∈ 𝐴, 1, 0) ↔ ((𝑋 ∈ 𝐴 ∧ 1 = 1) ∨ (¬ 𝑋 ∈ 𝐴 ∧ 1 = 0))) | |
| 12 | eqcom 2767 | . . 3 ⊢ (1 = if(𝑋 ∈ 𝐴, 1, 0) ↔ if(𝑋 ∈ 𝐴, 1, 0) = 1) | |
| 13 | 10, 11, 12 | 3bitr2ri 303 | . 2 ⊢ (if(𝑋 ∈ 𝐴, 1, 0) = 1 ↔ 𝑋 ∈ 𝐴) |
| 14 | 2, 13 | bitrdi 290 | 1 ⊢ ((𝑂 ∈ 𝑉 ∧ 𝐴 ⊆ 𝑂 ∧ 𝑋 ∈ 𝑂) → ((((𝟭‘𝑂)‘𝐴)‘𝑋) = 1 ↔ 𝑋 ∈ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 ifcif 4482 ‘cfv 6533 0cc0 11127 1c1 11128 𝟭cind 12245 |
| 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 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-i2m1 11195 ax-1ne0 11196 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 |
| 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 12246 |
| This theorem is used by: indpi1 12259 prodindf 33311 indpreima 33314 esplymhp 34081 |
| Copyright terms: Public domain | W3C validator |