Theorem funssres 5321

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 2776	. . . . 5 ⊢ 𝑦 ∈ V
2	1	opelres 4972	. . . 4 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ dom 𝐺) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑥 ∈ dom 𝐺))
3		ssel 3191	. . . . . . 7 ⊢ (𝐺 ⊆ 𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐺 → ⟨𝑥, 𝑦⟩ ∈ 𝐹))
4		vex 2776	. . . . . . . . 9 ⊢ 𝑥 ∈ V
5	4, 1	opeldm 4889	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐺 → 𝑥 ∈ dom 𝐺)
6	5	a1i 9	. . . . . . 7 ⊢ (𝐺 ⊆ 𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐺 → 𝑥 ∈ dom 𝐺))
7	3, 6	jcad 307	. . . . . 6 ⊢ (𝐺 ⊆ 𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐺 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑥 ∈ dom 𝐺)))
8	7	adantl 277	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → (⟨𝑥, 𝑦⟩ ∈ 𝐺 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑥 ∈ dom 𝐺)))
9		funeu2 5305	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → ∃!𝑦⟨𝑥, 𝑦⟩ ∈ 𝐹)
10	4	eldm2 4884	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ dom 𝐺 ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐺)
11	3	ancrd 326	. . . . . . . . . . . . . . 15 ⊢ (𝐺 ⊆ 𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐺 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐺)))
12	11	eximdv 1904	. . . . . . . . . . . . . 14 ⊢ (𝐺 ⊆ 𝐹 → (∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐺 → ∃𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐺)))
13	10, 12	biimtrid 152	. . . . . . . . . . . . 13 ⊢ (𝐺 ⊆ 𝐹 → (𝑥 ∈ dom 𝐺 → ∃𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐺)))
14	13	imp 124	. . . . . . . . . . . 12 ⊢ ((𝐺 ⊆ 𝐹 ∧ 𝑥 ∈ dom 𝐺) → ∃𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐺))
15		eupick 2134	. . . . . . . . . . . 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 1899	. 2 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ dom 𝐺) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐺))
26		relres 4995	. . 3 ⊢ Rel (𝐹 ↾ dom 𝐺)
27		funrel 5296	. . . 4 ⊢ (Fun 𝐹 → Rel 𝐹)
28		relss 4769	. . . 4 ⊢ (𝐺 ⊆ 𝐹 → (Rel 𝐹 → Rel 𝐺))
29	27, 28	mpan9 281	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐺 ⊆ 𝐹) → Rel 𝐺)
30		eqrel 4771	. . 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 1371   = wceq 1373  ∃wex 1516  ∃!weu 2055   ∈ wcel 2177   ⊆ wss 3170  ⟨cop 3640  dom cdm 4682   ↾ cres 4684  Rel wrel 4687  Fun wfun 5273

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 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 4169  ax-pow 4225  ax-pr 4260

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-v 2775  df-un 3174  df-in 3176  df-ss 3183  df-pw 3622  df-sn 3643  df-pr 3644  df-op 3646  df-br 4051  df-opab 4113  df-id 4347  df-xp 4688  df-rel 4689  df-cnv 4690  df-co 4691  df-dm 4692  df-res 4694  df-fun 5281

This theorem is referenced by:  fun2ssres  5322  funcnvres  5355  funssfv  5614  oprssov  6100