| 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 17259 | . . . 4 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑌 ∈ 𝑈) → (𝐹 sSet 〈𝑋, 𝑌〉) = ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉})) | |
| 2 | 1 | 3adant2 1149 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → (𝐹 sSet 〈𝑋, 𝑌〉) = ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉})) |
| 3 | 2 | fveq1d 6880 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → ((𝐹 sSet 〈𝑋, 𝑌〉)‘𝑋) = (((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉})‘𝑋)) |
| 4 | simp2 1155 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → 𝑋 ∈ 𝑊) | |
| 5 | simp3 1156 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → 𝑌 ∈ 𝑈) | |
| 6 | neldifsn 4755 | . . . . 5 ⊢ ¬ 𝑋 ∈ (V ∖ {𝑋}) | |
| 7 | dmres 6005 | . . . . . . 7 ⊢ dom (𝐹 ↾ (V ∖ {𝑋})) = ((V ∖ {𝑋}) ∩ dom 𝐹) | |
| 8 | inss1 4182 | . . . . . . 7 ⊢ ((V ∖ {𝑋}) ∩ dom 𝐹) ⊆ (V ∖ {𝑋}) | |
| 9 | 7, 8 | eqsstri 3977 | . . . . . 6 ⊢ dom (𝐹 ↾ (V ∖ {𝑋})) ⊆ (V ∖ {𝑋}) |
| 10 | 9 | sseli 3927 | . . . . 5 ⊢ (𝑋 ∈ dom (𝐹 ↾ (V ∖ {𝑋})) → 𝑋 ∈ (V ∖ {𝑋})) |
| 11 | 6, 10 | mto 200 | . . . 4 ⊢ ¬ 𝑋 ∈ dom (𝐹 ↾ (V ∖ {𝑋})) |
| 12 | 11 | a1i 11 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → ¬ 𝑋 ∈ dom (𝐹 ↾ (V ∖ {𝑋}))) |
| 13 | fsnunfv 7185 | . . 3 ⊢ ((𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈 ∧ ¬ 𝑋 ∈ dom (𝐹 ↾ (V ∖ {𝑋}))) → (((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉})‘𝑋) = 𝑌) | |
| 14 | 4, 5, 12, 13 | syl3anc 1398 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → (((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉})‘𝑋) = 𝑌) |
| 15 | 3, 14 | eqtrd 2795 | 1 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝑊 ∧ 𝑌 ∈ 𝑈) → ((𝐹 sSet 〈𝑋, 𝑌〉)‘𝑋) = 𝑌) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 Vcvv 3450 ∖ cdif 3896 ∪ cun 3897 ∩ cin 3898 {csn 4584 〈cop 4590 dom cdm 5655 ↾ cres 5657 ‘cfv 6533 (class class class)co 7413 sSet csts 17255 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-pr 5398 ax-un 7736 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-res 5667 df-iota 6489 df-fun 6535 df-fn 6536 df-fv 6541 df-ov 7416 df-oprab 7417 df-mpo 7418 df-sets 17256 |
| This theorem is used by: mdetunilem9 22842 |
| Copyright terms: Public domain | W3C validator |