MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fssrescdmd Structured version   Visualization version   GIF version

Theorem fssrescdmd 7151
Description: Restriction of a function to a subclass of its domain as a function with domain and codomain. (Contributed by AV, 13-May-2025.)
Hypotheses
Ref Expression
fssrescdmd.f (𝜑 → 𝐹:𝐴⟶𝐵)
fssrescdmd.c (𝜑 → 𝐶 ⊆ 𝐴)
fssrescdmd.d (𝜑 → (𝐹 “ 𝐶) ⊆ 𝐷)
Assertion
Ref Expression
fssrescdmd (𝜑 → (𝐹 ↾ 𝐶):𝐶⟶𝐷)

Proof of Theorem fssrescdmd
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 fssrescdmd.f . . . 4 (𝜑 → 𝐹:𝐴⟶𝐵)
21ffnd 6732 . . 3 (𝜑 → 𝐹 Fn 𝐴)
3 fssrescdmd.c . . 3 (𝜑 → 𝐶 ⊆ 𝐴)
42, 3fnssresd 6685 . 2 (𝜑 → (𝐹 ↾ 𝐶) Fn 𝐶)
5 resima 6068 . . . 4 ((𝐹 ↾ 𝐶) “ 𝐶) = (𝐹 “ 𝐶)
6 fssrescdmd.d . . . 4 (𝜑 → (𝐹 “ 𝐶) ⊆ 𝐷)
75, 6eqsstrid 3951 . . 3 (𝜑 → ((𝐹 ↾ 𝐶) “ 𝐶) ⊆ 𝐷)
81ffund 6736 . . . . 5 (𝜑 → Fun 𝐹)
98funresd 6603 . . . 4 (𝜑 → Fun (𝐹 ↾ 𝐶))
101fdmd 6742 . . . . . . 7 (𝜑 → dom 𝐹 = 𝐴)
113, 10sseqtrrd 3950 . . . . . 6 (𝜑 → 𝐶 ⊆ dom 𝐹)
12 ssdmres 6016 . . . . . . . 8 (𝐶 ⊆ dom 𝐹 ↔ dom (𝐹 ↾ 𝐶) = 𝐶)
1312a1i 11 . . . . . . 7 (𝜑 → (𝐶 ⊆ dom 𝐹 ↔ dom (𝐹 ↾ 𝐶) = 𝐶))
14 eqcom 2770 . . . . . . 7 (dom (𝐹 ↾ 𝐶) = 𝐶 ↔ 𝐶 = dom (𝐹 ↾ 𝐶))
1513, 14bitrdi 290 . . . . . 6 (𝜑 → (𝐶 ⊆ dom 𝐹 ↔ 𝐶 = dom (𝐹 ↾ 𝐶)))
1611, 15mpbid 235 . . . . 5 (𝜑 → 𝐶 = dom (𝐹 ↾ 𝐶))
1716eqimssd 3969 . . . 4 (𝜑 → 𝐶 ⊆ dom (𝐹 ↾ 𝐶))
18 funimass4 6972 . . . 4 ((Fun (𝐹 ↾ 𝐶) ∧ 𝐶 ⊆ dom (𝐹 ↾ 𝐶)) → (((𝐹 ↾ 𝐶) “ 𝐶) ⊆ 𝐷 ↔ ∀𝑥 ∈ 𝐶 ((𝐹 ↾ 𝐶)‘𝑥) ∈ 𝐷))
199, 17, 18syl2anc 596 . . 3 (𝜑 → (((𝐹 ↾ 𝐶) “ 𝐶) ⊆ 𝐷 ↔ ∀𝑥 ∈ 𝐶 ((𝐹 ↾ 𝐶)‘𝑥) ∈ 𝐷))
207, 19mpbid 235 . 2 (𝜑 → ∀𝑥 ∈ 𝐶 ((𝐹 ↾ 𝐶)‘𝑥) ∈ 𝐷)
21 ffnfv 7143 . 2 ((𝐹 ↾ 𝐶):𝐶⟶𝐷 ↔ ((𝐹 ↾ 𝐶) Fn 𝐶 ∧ ∀𝑥 ∈ 𝐶 ((𝐹 ↾ 𝐶)‘𝑥) ∈ 𝐷))
224, 20, 21sylanbrc 595 1 (𝜑 → (𝐹 ↾ 𝐶):𝐶⟶𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900  dom cdm 5655   ↾ cres 5657   “ cima 5658  Fun wfun 6552   Fn wfn 6553  ⟶wf 6554  ‘cfv 6558
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-fv 6566
This theorem is used by:  isubgruhgr  49171
  Copyright terms: Public domain W3C validator