| 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 17239 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → ((𝑆 sSet 〈𝐴, 𝐵〉) ↾ (V ∖ {𝐴})) = (𝑆 ↾ (V ∖ {𝐴}))) | |
| 2 | 1 | adantr 485 | . . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → ((𝑆 sSet 〈𝐴, 𝐵〉) ↾ (V ∖ {𝐴})) = (𝑆 ↾ (V ∖ {𝐴}))) |
| 3 | 2 | uneq1d 4122 | . 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (((𝑆 sSet 〈𝐴, 𝐵〉) ↾ (V ∖ {𝐴})) ∪ {〈𝐴, 𝐶〉}) = ((𝑆 ↾ (V ∖ {𝐴})) ∪ {〈𝐴, 𝐶〉})) |
| 4 | ovexd 7447 | . . 3 ⊢ (𝑆 ∈ 𝑉 → (𝑆 sSet 〈𝐴, 𝐵〉) ∈ V) | |
| 5 | setsval 17228 | . . 3 ⊢ (((𝑆 sSet 〈𝐴, 𝐵〉) ∈ V ∧ 𝐶 ∈ 𝑊) → ((𝑆 sSet 〈𝐴, 𝐵〉) sSet 〈𝐴, 𝐶〉) = (((𝑆 sSet 〈𝐴, 𝐵〉) ↾ (V ∖ {𝐴})) ∪ {〈𝐴, 𝐶〉})) | |
| 6 | 4, 5 | sylan 591 | . 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → ((𝑆 sSet 〈𝐴, 𝐵〉) sSet 〈𝐴, 𝐶〉) = (((𝑆 sSet 〈𝐴, 𝐵〉) ↾ (V ∖ {𝐴})) ∪ {〈𝐴, 𝐶〉})) |
| 7 | setsval 17228 | . 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑆 sSet 〈𝐴, 𝐶〉) = ((𝑆 ↾ (V ∖ {𝐴})) ∪ {〈𝐴, 𝐶〉})) | |
| 8 | 3, 6, 7 | 3eqtr4d 2808 | 1 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → ((𝑆 sSet 〈𝐴, 𝐵〉) sSet 〈𝐴, 𝐶〉) = (𝑆 sSet 〈𝐴, 𝐶〉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∖ cdif 3903 ∪ cun 3904 {csn 4590 〈cop 4596 ↾ cres 5665 (class class class)co 7412 sSet csts 17224 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3746 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-res 5675 df-iota 6494 df-fun 6540 df-fv 6546 df-ov 7415 df-oprab 7416 df-mpo 7417 df-sets 17225 |
| This theorem is referenced by: ressress 17308 rescabs 17891 opprabs 33742 |
| Copyright terms: Public domain | W3C validator |