| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > setsvalg | Structured version Visualization version GIF version | ||
| Description: Value of the structure replacement function. (Contributed by Mario Carneiro, 30-Apr-2015.) |
| Ref | Expression |
|---|---|
| setsvalg | ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑆 sSet 𝐴) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elex 3484 | . 2 ⊢ (𝑆 ∈ 𝑉 → 𝑆 ∈ V) | |
| 2 | elex 3484 | . 2 ⊢ (𝐴 ∈ 𝑊 → 𝐴 ∈ V) | |
| 3 | resexg 6024 | . . . . 5 ⊢ (𝑆 ∈ V → (𝑆 ↾ (V ∖ dom {𝐴})) ∈ V) | |
| 4 | 3 | adantr 485 | . . . 4 ⊢ ((𝑆 ∈ V ∧ 𝐴 ∈ V) → (𝑆 ↾ (V ∖ dom {𝐴})) ∈ V) |
| 5 | snex 5408 | . . . 4 ⊢ {𝐴} ∈ V | |
| 6 | unexg 7738 | . . . 4 ⊢ (((𝑆 ↾ (V ∖ dom {𝐴})) ∈ V ∧ {𝐴} ∈ V) → ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}) ∈ V) | |
| 7 | 4, 5, 6 | sylancl 597 | . . 3 ⊢ ((𝑆 ∈ V ∧ 𝐴 ∈ V) → ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}) ∈ V) |
| 8 | simpl 487 | . . . . . 6 ⊢ ((𝑠 = 𝑆 ∧ 𝑒 = 𝐴) → 𝑠 = 𝑆) | |
| 9 | simpr 489 | . . . . . . . . 9 ⊢ ((𝑠 = 𝑆 ∧ 𝑒 = 𝐴) → 𝑒 = 𝐴) | |
| 10 | 9 | sneqd 4603 | . . . . . . . 8 ⊢ ((𝑠 = 𝑆 ∧ 𝑒 = 𝐴) → {𝑒} = {𝐴}) |
| 11 | 10 | dmeqd 5893 | . . . . . . 7 ⊢ ((𝑠 = 𝑆 ∧ 𝑒 = 𝐴) → dom {𝑒} = dom {𝐴}) |
| 12 | 11 | difeq2d 4089 | . . . . . 6 ⊢ ((𝑠 = 𝑆 ∧ 𝑒 = 𝐴) → (V ∖ dom {𝑒}) = (V ∖ dom {𝐴})) |
| 13 | 8, 12 | reseq12d 5977 | . . . . 5 ⊢ ((𝑠 = 𝑆 ∧ 𝑒 = 𝐴) → (𝑠 ↾ (V ∖ dom {𝑒})) = (𝑆 ↾ (V ∖ dom {𝐴}))) |
| 14 | 13, 10 | uneq12d 4131 | . . . 4 ⊢ ((𝑠 = 𝑆 ∧ 𝑒 = 𝐴) → ((𝑠 ↾ (V ∖ dom {𝑒})) ∪ {𝑒}) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴})) |
| 15 | df-sets 17220 | . . . 4 ⊢ sSet = (𝑠 ∈ V, 𝑒 ∈ V ↦ ((𝑠 ↾ (V ∖ dom {𝑒})) ∪ {𝑒})) | |
| 16 | 14, 15 | ovmpoga 7562 | . . 3 ⊢ ((𝑆 ∈ V ∧ 𝐴 ∈ V ∧ ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}) ∈ V) → (𝑆 sSet 𝐴) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴})) |
| 17 | 7, 16 | mpd3an3 1488 | . 2 ⊢ ((𝑆 ∈ V ∧ 𝐴 ∈ V) → (𝑆 sSet 𝐴) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴})) |
| 18 | 1, 2, 17 | syl2an 607 | 1 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑆 sSet 𝐴) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴})) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 Vcvv 3463 ∖ cdif 3910 ∪ cun 3911 {csn 4591 dom cdm 5659 ↾ cres 5661 (class class class)co 7408 sSet csts 17219 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-pr 5402 ax-un 7730 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-br 5111 df-opab 5175 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-res 5671 df-iota 6489 df-fun 6535 df-fv 6541 df-ov 7411 df-oprab 7412 df-mpo 7413 df-sets 17220 |
| This theorem is referenced by: setsval 17223 setsdm 17226 setsfun 17227 setsfun0 17228 wunsets 17233 setsres 17234 |
| Copyright terms: Public domain | W3C validator |