![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fun2ssres | Structured version Visualization version GIF version |
Description: Equality of restrictions of a function and a subclass. (Contributed by NM, 16-Aug-1994.) |
Ref | Expression |
---|---|
fun2ssres | ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹 ∧ 𝐴 ⊆ dom 𝐺) → (𝐹 ↾ 𝐴) = (𝐺 ↾ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | resabs1 5965 | . . . 4 ⊢ (𝐴 ⊆ dom 𝐺 → ((𝐹 ↾ dom 𝐺) ↾ 𝐴) = (𝐹 ↾ 𝐴)) | |
2 | 1 | eqcomd 2742 | . . 3 ⊢ (𝐴 ⊆ dom 𝐺 → (𝐹 ↾ 𝐴) = ((𝐹 ↾ dom 𝐺) ↾ 𝐴)) |
3 | funssres 6542 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → (𝐹 ↾ dom 𝐺) = 𝐺) | |
4 | 3 | reseq1d 5934 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → ((𝐹 ↾ dom 𝐺) ↾ 𝐴) = (𝐺 ↾ 𝐴)) |
5 | 2, 4 | sylan9eqr 2798 | . 2 ⊢ (((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) ∧ 𝐴 ⊆ dom 𝐺) → (𝐹 ↾ 𝐴) = (𝐺 ↾ 𝐴)) |
6 | 5 | 3impa 1110 | 1 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹 ∧ 𝐴 ⊆ dom 𝐺) → (𝐹 ↾ 𝐴) = (𝐺 ↾ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ⊆ wss 3908 dom cdm 5631 ↾ cres 5633 Fun wfun 6487 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-12 2171 ax-ext 2707 ax-sep 5254 ax-nul 5261 ax-pr 5382 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-ral 3063 df-rex 3072 df-rab 3406 df-v 3445 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4281 df-if 4485 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5166 df-id 5529 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-res 5643 df-fun 6495 |
This theorem is referenced by: frrlem10 8222 frrlem12 8224 fprresex 8237 wfrlem12OLD 8262 wfrlem14OLD 8264 wfrlem17OLD 8267 tfrlem9 8327 tfrlem9a 8328 tfrlem11 8330 bnj1503 33330 |
Copyright terms: Public domain | W3C validator |