Theorem ismtyres 36267

Description: A restriction of an isometry is an isometry. The condition 𝐴 ⊆ 𝑋 is not necessary but makes the proof easier. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 12-Sep-2015.)

Hypotheses

Ref	Expression
ismtyres.2	⊢ 𝐵 = (𝐹 “ 𝐴)
ismtyres.3	⊢ 𝑆 = (𝑀 ↾ (𝐴 × 𝐴))
ismtyres.4	⊢ 𝑇 = (𝑁 ↾ (𝐵 × 𝐵))

Assertion

Ref	Expression
ismtyres	⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → (𝐹 ↾ 𝐴) ∈ (𝑆 Ismty 𝑇))

Proof of Theorem ismtyres

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

Step	Hyp	Ref	Expression
1		isismty 36260	. . . . . 6 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) → (𝐹 ∈ (𝑀 Ismty 𝑁) ↔ (𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)))))
2	1	simprbda 499	. . . . 5 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ 𝐹 ∈ (𝑀 Ismty 𝑁)) → 𝐹:𝑋–1-1-onto→𝑌)
3	2	adantrr 715	. . . 4 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → 𝐹:𝑋–1-1-onto→𝑌)
4		f1of1 6783	. . . 4 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → 𝐹:𝑋–1-1→𝑌)
5	3, 4	syl 17	. . 3 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → 𝐹:𝑋–1-1→𝑌)
6		simprr 771	. . 3 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → 𝐴 ⊆ 𝑋)
7		f1ores 6798	. . 3 ⊢ ((𝐹:𝑋–1-1→𝑌 ∧ 𝐴 ⊆ 𝑋) → (𝐹 ↾ 𝐴):𝐴–1-1-onto→(𝐹 “ 𝐴))
8	5, 6, 7	syl2anc 584	. 2 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → (𝐹 ↾ 𝐴):𝐴–1-1-onto→(𝐹 “ 𝐴))
9	1	biimpa 477	. . . 4 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ 𝐹 ∈ (𝑀 Ismty 𝑁)) → (𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))))
10	9	adantrr 715	. . 3 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → (𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))))
11		ssel 3937	. . . . . . . . . . . . 13 ⊢ (𝐴 ⊆ 𝑋 → (𝑢 ∈ 𝐴 → 𝑢 ∈ 𝑋))
12		ssel 3937	. . . . . . . . . . . . 13 ⊢ (𝐴 ⊆ 𝑋 → (𝑣 ∈ 𝐴 → 𝑣 ∈ 𝑋))
13	11, 12	anim12d 609	. . . . . . . . . . . 12 ⊢ (𝐴 ⊆ 𝑋 → ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) → (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)))
14	13	imp 407	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ 𝑋 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋))
15		oveq1 7364	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑢 → (𝑥𝑀𝑦) = (𝑢𝑀𝑦))
16		fveq2 6842	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑢 → (𝐹‘𝑥) = (𝐹‘𝑢))
17	16	oveq1d 7372	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑢 → ((𝐹‘𝑥)𝑁(𝐹‘𝑦)) = ((𝐹‘𝑢)𝑁(𝐹‘𝑦)))
18	15, 17	eqeq12d 2752	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑢 → ((𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)) ↔ (𝑢𝑀𝑦) = ((𝐹‘𝑢)𝑁(𝐹‘𝑦))))
19		oveq2 7365	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑣 → (𝑢𝑀𝑦) = (𝑢𝑀𝑣))
20		fveq2 6842	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑣 → (𝐹‘𝑦) = (𝐹‘𝑣))
21	20	oveq2d 7373	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑣 → ((𝐹‘𝑢)𝑁(𝐹‘𝑦)) = ((𝐹‘𝑢)𝑁(𝐹‘𝑣)))
22	19, 21	eqeq12d 2752	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑣 → ((𝑢𝑀𝑦) = ((𝐹‘𝑢)𝑁(𝐹‘𝑦)) ↔ (𝑢𝑀𝑣) = ((𝐹‘𝑢)𝑁(𝐹‘𝑣))))
23	18, 22	rspc2v 3590	. . . . . . . . . . 11 ⊢ ((𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)) → (𝑢𝑀𝑣) = ((𝐹‘𝑢)𝑁(𝐹‘𝑣))))
24	14, 23	syl 17	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ 𝑋 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)) → (𝑢𝑀𝑣) = ((𝐹‘𝑢)𝑁(𝐹‘𝑣))))
25	24	imp 407	. . . . . . . . 9 ⊢ (((𝐴 ⊆ 𝑋 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) → (𝑢𝑀𝑣) = ((𝐹‘𝑢)𝑁(𝐹‘𝑣)))
26	25	an32s 650	. . . . . . . 8 ⊢ (((𝐴 ⊆ 𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝑢𝑀𝑣) = ((𝐹‘𝑢)𝑁(𝐹‘𝑣)))
27	26	adantlrl 718	. . . . . . 7 ⊢ (((𝐴 ⊆ 𝑋 ∧ (𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)))) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝑢𝑀𝑣) = ((𝐹‘𝑢)𝑁(𝐹‘𝑣)))
28	27	adantlll 716	. . . . . 6 ⊢ (((((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ 𝐴 ⊆ 𝑋) ∧ (𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)))) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝑢𝑀𝑣) = ((𝐹‘𝑢)𝑁(𝐹‘𝑣)))
29		ismtyres.3	. . . . . . . . 9 ⊢ 𝑆 = (𝑀 ↾ (𝐴 × 𝐴))
30	29	oveqi 7370	. . . . . . . 8 ⊢ (𝑢𝑆𝑣) = (𝑢(𝑀 ↾ (𝐴 × 𝐴))𝑣)
31		ovres 7520	. . . . . . . 8 ⊢ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) → (𝑢(𝑀 ↾ (𝐴 × 𝐴))𝑣) = (𝑢𝑀𝑣))
32	30, 31	eqtrid 2788	. . . . . . 7 ⊢ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) → (𝑢𝑆𝑣) = (𝑢𝑀𝑣))
33	32	adantl 482	. . . . . 6 ⊢ (((((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ 𝐴 ⊆ 𝑋) ∧ (𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)))) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝑢𝑆𝑣) = (𝑢𝑀𝑣))
34		fvres 6861	. . . . . . . . . . 11 ⊢ (𝑢 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑢) = (𝐹‘𝑢))
35	34	ad2antrl 726	. . . . . . . . . 10 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → ((𝐹 ↾ 𝐴)‘𝑢) = (𝐹‘𝑢))
36		fvres 6861	. . . . . . . . . . 11 ⊢ (𝑣 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑣) = (𝐹‘𝑣))
37	36	ad2antll 727	. . . . . . . . . 10 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → ((𝐹 ↾ 𝐴)‘𝑣) = (𝐹‘𝑣))
38	35, 37	oveq12d 7375	. . . . . . . . 9 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (((𝐹 ↾ 𝐴)‘𝑢)𝑇((𝐹 ↾ 𝐴)‘𝑣)) = ((𝐹‘𝑢)𝑇(𝐹‘𝑣)))
39		ismtyres.4	. . . . . . . . . . 11 ⊢ 𝑇 = (𝑁 ↾ (𝐵 × 𝐵))
40	39	oveqi 7370	. . . . . . . . . 10 ⊢ ((𝐹‘𝑢)𝑇(𝐹‘𝑣)) = ((𝐹‘𝑢)(𝑁 ↾ (𝐵 × 𝐵))(𝐹‘𝑣))
41		f1ofun 6786	. . . . . . . . . . . . . . . 16 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → Fun 𝐹)
42	41	adantl 482	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) → Fun 𝐹)
43		f1odm 6788	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → dom 𝐹 = 𝑋)
44	43	sseq2d 3976	. . . . . . . . . . . . . . . 16 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → (𝐴 ⊆ dom 𝐹 ↔ 𝐴 ⊆ 𝑋))
45	44	biimparc 480	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) → 𝐴 ⊆ dom 𝐹)
46		funfvima2 7181	. . . . . . . . . . . . . . 15 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝑢 ∈ 𝐴 → (𝐹‘𝑢) ∈ (𝐹 “ 𝐴)))
47	42, 45, 46	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) → (𝑢 ∈ 𝐴 → (𝐹‘𝑢) ∈ (𝐹 “ 𝐴)))
48	47	imp 407	. . . . . . . . . . . . 13 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ 𝑢 ∈ 𝐴) → (𝐹‘𝑢) ∈ (𝐹 “ 𝐴))
49		ismtyres.2	. . . . . . . . . . . . 13 ⊢ 𝐵 = (𝐹 “ 𝐴)
50	48, 49	eleqtrrdi 2849	. . . . . . . . . . . 12 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ 𝑢 ∈ 𝐴) → (𝐹‘𝑢) ∈ 𝐵)
51	50	adantrr 715	. . . . . . . . . . 11 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝐹‘𝑢) ∈ 𝐵)
52		funfvima2 7181	. . . . . . . . . . . . . . 15 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝑣 ∈ 𝐴 → (𝐹‘𝑣) ∈ (𝐹 “ 𝐴)))
53	42, 45, 52	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) → (𝑣 ∈ 𝐴 → (𝐹‘𝑣) ∈ (𝐹 “ 𝐴)))
54	53	imp 407	. . . . . . . . . . . . 13 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ 𝑣 ∈ 𝐴) → (𝐹‘𝑣) ∈ (𝐹 “ 𝐴))
55	54, 49	eleqtrrdi 2849	. . . . . . . . . . . 12 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ 𝑣 ∈ 𝐴) → (𝐹‘𝑣) ∈ 𝐵)
56	55	adantrl 714	. . . . . . . . . . 11 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝐹‘𝑣) ∈ 𝐵)
57	51, 56	ovresd 7521	. . . . . . . . . 10 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → ((𝐹‘𝑢)(𝑁 ↾ (𝐵 × 𝐵))(𝐹‘𝑣)) = ((𝐹‘𝑢)𝑁(𝐹‘𝑣)))
58	40, 57	eqtrid 2788	. . . . . . . . 9 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → ((𝐹‘𝑢)𝑇(𝐹‘𝑣)) = ((𝐹‘𝑢)𝑁(𝐹‘𝑣)))
59	38, 58	eqtrd 2776	. . . . . . . 8 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (((𝐹 ↾ 𝐴)‘𝑢)𝑇((𝐹 ↾ 𝐴)‘𝑣)) = ((𝐹‘𝑢)𝑁(𝐹‘𝑣)))
60	59	adantlrr 719	. . . . . . 7 ⊢ (((𝐴 ⊆ 𝑋 ∧ (𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)))) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (((𝐹 ↾ 𝐴)‘𝑢)𝑇((𝐹 ↾ 𝐴)‘𝑣)) = ((𝐹‘𝑢)𝑁(𝐹‘𝑣)))
61	60	adantlll 716	. . . . . 6 ⊢ (((((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ 𝐴 ⊆ 𝑋) ∧ (𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)))) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (((𝐹 ↾ 𝐴)‘𝑢)𝑇((𝐹 ↾ 𝐴)‘𝑣)) = ((𝐹‘𝑢)𝑁(𝐹‘𝑣)))
62	28, 33, 61	3eqtr4d 2786	. . . . 5 ⊢ (((((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ 𝐴 ⊆ 𝑋) ∧ (𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)))) ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝑢𝑆𝑣) = (((𝐹 ↾ 𝐴)‘𝑢)𝑇((𝐹 ↾ 𝐴)‘𝑣)))
63	62	ralrimivva 3197	. . . 4 ⊢ ((((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ 𝐴 ⊆ 𝑋) ∧ (𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)))) → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢𝑆𝑣) = (((𝐹 ↾ 𝐴)‘𝑢)𝑇((𝐹 ↾ 𝐴)‘𝑣)))
64	63	adantlrl 718	. . 3 ⊢ ((((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) ∧ (𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)))) → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢𝑆𝑣) = (((𝐹 ↾ 𝐴)‘𝑢)𝑇((𝐹 ↾ 𝐴)‘𝑣)))
65	10, 64	mpdan 685	. 2 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢𝑆𝑣) = (((𝐹 ↾ 𝐴)‘𝑢)𝑇((𝐹 ↾ 𝐴)‘𝑣)))
66		xmetres2 23714	. . . . 5 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝑀 ↾ (𝐴 × 𝐴)) ∈ (∞Met‘𝐴))
67	29, 66	eqeltrid 2842	. . . 4 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝑆 ∈ (∞Met‘𝐴))
68	67	ad2ant2rl 747	. . 3 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → 𝑆 ∈ (∞Met‘𝐴))
69		simplr 767	. . . . . 6 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → 𝑁 ∈ (∞Met‘𝑌))
70		imassrn 6024	. . . . . . . 8 ⊢ (𝐹 “ 𝐴) ⊆ ran 𝐹
71	49, 70	eqsstri 3978	. . . . . . 7 ⊢ 𝐵 ⊆ ran 𝐹
72		f1ofo 6791	. . . . . . . 8 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → 𝐹:𝑋–onto→𝑌)
73		forn 6759	. . . . . . . 8 ⊢ (𝐹:𝑋–onto→𝑌 → ran 𝐹 = 𝑌)
74	3, 72, 73	3syl 18	. . . . . . 7 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → ran 𝐹 = 𝑌)
75	71, 74	sseqtrid 3996	. . . . . 6 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → 𝐵 ⊆ 𝑌)
76		xmetres2 23714	. . . . . 6 ⊢ ((𝑁 ∈ (∞Met‘𝑌) ∧ 𝐵 ⊆ 𝑌) → (𝑁 ↾ (𝐵 × 𝐵)) ∈ (∞Met‘𝐵))
77	69, 75, 76	syl2anc 584	. . . . 5 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → (𝑁 ↾ (𝐵 × 𝐵)) ∈ (∞Met‘𝐵))
78	39, 77	eqeltrid 2842	. . . 4 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → 𝑇 ∈ (∞Met‘𝐵))
79	49	fveq2i 6845	. . . 4 ⊢ (∞Met‘𝐵) = (∞Met‘(𝐹 “ 𝐴))
80	78, 79	eleqtrdi 2848	. . 3 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → 𝑇 ∈ (∞Met‘(𝐹 “ 𝐴)))
81		isismty 36260	. . 3 ⊢ ((𝑆 ∈ (∞Met‘𝐴) ∧ 𝑇 ∈ (∞Met‘(𝐹 “ 𝐴))) → ((𝐹 ↾ 𝐴) ∈ (𝑆 Ismty 𝑇) ↔ ((𝐹 ↾ 𝐴):𝐴–1-1-onto→(𝐹 “ 𝐴) ∧ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢𝑆𝑣) = (((𝐹 ↾ 𝐴)‘𝑢)𝑇((𝐹 ↾ 𝐴)‘𝑣)))))
82	68, 80, 81	syl2anc 584	. 2 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → ((𝐹 ↾ 𝐴) ∈ (𝑆 Ismty 𝑇) ↔ ((𝐹 ↾ 𝐴):𝐴–1-1-onto→(𝐹 “ 𝐴) ∧ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢𝑆𝑣) = (((𝐹 ↾ 𝐴)‘𝑢)𝑇((𝐹 ↾ 𝐴)‘𝑣)))))
83	8, 65, 82	mpbir2and 711	1 ⊢ (((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) ∧ (𝐹 ∈ (𝑀 Ismty 𝑁) ∧ 𝐴 ⊆ 𝑋)) → (𝐹 ↾ 𝐴) ∈ (𝑆 Ismty 𝑇))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3064   ⊆ wss 3910   × cxp 5631  dom cdm 5633  ran crn 5634   ↾ cres 5635   “ cima 5636  Fun wfun 6490  –1-1→wf1 6493  –onto→wfo 6494  –1-1-onto→wf1o 6495  ‘cfv 6496  (class class class)co 7357  ∞Metcxmet 20781   Ismty cismty 36257

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-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-resscn 11108

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-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-sbc 3740  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-ov 7360  df-oprab 7361  df-mpo 7362  df-map 8767  df-xr 11193  df-xmet 20789  df-ismty 36258

This theorem is referenced by:  reheibor  36298