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 16796 | . . . 4 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑌 ∈ 𝑈) → (𝐹 sSet 〈𝑋, 𝑌〉) = ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉})) | |
2 | 1 | 3adant2 1129 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → (𝐹 sSet 〈𝑋, 𝑌〉) = ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉})) |
3 | 2 | fveq1d 6758 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → ((𝐹 sSet 〈𝑋, 𝑌〉)‘𝑋) = (((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉})‘𝑋)) |
4 | simp2 1135 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → 𝑋 ∈ 𝑊) | |
5 | simp3 1136 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → 𝑌 ∈ 𝑈) | |
6 | neldifsn 4722 | . . . . 5 ⊢ ¬ 𝑋 ∈ (V ∖ {𝑋}) | |
7 | dmres 5902 | . . . . . . 7 ⊢ dom (𝐹 ↾ (V ∖ {𝑋})) = ((V ∖ {𝑋}) ∩ dom 𝐹) | |
8 | inss1 4159 | . . . . . . 7 ⊢ ((V ∖ {𝑋}) ∩ dom 𝐹) ⊆ (V ∖ {𝑋}) | |
9 | 7, 8 | eqsstri 3951 | . . . . . 6 ⊢ dom (𝐹 ↾ (V ∖ {𝑋})) ⊆ (V ∖ {𝑋}) |
10 | 9 | sseli 3913 | . . . . 5 ⊢ (𝑋 ∈ dom (𝐹 ↾ (V ∖ {𝑋})) → 𝑋 ∈ (V ∖ {𝑋})) |
11 | 6, 10 | mto 196 | . . . 4 ⊢ ¬ 𝑋 ∈ dom (𝐹 ↾ (V ∖ {𝑋})) |
12 | 11 | a1i 11 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → ¬ 𝑋 ∈ dom (𝐹 ↾ (V ∖ {𝑋}))) |
13 | fsnunfv 7041 | . . 3 ⊢ ((𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈 ∧ ¬ 𝑋 ∈ dom (𝐹 ↾ (V ∖ {𝑋}))) → (((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉})‘𝑋) = 𝑌) | |
14 | 4, 5, 12, 13 | syl3anc 1369 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → (((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉})‘𝑋) = 𝑌) |
15 | 3, 14 | eqtrd 2778 | 1 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → ((𝐹 sSet 〈𝑋, 𝑌〉)‘𝑋) = 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 Vcvv 3422 ∖ cdif 3880 ∪ cun 3881 ∩ cin 3882 {csn 4558 〈cop 4564 dom cdm 5580 ↾ cres 5582 ‘cfv 6418 (class class class)co 7255 sSet csts 16792 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-sbc 3712 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-res 5592 df-iota 6376 df-fun 6420 df-fn 6421 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-sets 16793 |
This theorem is referenced by: mdetunilem9 21677 |
Copyright terms: Public domain | W3C validator |