Theorem iss 5059

Description: A subclass of the identity function is the identity function restricted to its domain. (Contributed by NM, 13-Dec-2003.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Assertion

Ref	Expression
iss	⊢ (𝐴 ⊆ I ↔ 𝐴 = ( I ↾ dom 𝐴))

Proof of Theorem iss

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

Step	Hyp	Ref	Expression
1		ssel 3221	. . . . . . 7 ⊢ (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ I ))
2		vex 2805	. . . . . . . . 9 ⊢ 𝑥 ∈ V
3		vex 2805	. . . . . . . . 9 ⊢ 𝑦 ∈ V
4	2, 3	opeldm 4934	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐴 → 𝑥 ∈ dom 𝐴)
5	4	a1i 9	. . . . . . 7 ⊢ (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ 𝐴 → 𝑥 ∈ dom 𝐴))
6	1, 5	jcad 307	. . . . . 6 ⊢ (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ 𝐴 → (⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑥 ∈ dom 𝐴)))
7		df-br 4089	. . . . . . . . 9 ⊢ (𝑥 I 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
8	3	ideq 4882	. . . . . . . . 9 ⊢ (𝑥 I 𝑦 ↔ 𝑥 = 𝑦)
9	7, 8	bitr3i 186	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ I ↔ 𝑥 = 𝑦)
10	2	eldm2 4929	. . . . . . . . . 10 ⊢ (𝑥 ∈ dom 𝐴 ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴)
11		opeq2 3863	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑦 → ⟨𝑥, 𝑥⟩ = ⟨𝑥, 𝑦⟩)
12	11	eleq1d 2300	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑦 → (⟨𝑥, 𝑥⟩ ∈ 𝐴 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐴))
13	12	biimprcd 160	. . . . . . . . . . . . 13 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐴 → (𝑥 = 𝑦 → ⟨𝑥, 𝑥⟩ ∈ 𝐴))
14	9, 13	biimtrid 152	. . . . . . . . . . . 12 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐴 → (⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑥⟩ ∈ 𝐴))
15	1, 14	sylcom 28	. . . . . . . . . . 11 ⊢ (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑥⟩ ∈ 𝐴))
16	15	exlimdv 1867	. . . . . . . . . 10 ⊢ (𝐴 ⊆ I → (∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑥⟩ ∈ 𝐴))
17	10, 16	biimtrid 152	. . . . . . . . 9 ⊢ (𝐴 ⊆ I → (𝑥 ∈ dom 𝐴 → ⟨𝑥, 𝑥⟩ ∈ 𝐴))
18	12	imbi2d 230	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ dom 𝐴 → ⟨𝑥, 𝑥⟩ ∈ 𝐴) ↔ (𝑥 ∈ dom 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐴)))
19	17, 18	syl5ibcom 155	. . . . . . . 8 ⊢ (𝐴 ⊆ I → (𝑥 = 𝑦 → (𝑥 ∈ dom 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐴)))
20	9, 19	biimtrid 152	. . . . . . 7 ⊢ (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ I → (𝑥 ∈ dom 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐴)))
21	20	impd 254	. . . . . 6 ⊢ (𝐴 ⊆ I → ((⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑥 ∈ dom 𝐴) → ⟨𝑥, 𝑦⟩ ∈ 𝐴))
22	6, 21	impbid 129	. . . . 5 ⊢ (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ (⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑥 ∈ dom 𝐴)))
23	3	opelres 5018	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ ( I ↾ dom 𝐴) ↔ (⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑥 ∈ dom 𝐴))
24	22, 23	bitr4di 198	. . . 4 ⊢ (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ dom 𝐴)))
25	24	alrimivv 1923	. . 3 ⊢ (𝐴 ⊆ I → ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ dom 𝐴)))
26		reli 4859	. . . . 5 ⊢ Rel I
27		relss 4813	. . . . 5 ⊢ (𝐴 ⊆ I → (Rel I → Rel 𝐴))
28	26, 27	mpi 15	. . . 4 ⊢ (𝐴 ⊆ I → Rel 𝐴)
29		relres 5041	. . . 4 ⊢ Rel ( I ↾ dom 𝐴)
30		eqrel 4815	. . . 4 ⊢ ((Rel 𝐴 ∧ Rel ( I ↾ dom 𝐴)) → (𝐴 = ( I ↾ dom 𝐴) ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ dom 𝐴))))
31	28, 29, 30	sylancl 413	. . 3 ⊢ (𝐴 ⊆ I → (𝐴 = ( I ↾ dom 𝐴) ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ dom 𝐴))))
32	25, 31	mpbird 167	. 2 ⊢ (𝐴 ⊆ I → 𝐴 = ( I ↾ dom 𝐴))
33		resss 5037	. . 3 ⊢ ( I ↾ dom 𝐴) ⊆ I
34		sseq1 3250	. . 3 ⊢ (𝐴 = ( I ↾ dom 𝐴) → (𝐴 ⊆ I ↔ ( I ↾ dom 𝐴) ⊆ I ))
35	33, 34	mpbiri 168	. 2 ⊢ (𝐴 = ( I ↾ dom 𝐴) → 𝐴 ⊆ I )
36	32, 35	impbii 126	1 ⊢ (𝐴 ⊆ I ↔ 𝐴 = ( I ↾ dom 𝐴))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1395   = wceq 1397  ∃wex 1540   ∈ wcel 2202   ⊆ wss 3200  ⟨cop 3672   class class class wbr 4088   I cid 4385  dom cdm 4725   ↾ cres 4727  Rel wrel 4730

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-dm 4735  df-res 4737

This theorem is referenced by:  funcocnv2  5608