![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > suppval1 | Structured version Visualization version GIF version |
Description: The value of the operation constructing the support of a function. (Contributed by AV, 6-Apr-2019.) |
Ref | Expression |
---|---|
suppval1 | ⊢ ((Fun 𝑋 ∧ 𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝑋 supp 𝑍) = {𝑖 ∈ dom 𝑋 ∣ (𝑋‘𝑖) ≠ 𝑍}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | suppval 8186 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝑋 supp 𝑍) = {𝑖 ∈ dom 𝑋 ∣ (𝑋 “ {𝑖}) ≠ {𝑍}}) | |
2 | 1 | 3adant1 1129 | . 2 ⊢ ((Fun 𝑋 ∧ 𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝑋 supp 𝑍) = {𝑖 ∈ dom 𝑋 ∣ (𝑋 “ {𝑖}) ≠ {𝑍}}) |
3 | funfn 6598 | . . . . . . . . 9 ⊢ (Fun 𝑋 ↔ 𝑋 Fn dom 𝑋) | |
4 | 3 | biimpi 216 | . . . . . . . 8 ⊢ (Fun 𝑋 → 𝑋 Fn dom 𝑋) |
5 | 4 | 3ad2ant1 1132 | . . . . . . 7 ⊢ ((Fun 𝑋 ∧ 𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → 𝑋 Fn dom 𝑋) |
6 | fnsnfv 6988 | . . . . . . 7 ⊢ ((𝑋 Fn dom 𝑋 ∧ 𝑖 ∈ dom 𝑋) → {(𝑋‘𝑖)} = (𝑋 “ {𝑖})) | |
7 | 5, 6 | sylan 580 | . . . . . 6 ⊢ (((Fun 𝑋 ∧ 𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑖 ∈ dom 𝑋) → {(𝑋‘𝑖)} = (𝑋 “ {𝑖})) |
8 | 7 | eqcomd 2741 | . . . . 5 ⊢ (((Fun 𝑋 ∧ 𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑖 ∈ dom 𝑋) → (𝑋 “ {𝑖}) = {(𝑋‘𝑖)}) |
9 | 8 | neeq1d 2998 | . . . 4 ⊢ (((Fun 𝑋 ∧ 𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑖 ∈ dom 𝑋) → ((𝑋 “ {𝑖}) ≠ {𝑍} ↔ {(𝑋‘𝑖)} ≠ {𝑍})) |
10 | fvex 6920 | . . . . . 6 ⊢ (𝑋‘𝑖) ∈ V | |
11 | sneqbg 4848 | . . . . . 6 ⊢ ((𝑋‘𝑖) ∈ V → ({(𝑋‘𝑖)} = {𝑍} ↔ (𝑋‘𝑖) = 𝑍)) | |
12 | 10, 11 | mp1i 13 | . . . . 5 ⊢ (((Fun 𝑋 ∧ 𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑖 ∈ dom 𝑋) → ({(𝑋‘𝑖)} = {𝑍} ↔ (𝑋‘𝑖) = 𝑍)) |
13 | 12 | necon3bid 2983 | . . . 4 ⊢ (((Fun 𝑋 ∧ 𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑖 ∈ dom 𝑋) → ({(𝑋‘𝑖)} ≠ {𝑍} ↔ (𝑋‘𝑖) ≠ 𝑍)) |
14 | 9, 13 | bitrd 279 | . . 3 ⊢ (((Fun 𝑋 ∧ 𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑖 ∈ dom 𝑋) → ((𝑋 “ {𝑖}) ≠ {𝑍} ↔ (𝑋‘𝑖) ≠ 𝑍)) |
15 | 14 | rabbidva 3440 | . 2 ⊢ ((Fun 𝑋 ∧ 𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → {𝑖 ∈ dom 𝑋 ∣ (𝑋 “ {𝑖}) ≠ {𝑍}} = {𝑖 ∈ dom 𝑋 ∣ (𝑋‘𝑖) ≠ 𝑍}) |
16 | 2, 15 | eqtrd 2775 | 1 ⊢ ((Fun 𝑋 ∧ 𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝑋 supp 𝑍) = {𝑖 ∈ dom 𝑋 ∣ (𝑋‘𝑖) ≠ 𝑍}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 ≠ wne 2938 {crab 3433 Vcvv 3478 {csn 4631 dom cdm 5689 “ cima 5692 Fun wfun 6557 Fn wfn 6558 ‘cfv 6563 (class class class)co 7431 supp csupp 8184 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 ax-un 7754 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-sbc 3792 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-fv 6571 df-ov 7434 df-oprab 7435 df-mpo 7436 df-supp 8185 |
This theorem is referenced by: suppvalfng 8191 suppvalfn 8192 suppfnss 8213 fnsuppres 8215 mndpsuppss 18791 rmfsupp2 33228 domnmsuppn0 48214 rmsuppss 48215 scmsuppss 48216 suppdm 48356 |
Copyright terms: Public domain | W3C validator |