![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fvsetsid | Structured version Visualization version GIF version |
Description: The value of the structure replacement function for its first argument is its second argument. (Contributed by SO, 12-Jul-2018.) |
Ref | Expression |
---|---|
fvsetsid | ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → ((𝐹 sSet 〈𝑋, 𝑌〉)‘𝑋) = 𝑌) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | setsval 16505 | . . . 4 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑌 ∈ 𝑈) → (𝐹 sSet 〈𝑋, 𝑌〉) = ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉})) | |
2 | 1 | 3adant2 1128 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → (𝐹 sSet 〈𝑋, 𝑌〉) = ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉})) |
3 | 2 | fveq1d 6647 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → ((𝐹 sSet 〈𝑋, 𝑌〉)‘𝑋) = (((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉})‘𝑋)) |
4 | simp2 1134 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → 𝑋 ∈ 𝑊) | |
5 | simp3 1135 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → 𝑌 ∈ 𝑈) | |
6 | neldifsn 4685 | . . . . 5 ⊢ ¬ 𝑋 ∈ (V ∖ {𝑋}) | |
7 | dmres 5840 | . . . . . . 7 ⊢ dom (𝐹 ↾ (V ∖ {𝑋})) = ((V ∖ {𝑋}) ∩ dom 𝐹) | |
8 | inss1 4155 | . . . . . . 7 ⊢ ((V ∖ {𝑋}) ∩ dom 𝐹) ⊆ (V ∖ {𝑋}) | |
9 | 7, 8 | eqsstri 3949 | . . . . . 6 ⊢ dom (𝐹 ↾ (V ∖ {𝑋})) ⊆ (V ∖ {𝑋}) |
10 | 9 | sseli 3911 | . . . . 5 ⊢ (𝑋 ∈ dom (𝐹 ↾ (V ∖ {𝑋})) → 𝑋 ∈ (V ∖ {𝑋})) |
11 | 6, 10 | mto 200 | . . . 4 ⊢ ¬ 𝑋 ∈ dom (𝐹 ↾ (V ∖ {𝑋})) |
12 | 11 | a1i 11 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → ¬ 𝑋 ∈ dom (𝐹 ↾ (V ∖ {𝑋}))) |
13 | fsnunfv 6926 | . . 3 ⊢ ((𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈 ∧ ¬ 𝑋 ∈ dom (𝐹 ↾ (V ∖ {𝑋}))) → (((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉})‘𝑋) = 𝑌) | |
14 | 4, 5, 12, 13 | syl3anc 1368 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → (((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉})‘𝑋) = 𝑌) |
15 | 3, 14 | eqtrd 2833 | 1 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → ((𝐹 sSet 〈𝑋, 𝑌〉)‘𝑋) = 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 Vcvv 3441 ∖ cdif 3878 ∪ cun 3879 ∩ cin 3880 {csn 4525 〈cop 4531 dom cdm 5519 ↾ cres 5521 ‘cfv 6324 (class class class)co 7135 sSet csts 16473 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-res 5531 df-iota 6283 df-fun 6326 df-fn 6327 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-sets 16482 |
This theorem is referenced by: mdetunilem9 21225 |
Copyright terms: Public domain | W3C validator |