| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > funresdfunsnss | GIF version | ||
| Description: Restricting a function to a domain without one element of the domain of the function, and adding a pair of this element and the function value of the element results in a subset of the function itself. (Contributed by AV, 2-Dec-2018.) (Revised by Jim Kingdon, 21-Jan-2023.) |
| Ref | Expression |
|---|---|
| funresdfunsnss | ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉}) ⊆ 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | funrel 5345 | . . . . 5 ⊢ (Fun 𝐹 → Rel 𝐹) | |
| 2 | resdmdfsn 5058 | . . . . 5 ⊢ (Rel 𝐹 → (𝐹 ↾ (V ∖ {𝑋})) = (𝐹 ↾ (dom 𝐹 ∖ {𝑋}))) | |
| 3 | 1, 2 | syl 14 | . . . 4 ⊢ (Fun 𝐹 → (𝐹 ↾ (V ∖ {𝑋})) = (𝐹 ↾ (dom 𝐹 ∖ {𝑋}))) |
| 4 | 3 | adantr 276 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → (𝐹 ↾ (V ∖ {𝑋})) = (𝐹 ↾ (dom 𝐹 ∖ {𝑋}))) |
| 5 | 4 | uneq1d 3359 | . 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉}) = ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉})) |
| 6 | funfn 5358 | . . 3 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹) | |
| 7 | fnsnsplitss 5856 | . . 3 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉}) ⊆ 𝐹) | |
| 8 | 6, 7 | sylanb 284 | . 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉}) ⊆ 𝐹) |
| 9 | 5, 8 | eqsstrd 3262 | 1 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉}) ⊆ 𝐹) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2201 Vcvv 2801 ∖ cdif 3196 ∪ cun 3197 ⊆ wss 3199 {csn 3670 〈cop 3673 dom cdm 4727 ↾ cres 4729 Rel wrel 4732 Fun wfun 5322 Fn wfn 5323 ‘cfv 5328 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2204 ax-ext 2212 ax-sep 4208 ax-pow 4266 ax-pr 4301 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ral 2514 df-rex 2515 df-reu 2516 df-rab 2518 df-v 2803 df-sbc 3031 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-br 4090 df-opab 4152 df-id 4392 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-f1 5333 df-fo 5334 df-f1o 5335 df-fv 5336 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |