Theorem funresdfunsnss 5794

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.)

Assertion

Ref	Expression
funresdfunsnss	⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩}) ⊆ 𝐹)

Proof of Theorem funresdfunsnss

Step	Hyp	Ref	Expression
1		funrel 5293	. . . . 5 ⊢ (Fun 𝐹 → Rel 𝐹)
2		resdmdfsn 5007	. . . . 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 3327	. 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩}) = ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩}))
6		funfn 5306	. . 3 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
7		fnsnsplitss 5790	. . 3 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩}) ⊆ 𝐹)
8	6, 7	sylanb 284	. 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩}) ⊆ 𝐹)
9	5, 8	eqsstrd 3230	1 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩}) ⊆ 𝐹)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1373   ∈ wcel 2177  Vcvv 2773   ∖ cdif 3164   ∪ cun 3165   ⊆ wss 3167  {csn 3634  ⟨cop 3637  dom cdm 4679   ↾ cres 4681  Rel wrel 4684  Fun wfun 5270   Fn wfn 5271  ‘cfv 5276

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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2180  ax-ext 2188  ax-sep 4166  ax-pow 4222  ax-pr 4257

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-reu 2492  df-rab 2494  df-v 2775  df-sbc 3000  df-dif 3169  df-un 3171  df-in 3173  df-ss 3180  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-br 4048  df-opab 4110  df-id 4344  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-rn 4690  df-res 4691  df-ima 4692  df-iota 5237  df-fun 5278  df-fn 5279  df-f 5280  df-f1 5281  df-fo 5282  df-f1o 5283  df-fv 5284

This theorem is referenced by: (None)