Theorem ismtycnv 37972

Description: The inverse of an isometry is an isometry. (Contributed by Jeff Madsen, 2-Sep-2009.)

Assertion

Ref	Expression
ismtycnv	⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) → (𝐹 ∈ (𝑀 Ismty 𝑁) → ◡𝐹 ∈ (𝑁 Ismty 𝑀)))

Proof of Theorem ismtycnv

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

Step	Hyp	Ref	Expression
1		f1ocnv 6785	. . . . 5 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → ◡𝐹:𝑌–1-1-onto→𝑋)
2	1	adantr 480	. . . 4 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) → ◡𝐹:𝑌–1-1-onto→𝑋)
3		f1ocnvdm 7231	. . . . . . . . . . 11 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ 𝑢 ∈ 𝑌) → (◡𝐹‘𝑢) ∈ 𝑋)
4	3	ex 412	. . . . . . . . . 10 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → (𝑢 ∈ 𝑌 → (◡𝐹‘𝑢) ∈ 𝑋))
5		f1ocnvdm 7231	. . . . . . . . . . 11 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ 𝑣 ∈ 𝑌) → (◡𝐹‘𝑣) ∈ 𝑋)
6	5	ex 412	. . . . . . . . . 10 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → (𝑣 ∈ 𝑌 → (◡𝐹‘𝑣) ∈ 𝑋))
7	4, 6	anim12d 610	. . . . . . . . 9 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → ((𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌) → ((◡𝐹‘𝑢) ∈ 𝑋 ∧ (◡𝐹‘𝑣) ∈ 𝑋)))
8	7	adantr 480	. . . . . . . 8 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) → ((𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌) → ((◡𝐹‘𝑢) ∈ 𝑋 ∧ (◡𝐹‘𝑣) ∈ 𝑋)))
9	8	imdistani 568	. . . . . . 7 ⊢ (((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → ((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) ∧ ((◡𝐹‘𝑢) ∈ 𝑋 ∧ (◡𝐹‘𝑣) ∈ 𝑋)))
10		oveq1 7365	. . . . . . . . . . 11 ⊢ (𝑥 = (◡𝐹‘𝑢) → (𝑥𝑀𝑦) = ((◡𝐹‘𝑢)𝑀𝑦))
11		fveq2 6833	. . . . . . . . . . . 12 ⊢ (𝑥 = (◡𝐹‘𝑢) → (𝐹‘𝑥) = (𝐹‘(◡𝐹‘𝑢)))
12	11	oveq1d 7373	. . . . . . . . . . 11 ⊢ (𝑥 = (◡𝐹‘𝑢) → ((𝐹‘𝑥)𝑁(𝐹‘𝑦)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘𝑦)))
13	10, 12	eqeq12d 2751	. . . . . . . . . 10 ⊢ (𝑥 = (◡𝐹‘𝑢) → ((𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)) ↔ ((◡𝐹‘𝑢)𝑀𝑦) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘𝑦))))
14		oveq2 7366	. . . . . . . . . . 11 ⊢ (𝑦 = (◡𝐹‘𝑣) → ((◡𝐹‘𝑢)𝑀𝑦) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)))
15		fveq2 6833	. . . . . . . . . . . 12 ⊢ (𝑦 = (◡𝐹‘𝑣) → (𝐹‘𝑦) = (𝐹‘(◡𝐹‘𝑣)))
16	15	oveq2d 7374	. . . . . . . . . . 11 ⊢ (𝑦 = (◡𝐹‘𝑣) → ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘𝑦)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣))))
17	14, 16	eqeq12d 2751	. . . . . . . . . 10 ⊢ (𝑦 = (◡𝐹‘𝑣) → (((◡𝐹‘𝑢)𝑀𝑦) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘𝑦)) ↔ ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣)))))
18	13, 17	rspc2v 3586	. . . . . . . . 9 ⊢ (((◡𝐹‘𝑢) ∈ 𝑋 ∧ (◡𝐹‘𝑣) ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)) → ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣)))))
19	18	impcom 407	. . . . . . . 8 ⊢ ((∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)) ∧ ((◡𝐹‘𝑢) ∈ 𝑋 ∧ (◡𝐹‘𝑣) ∈ 𝑋)) → ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣))))
20	19	adantll 715	. . . . . . 7 ⊢ (((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) ∧ ((◡𝐹‘𝑢) ∈ 𝑋 ∧ (◡𝐹‘𝑣) ∈ 𝑋)) → ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣))))
21	9, 20	syl 17	. . . . . 6 ⊢ (((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣))))
22		f1ocnvfv2 7223	. . . . . . . . 9 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ 𝑢 ∈ 𝑌) → (𝐹‘(◡𝐹‘𝑢)) = 𝑢)
23	22	adantrr 718	. . . . . . . 8 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → (𝐹‘(◡𝐹‘𝑢)) = 𝑢)
24		f1ocnvfv2 7223	. . . . . . . . 9 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ 𝑣 ∈ 𝑌) → (𝐹‘(◡𝐹‘𝑣)) = 𝑣)
25	24	adantrl 717	. . . . . . . 8 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → (𝐹‘(◡𝐹‘𝑣)) = 𝑣)
26	23, 25	oveq12d 7376	. . . . . . 7 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣))) = (𝑢𝑁𝑣))
27	26	adantlr 716	. . . . . 6 ⊢ (((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣))) = (𝑢𝑁𝑣))
28	21, 27	eqtr2d 2771	. . . . 5 ⊢ (((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → (𝑢𝑁𝑣) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)))
29	28	ralrimivva 3178	. . . 4 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) → ∀𝑢 ∈ 𝑌 ∀𝑣 ∈ 𝑌 (𝑢𝑁𝑣) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)))
30	2, 29	jca 511	. . 3 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) → (◡𝐹:𝑌–1-1-onto→𝑋 ∧ ∀𝑢 ∈ 𝑌 ∀𝑣 ∈ 𝑌 (𝑢𝑁𝑣) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣))))
31	30	a1i 11	. 2 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) → ((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) → (◡𝐹:𝑌–1-1-onto→𝑋 ∧ ∀𝑢 ∈ 𝑌 ∀𝑣 ∈ 𝑌 (𝑢𝑁𝑣) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)))))
32		isismty 37971	. 2 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) → (𝐹 ∈ (𝑀 Ismty 𝑁) ↔ (𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)))))
33		isismty 37971	. . 3 ⊢ ((𝑁 ∈ (∞Met‘𝑌) ∧ 𝑀 ∈ (∞Met‘𝑋)) → (◡𝐹 ∈ (𝑁 Ismty 𝑀) ↔ (◡𝐹:𝑌–1-1-onto→𝑋 ∧ ∀𝑢 ∈ 𝑌 ∀𝑣 ∈ 𝑌 (𝑢𝑁𝑣) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)))))
34	33	ancoms 458	. 2 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) → (◡𝐹 ∈ (𝑁 Ismty 𝑀) ↔ (◡𝐹:𝑌–1-1-onto→𝑋 ∧ ∀𝑢 ∈ 𝑌 ∀𝑣 ∈ 𝑌 (𝑢𝑁𝑣) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)))))
35	31, 32, 34	3imtr4d 294	1 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) → (𝐹 ∈ (𝑀 Ismty 𝑁) → ◡𝐹 ∈ (𝑁 Ismty 𝑀)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3050  ^◡ccnv 5622  –1-1-onto→wf1o 6490  ‘cfv 6491  (class class class)co 7358  ∞Metcxmet 21296   Ismty cismty 37968

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pow 5309  ax-pr 5376  ax-un 7680  ax-cnex 11084  ax-resscn 11085

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3399  df-v 3441  df-sbc 3740  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6447  df-fun 6493  df-fn 6494  df-f 6495  df-f1 6496  df-fo 6497  df-f1o 6498  df-fv 6499  df-ov 7361  df-oprab 7362  df-mpo 7363  df-map 8767  df-xr 11172  df-xmet 21304  df-ismty 37969

This theorem is referenced by:  ismtyhmeolem  37974  ismtyhmeo  37975  ismtybnd  37977