Theorem funssres 5259

Description: The restriction of a function to the domain of a subclass equals the subclass. (Contributed by NM, 15-Aug-1994.)

Assertion

Ref	Expression
funssres	⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → (𝐹 ↾ dom 𝐺) = 𝐺)

Proof of Theorem funssres

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 2741	. . . . 5 ⊢ 𝑦 ∈ V
2	1	opelres 4913	. . . 4 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ dom 𝐺) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑥 ∈ dom 𝐺))
3		ssel 3150	. . . . . . 7 ⊢ (𝐺 ⊆ 𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐺 → ⟨𝑥, 𝑦⟩ ∈ 𝐹))
4		vex 2741	. . . . . . . . 9 ⊢ 𝑥 ∈ V
5	4, 1	opeldm 4831	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐺 → 𝑥 ∈ dom 𝐺)
6	5	a1i 9	. . . . . . 7 ⊢ (𝐺 ⊆ 𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐺 → 𝑥 ∈ dom 𝐺))
7	3, 6	jcad 307	. . . . . 6 ⊢ (𝐺 ⊆ 𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐺 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑥 ∈ dom 𝐺)))
8	7	adantl 277	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → (⟨𝑥, 𝑦⟩ ∈ 𝐺 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑥 ∈ dom 𝐺)))
9		funeu2 5243	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → ∃!𝑦⟨𝑥, 𝑦⟩ ∈ 𝐹)
10	4	eldm2 4826	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ dom 𝐺 ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐺)
11	3	ancrd 326	. . . . . . . . . . . . . . 15 ⊢ (𝐺 ⊆ 𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐺 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐺)))
12	11	eximdv 1880	. . . . . . . . . . . . . 14 ⊢ (𝐺 ⊆ 𝐹 → (∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐺 → ∃𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐺)))
13	10, 12	biimtrid 152	. . . . . . . . . . . . 13 ⊢ (𝐺 ⊆ 𝐹 → (𝑥 ∈ dom 𝐺 → ∃𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐺)))
14	13	imp 124	. . . . . . . . . . . 12 ⊢ ((𝐺 ⊆ 𝐹 ∧ 𝑥 ∈ dom 𝐺) → ∃𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐺))
15		eupick 2105	. . . . . . . . . . . 12 ⊢ ((∃!𝑦⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ∃𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐺)) → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ 𝐺))
16	9, 14, 15	syl2an 289	. . . . . . . . . . 11 ⊢ (((Fun 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) ∧ (𝐺 ⊆ 𝐹 ∧ 𝑥 ∈ dom 𝐺)) → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ 𝐺))
17	16	exp43 372	. . . . . . . . . 10 ⊢ (Fun 𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝐺 ⊆ 𝐹 → (𝑥 ∈ dom 𝐺 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ 𝐺)))))
18	17	com23 78	. . . . . . . . 9 ⊢ (Fun 𝐹 → (𝐺 ⊆ 𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ dom 𝐺 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ 𝐺)))))
19	18	imp 124	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ dom 𝐺 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ 𝐺))))
20	19	com34 83	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ dom 𝐺 → ⟨𝑥, 𝑦⟩ ∈ 𝐺))))
21	20	pm2.43d 50	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ dom 𝐺 → ⟨𝑥, 𝑦⟩ ∈ 𝐺)))
22	21	impd 254	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → ((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑥 ∈ dom 𝐺) → ⟨𝑥, 𝑦⟩ ∈ 𝐺))
23	8, 22	impbid 129	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → (⟨𝑥, 𝑦⟩ ∈ 𝐺 ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑥 ∈ dom 𝐺)))
24	2, 23	bitr4id 199	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ dom 𝐺) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐺))
25	24	alrimivv 1875	. 2 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ dom 𝐺) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐺))
26		relres 4936	. . 3 ⊢ Rel (𝐹 ↾ dom 𝐺)
27		funrel 5234	. . . 4 ⊢ (Fun 𝐹 → Rel 𝐹)
28		relss 4714	. . . 4 ⊢ (𝐺 ⊆ 𝐹 → (Rel 𝐹 → Rel 𝐺))
29	27, 28	mpan9 281	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → Rel 𝐺)
30		eqrel 4716	. . 3 ⊢ ((Rel (𝐹 ↾ dom 𝐺) ∧ Rel 𝐺) → ((𝐹 ↾ dom 𝐺) = 𝐺 ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ dom 𝐺) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐺)))
31	26, 29, 30	sylancr 414	. 2 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → ((𝐹 ↾ dom 𝐺) = 𝐺 ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ dom 𝐺) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐺)))
32	25, 31	mpbird 167	1 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → (𝐹 ↾ dom 𝐺) = 𝐺)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1351   = wceq 1353  ∃wex 1492  ∃!weu 2026   ∈ wcel 2148   ⊆ wss 3130  ⟨cop 3596  dom cdm 4627   ↾ cres 4629  Rel wrel 4632  Fun wfun 5211

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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4122  ax-pow 4175  ax-pr 4210

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2740  df-un 3134  df-in 3136  df-ss 3143  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-br 4005  df-opab 4066  df-id 4294  df-xp 4633  df-rel 4634  df-cnv 4635  df-co 4636  df-dm 4637  df-res 4639  df-fun 5219

This theorem is referenced by:  fun2ssres  5260  funcnvres  5290  funssfv  5542  oprssov  6016