Theorem ismtycnv 38539

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 6834	. . . . 5 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → ◡𝐹:𝑌–1-1-onto→𝑋)
2	1	adantr 486	. . . 4 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) → ◡𝐹:𝑌–1-1-onto→𝑋)
3		f1ocnvdm 7289	. . . . . . . . . . 11 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ 𝑢 ∈ 𝑌) → (◡𝐹‘𝑢) ∈ 𝑋)
4	3	ex 418	. . . . . . . . . 10 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → (𝑢 ∈ 𝑌 → (◡𝐹‘𝑢) ∈ 𝑋))
5		f1ocnvdm 7289	. . . . . . . . . . 11 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ 𝑣 ∈ 𝑌) → (◡𝐹‘𝑣) ∈ 𝑋)
6	5	ex 418	. . . . . . . . . 10 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → (𝑣 ∈ 𝑌 → (◡𝐹‘𝑣) ∈ 𝑋))
7	4, 6	anim12d 621	. . . . . . . . 9 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → ((𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌) → ((◡𝐹‘𝑢) ∈ 𝑋 ∧ (◡𝐹‘𝑣) ∈ 𝑋)))
8	7	adantr 486	. . . . . . . 8 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) → ((𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌) → ((◡𝐹‘𝑢) ∈ 𝑋 ∧ (◡𝐹‘𝑣) ∈ 𝑋)))
9	8	imdistani 579	. . . . . . 7 ⊢ (((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → ((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) ∧ ((◡𝐹‘𝑢) ∈ 𝑋 ∧ (◡𝐹‘𝑣) ∈ 𝑋)))
10		oveq1 7423	. . . . . . . . . . 11 ⊢ (𝑥 = (◡𝐹‘𝑢) → (𝑥𝑀𝑦) = ((◡𝐹‘𝑢)𝑀𝑦))
11		fveq2 6882	. . . . . . . . . . . 12 ⊢ (𝑥 = (◡𝐹‘𝑢) → (𝐹‘𝑥) = (𝐹‘(◡𝐹‘𝑢)))
12	11	oveq1d 7431	. . . . . . . . . . 11 ⊢ (𝑥 = (◡𝐹‘𝑢) → ((𝐹‘𝑥)𝑁(𝐹‘𝑦)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘𝑦)))
13	10, 12	eqeq12d 2778	. . . . . . . . . 10 ⊢ (𝑥 = (◡𝐹‘𝑢) → ((𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)) ↔ ((◡𝐹‘𝑢)𝑀𝑦) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘𝑦))))
14		oveq2 7424	. . . . . . . . . . 11 ⊢ (𝑦 = (◡𝐹‘𝑣) → ((◡𝐹‘𝑢)𝑀𝑦) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)))
15		fveq2 6882	. . . . . . . . . . . 12 ⊢ (𝑦 = (◡𝐹‘𝑣) → (𝐹‘𝑦) = (𝐹‘(◡𝐹‘𝑣)))
16	15	oveq2d 7432	. . . . . . . . . . 11 ⊢ (𝑦 = (◡𝐹‘𝑣) → ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘𝑦)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣))))
17	14, 16	eqeq12d 2778	. . . . . . . . . 10 ⊢ (𝑦 = (◡𝐹‘𝑣) → (((◡𝐹‘𝑢)𝑀𝑦) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘𝑦)) ↔ ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣)))))
18	13, 17	rspc2v 3590	. . . . . . . . 9 ⊢ (((◡𝐹‘𝑢) ∈ 𝑋 ∧ (◡𝐹‘𝑣) ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)) → ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣)))))
19	18	impcom 413	. . . . . . . 8 ⊢ ((∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)) ∧ ((◡𝐹‘𝑢) ∈ 𝑋 ∧ (◡𝐹‘𝑣) ∈ 𝑋)) → ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣))))
20	19	adantll 727	. . . . . . 7 ⊢ (((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) ∧ ((◡𝐹‘𝑢) ∈ 𝑋 ∧ (◡𝐹‘𝑣) ∈ 𝑋)) → ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣))))
21	9, 20	syl 18	. . . . . 6 ⊢ (((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣))))
22		f1ocnvfv2 7281	. . . . . . . . 9 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ 𝑢 ∈ 𝑌) → (𝐹‘(◡𝐹‘𝑢)) = 𝑢)
23	22	adantrr 730	. . . . . . . 8 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → (𝐹‘(◡𝐹‘𝑢)) = 𝑢)
24		f1ocnvfv2 7281	. . . . . . . . 9 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ 𝑣 ∈ 𝑌) → (𝐹‘(◡𝐹‘𝑣)) = 𝑣)
25	24	adantrl 729	. . . . . . . 8 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → (𝐹‘(◡𝐹‘𝑣)) = 𝑣)
26	23, 25	oveq12d 7434	. . . . . . 7 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣))) = (𝑢𝑁𝑣))
27	26	adantlr 728	. . . . . 6 ⊢ (((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣))) = (𝑢𝑁𝑣))
28	21, 27	eqtr2d 2798	. . . . 5 ⊢ (((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → (𝑢𝑁𝑣) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)))
29	28	ralrimivva 3207	. . . 4 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) → ∀𝑢 ∈ 𝑌 ∀𝑣 ∈ 𝑌 (𝑢𝑁𝑣) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)))
30	2, 29	jca 521	. . 3 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) → (◡𝐹:𝑌–1-1-onto→𝑋 ∧ ∀𝑢 ∈ 𝑌 ∀𝑣 ∈ 𝑌 (𝑢𝑁𝑣) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣))))
31	30	a1i 11	. 2 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) → ((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) → (◡𝐹:𝑌–1-1-onto→𝑋 ∧ ∀𝑢 ∈ 𝑌 ∀𝑣 ∈ 𝑌 (𝑢𝑁𝑣) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)))))
32		isismty 38538	. 2 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) → (𝐹 ∈ (𝑀 Ismty 𝑁) ↔ (𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)))))
33		isismty 38538	. . 3 ⊢ ((𝑁 ∈ (∞Met‘𝑌) ∧ 𝑀 ∈ (∞Met‘𝑋)) → (◡𝐹 ∈ (𝑁 Ismty 𝑀) ↔ (◡𝐹:𝑌–1-1-onto→𝑋 ∧ ∀𝑢 ∈ 𝑌 ∀𝑣 ∈ 𝑌 (𝑢𝑁𝑣) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)))))
34	33	ancoms 464	. 2 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) → (◡𝐹 ∈ (𝑁 Ismty 𝑀) ↔ (◡𝐹:𝑌–1-1-onto→𝑋 ∧ ∀𝑢 ∈ 𝑌 ∀𝑣 ∈ 𝑌 (𝑢𝑁𝑣) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)))))
35	31, 32, 34	3imtr4d 297	1 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) → (𝐹 ∈ (𝑀 Ismty 𝑁) → ◡𝐹 ∈ (𝑁 Ismty 𝑀)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078  ^◡ccnv 5658  –1-1-onto→wf1o 6536  ‘cfv 6537  (class class class)co 7416  ∞Metcxmet 21571   Ismty cismty 38535

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-cnex 11183  ax-resscn 11184

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-map 8831  df-xr 11274  df-xmet 21579  df-ismty 38536

This theorem is used by:  ismtyhmeolem  38541  ismtyhmeo  38542  ismtybnd  38544