| 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 3500 | . 2 ⊢ (𝑆 ∈ 𝑉 → 𝑆 ∈ V) | |
| 2 | elex 3500 | . 2 ⊢ (𝐴 ∈ 𝑊 → 𝐴 ∈ V) | |
| 3 | resexg 6044 | . . . . 5 ⊢ (𝑆 ∈ V → (𝑆 ↾ (V ∖ dom {𝐴})) ∈ V) | |
| 4 | 3 | adantr 480 | . . . 4 ⊢ ((𝑆 ∈ V ∧ 𝐴 ∈ V) → (𝑆 ↾ (V ∖ dom {𝐴})) ∈ V) |
| 5 | snex 5435 | . . . 4 ⊢ {𝐴} ∈ V | |
| 6 | unexg 7764 | . . . 4 ⊢ (((𝑆 ↾ (V ∖ dom {𝐴})) ∈ V ∧ {𝐴} ∈ V) → ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}) ∈ V) | |
| 7 | 4, 5, 6 | sylancl 586 | . . 3 ⊢ ((𝑆 ∈ V ∧ 𝐴 ∈ V) → ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}) ∈ V) |
| 8 | simpl 482 | . . . . . 6 ⊢ ((𝑠 = 𝑆 ∧ 𝑒 = 𝐴) → 𝑠 = 𝑆) | |
| 9 | simpr 484 | . . . . . . . . 9 ⊢ ((𝑠 = 𝑆 ∧ 𝑒 = 𝐴) → 𝑒 = 𝐴) | |
| 10 | 9 | sneqd 4637 | . . . . . . . 8 ⊢ ((𝑠 = 𝑆 ∧ 𝑒 = 𝐴) → {𝑒} = {𝐴}) |
| 11 | 10 | dmeqd 5915 | . . . . . . 7 ⊢ ((𝑠 = 𝑆 ∧ 𝑒 = 𝐴) → dom {𝑒} = dom {𝐴}) |
| 12 | 11 | difeq2d 4125 | . . . . . 6 ⊢ ((𝑠 = 𝑆 ∧ 𝑒 = 𝐴) → (V ∖ dom {𝑒}) = (V ∖ dom {𝐴})) |
| 13 | 8, 12 | reseq12d 5997 | . . . . 5 ⊢ ((𝑠 = 𝑆 ∧ 𝑒 = 𝐴) → (𝑠 ↾ (V ∖ dom {𝑒})) = (𝑆 ↾ (V ∖ dom {𝐴}))) |
| 14 | 13, 10 | uneq12d 4168 | . . . 4 ⊢ ((𝑠 = 𝑆 ∧ 𝑒 = 𝐴) → ((𝑠 ↾ (V ∖ dom {𝑒})) ∪ {𝑒}) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴})) |
| 15 | df-sets 17202 | . . . 4 ⊢ sSet = (𝑠 ∈ V, 𝑒 ∈ V ↦ ((𝑠 ↾ (V ∖ dom {𝑒})) ∪ {𝑒})) | |
| 16 | 14, 15 | ovmpoga 7588 | . . 3 ⊢ ((𝑆 ∈ V ∧ 𝐴 ∈ V ∧ ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴}) ∈ V) → (𝑆 sSet 𝐴) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴})) |
| 17 | 7, 16 | mpd3an3 1463 | . 2 ⊢ ((𝑆 ∈ V ∧ 𝐴 ∈ V) → (𝑆 sSet 𝐴) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴})) |
| 18 | 1, 2, 17 | syl2an 596 | 1 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑆 sSet 𝐴) = ((𝑆 ↾ (V ∖ dom {𝐴})) ∪ {𝐴})) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2107 Vcvv 3479 ∖ cdif 3947 ∪ cun 3948 {csn 4625 dom cdm 5684 ↾ cres 5686 (class class class)co 7432 sSet csts 17201 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-sep 5295 ax-nul 5305 ax-pr 5431 ax-un 7756 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ral 3061 df-rex 3070 df-rab 3436 df-v 3481 df-sbc 3788 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-nul 4333 df-if 4525 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-br 5143 df-opab 5205 df-id 5577 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-res 5696 df-iota 6513 df-fun 6562 df-fv 6568 df-ov 7435 df-oprab 7436 df-mpo 7437 df-sets 17202 |
| This theorem is referenced by: setsval 17205 setsdm 17208 setsfun 17209 setsfun0 17210 wunsets 17215 setsres 17216 |
| Copyright terms: Public domain | W3C validator |