| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > setsabs | Structured version Visualization version GIF version | ||
| Description: Replacing the same components twice yields the same as the second setting only. (Contributed by Mario Carneiro, 2-Dec-2014.) |
| Ref | Expression |
|---|---|
| setsabs | ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → ((𝑆 sSet 〈𝐴, 𝐵〉) sSet 〈𝐴, 𝐶〉) = (𝑆 sSet 〈𝐴, 𝐶〉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | setsres 17197 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → ((𝑆 sSet 〈𝐴, 𝐵〉) ↾ (V ∖ {𝐴})) = (𝑆 ↾ (V ∖ {𝐴}))) | |
| 2 | 1 | adantr 480 | . . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → ((𝑆 sSet 〈𝐴, 𝐵〉) ↾ (V ∖ {𝐴})) = (𝑆 ↾ (V ∖ {𝐴}))) |
| 3 | 2 | uneq1d 4147 | . 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (((𝑆 sSet 〈𝐴, 𝐵〉) ↾ (V ∖ {𝐴})) ∪ {〈𝐴, 𝐶〉}) = ((𝑆 ↾ (V ∖ {𝐴})) ∪ {〈𝐴, 𝐶〉})) |
| 4 | ovexd 7448 | . . 3 ⊢ (𝑆 ∈ 𝑉 → (𝑆 sSet 〈𝐴, 𝐵〉) ∈ V) | |
| 5 | setsval 17186 | . . 3 ⊢ (((𝑆 sSet 〈𝐴, 𝐵〉) ∈ V ∧ 𝐶 ∈ 𝑊) → ((𝑆 sSet 〈𝐴, 𝐵〉) sSet 〈𝐴, 𝐶〉) = (((𝑆 sSet 〈𝐴, 𝐵〉) ↾ (V ∖ {𝐴})) ∪ {〈𝐴, 𝐶〉})) | |
| 6 | 4, 5 | sylan 580 | . 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → ((𝑆 sSet 〈𝐴, 𝐵〉) sSet 〈𝐴, 𝐶〉) = (((𝑆 sSet 〈𝐴, 𝐵〉) ↾ (V ∖ {𝐴})) ∪ {〈𝐴, 𝐶〉})) |
| 7 | setsval 17186 | . 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑆 sSet 〈𝐴, 𝐶〉) = ((𝑆 ↾ (V ∖ {𝐴})) ∪ {〈𝐴, 𝐶〉})) | |
| 8 | 3, 6, 7 | 3eqtr4d 2779 | 1 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → ((𝑆 sSet 〈𝐴, 𝐵〉) sSet 〈𝐴, 𝐶〉) = (𝑆 sSet 〈𝐴, 𝐶〉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2107 Vcvv 3463 ∖ cdif 3928 ∪ cun 3929 {csn 4606 〈cop 4612 ↾ cres 5667 (class class class)co 7413 sSet csts 17182 |
| 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 2706 ax-sep 5276 ax-nul 5286 ax-pr 5412 ax-un 7737 |
| 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 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-ral 3051 df-rex 3060 df-rab 3420 df-v 3465 df-sbc 3771 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4888 df-br 5124 df-opab 5186 df-id 5558 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-res 5677 df-iota 6494 df-fun 6543 df-fv 6549 df-ov 7416 df-oprab 7417 df-mpo 7418 df-sets 17183 |
| This theorem is referenced by: ressress 17270 rescabs 17848 rescabsOLD 17849 opprabs 33445 |
| Copyright terms: Public domain | W3C validator |