Theorem ismtycnv 38737

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 6837	. . . . 5 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → ◡𝐹:𝑌–1-1-onto→𝑋)
2	1	adantr 486	. . . 4 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) → ◡𝐹:𝑌–1-1-onto→𝑋)
3		f1ocnvdm 7293	. . . . . . . . . . 11 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ 𝑢 ∈ 𝑌) → (◡𝐹‘𝑢) ∈ 𝑋)
4	3	ex 418	. . . . . . . . . 10 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → (𝑢 ∈ 𝑌 → (◡𝐹‘𝑢) ∈ 𝑋))
5		f1ocnvdm 7293	. . . . . . . . . . 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 7427	. . . . . . . . . . 11 ⊢ (𝑥 = (◡𝐹‘𝑢) → (𝑥𝑀𝑦) = ((◡𝐹‘𝑢)𝑀𝑦))
11		fveq2 6885	. . . . . . . . . . . 12 ⊢ (𝑥 = (◡𝐹‘𝑢) → (𝐹‘𝑥) = (𝐹‘(◡𝐹‘𝑢)))
12	11	oveq1d 7435	. . . . . . . . . . 11 ⊢ (𝑥 = (◡𝐹‘𝑢) → ((𝐹‘𝑥)𝑁(𝐹‘𝑦)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘𝑦)))
13	10, 12	eqeq12d 2776	. . . . . . . . . 10 ⊢ (𝑥 = (◡𝐹‘𝑢) → ((𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)) ↔ ((◡𝐹‘𝑢)𝑀𝑦) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘𝑦))))
14		oveq2 7428	. . . . . . . . . . 11 ⊢ (𝑦 = (◡𝐹‘𝑣) → ((◡𝐹‘𝑢)𝑀𝑦) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)))
15		fveq2 6885	. . . . . . . . . . . 12 ⊢ (𝑦 = (◡𝐹‘𝑣) → (𝐹‘𝑦) = (𝐹‘(◡𝐹‘𝑣)))
16	15	oveq2d 7436	. . . . . . . . . . 11 ⊢ (𝑦 = (◡𝐹‘𝑣) → ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘𝑦)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣))))
17	14, 16	eqeq12d 2776	. . . . . . . . . 10 ⊢ (𝑦 = (◡𝐹‘𝑣) → (((◡𝐹‘𝑢)𝑀𝑦) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘𝑦)) ↔ ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)) = ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣)))))
18	13, 17	rspc2v 3586	. . . . . . . . 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 7285	. . . . . . . . 9 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ 𝑢 ∈ 𝑌) → (𝐹‘(◡𝐹‘𝑢)) = 𝑢)
23	22	adantrr 730	. . . . . . . 8 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → (𝐹‘(◡𝐹‘𝑢)) = 𝑢)
24		f1ocnvfv2 7285	. . . . . . . . 9 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ 𝑣 ∈ 𝑌) → (𝐹‘(◡𝐹‘𝑣)) = 𝑣)
25	24	adantrl 729	. . . . . . . 8 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → (𝐹‘(◡𝐹‘𝑣)) = 𝑣)
26	23, 25	oveq12d 7438	. . . . . . 7 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣))) = (𝑢𝑁𝑣))
27	26	adantlr 728	. . . . . 6 ⊢ (((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → ((𝐹‘(◡𝐹‘𝑢))𝑁(𝐹‘(◡𝐹‘𝑣))) = (𝑢𝑁𝑣))
28	21, 27	eqtr2d 2796	. . . . 5 ⊢ (((𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦))) ∧ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → (𝑢𝑁𝑣) = ((◡𝐹‘𝑢)𝑀(◡𝐹‘𝑣)))
29	28	ralrimivva 3205	. . . 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 38736	. 2 ⊢ ((𝑀 ∈ (∞Met‘𝑋) ∧ 𝑁 ∈ (∞Met‘𝑌)) → (𝐹 ∈ (𝑀 Ismty 𝑁) ↔ (𝐹:𝑋–1-1-onto→𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑀𝑦) = ((𝐹‘𝑥)𝑁(𝐹‘𝑦)))))
33		isismty 38736	. . 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 1569   ∈ wcel 2144  ∀wral 3076  ^◡ccnv 5649  –1-1-onto→wf1o 6537  ‘cfv 6538  (class class class)co 7420  ∞Metcxmet 21663   Ismty cismty 38733

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-cnex 11256  ax-resscn 11257

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-map 8849  df-xr 11347  df-xmet 21671  df-ismty 38734

This theorem is used by:  ismtyhmeolem  38739  ismtyhmeo  38740  ismtybnd  38742