Theorem mirval 29160

Description: Value of the point inversion function 𝑆. Definition 7.5 of [Schwabhauser] p. 49. (Contributed by Thierry Arnoux, 30-May-2019.)

Hypotheses

Ref	Expression
mirval.p	⊢ 𝑃 = (Base‘𝐺)
mirval.d	⊢ − = (dist‘𝐺)
mirval.i	⊢ 𝐼 = (Itv‘𝐺)
mirval.l	⊢ 𝐿 = (LineG‘𝐺)
mirval.s	⊢ 𝑆 = (pInvG‘𝐺)
mirval.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
mirval.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)

Assertion

Ref	Expression
mirval	⊢ (𝜑 → (𝑆‘𝐴) = (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑦) ∧ 𝐴 ∈ (𝑧𝐼𝑦)))))

Distinct variable groups:   𝑦,𝑧,𝐴   𝑦,𝐺,𝑧   𝑦,𝐼,𝑧   𝑦,𝑃,𝑧   𝜑,𝑦,𝑧   𝑦, − ,𝑧

Allowed substitution hints:   𝑆(𝑦, 𝑧)   𝐿(𝑦, 𝑧)

Proof of Theorem mirval

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

Step	Hyp	Ref	Expression
1		mirval.s	. . 3 ⊢ 𝑆 = (pInvG‘𝐺)
2		df-mir 29158	. . . 4 ⊢ pInvG = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔) ↦ (𝑦 ∈ (Base‘𝑔) ↦ (℩𝑧 ∈ (Base‘𝑔)((𝑥(dist‘𝑔)𝑧) = (𝑥(dist‘𝑔)𝑦) ∧ 𝑥 ∈ (𝑧(Itv‘𝑔)𝑦))))))
3		fveq2 6911	. . . . . 6 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
4		mirval.p	. . . . . 6 ⊢ 𝑃 = (Base‘𝐺)
5	3, 4	eqtr4di 2816	. . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝑃)
6		fveq2 6911	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → (dist‘𝑔) = (dist‘𝐺))
7		mirval.d	. . . . . . . . . . 11 ⊢ − = (dist‘𝐺)
8	6, 7	eqtr4di 2816	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (dist‘𝑔) = − )
9	8	oveqd 7463	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (𝑥(dist‘𝑔)𝑧) = (𝑥 − 𝑧))
10	8	oveqd 7463	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (𝑥(dist‘𝑔)𝑦) = (𝑥 − 𝑦))
11	9, 10	eqeq12d 2779	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → ((𝑥(dist‘𝑔)𝑧) = (𝑥(dist‘𝑔)𝑦) ↔ (𝑥 − 𝑧) = (𝑥 − 𝑦)))
12		fveq2 6911	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → (Itv‘𝑔) = (Itv‘𝐺))
13		mirval.i	. . . . . . . . . . 11 ⊢ 𝐼 = (Itv‘𝐺)
14	12, 13	eqtr4di 2816	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (Itv‘𝑔) = 𝐼)
15	14	oveqd 7463	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (𝑧(Itv‘𝑔)𝑦) = (𝑧𝐼𝑦))
16	15	eleq2d 2850	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ (𝑧(Itv‘𝑔)𝑦) ↔ 𝑥 ∈ (𝑧𝐼𝑦)))
17	11, 16	anbi12d 644	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (((𝑥(dist‘𝑔)𝑧) = (𝑥(dist‘𝑔)𝑦) ∧ 𝑥 ∈ (𝑧(Itv‘𝑔)𝑦)) ↔ ((𝑥 − 𝑧) = (𝑥 − 𝑦) ∧ 𝑥 ∈ (𝑧𝐼𝑦))))
18	5, 17	riotaeqbidv 7406	. . . . . 6 ⊢ (𝑔 = 𝐺 → (℩𝑧 ∈ (Base‘𝑔)((𝑥(dist‘𝑔)𝑧) = (𝑥(dist‘𝑔)𝑦) ∧ 𝑥 ∈ (𝑧(Itv‘𝑔)𝑦))) = (℩𝑧 ∈ 𝑃 ((𝑥 − 𝑧) = (𝑥 − 𝑦) ∧ 𝑥 ∈ (𝑧𝐼𝑦))))
19	5, 18	mpteq12dv 5196	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑦 ∈ (Base‘𝑔) ↦ (℩𝑧 ∈ (Base‘𝑔)((𝑥(dist‘𝑔)𝑧) = (𝑥(dist‘𝑔)𝑦) ∧ 𝑥 ∈ (𝑧(Itv‘𝑔)𝑦)))) = (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝑥 − 𝑧) = (𝑥 − 𝑦) ∧ 𝑥 ∈ (𝑧𝐼𝑦)))))
20	5, 19	mpteq12dv 5196	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔) ↦ (𝑦 ∈ (Base‘𝑔) ↦ (℩𝑧 ∈ (Base‘𝑔)((𝑥(dist‘𝑔)𝑧) = (𝑥(dist‘𝑔)𝑦) ∧ 𝑥 ∈ (𝑧(Itv‘𝑔)𝑦))))) = (𝑥 ∈ 𝑃 ↦ (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝑥 − 𝑧) = (𝑥 − 𝑦) ∧ 𝑥 ∈ (𝑧𝐼𝑦))))))
21		mirval.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
22	21	elexd 3477	. . . 4 ⊢ (𝜑 → 𝐺 ∈ V)
23	4	fvexi 6925	. . . . . 6 ⊢ 𝑃 ∈ V
24	23	mptex 7255	. . . . 5 ⊢ (𝑥 ∈ 𝑃 ↦ (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝑥 − 𝑧) = (𝑥 − 𝑦) ∧ 𝑥 ∈ (𝑧𝐼𝑦))))) ∈ V
25	24	a1i 11	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑃 ↦ (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝑥 − 𝑧) = (𝑥 − 𝑦) ∧ 𝑥 ∈ (𝑧𝐼𝑦))))) ∈ V)
26	2, 20, 22, 25	fvmptd3 7043	. . 3 ⊢ (𝜑 → (pInvG‘𝐺) = (𝑥 ∈ 𝑃 ↦ (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝑥 − 𝑧) = (𝑥 − 𝑦) ∧ 𝑥 ∈ (𝑧𝐼𝑦))))))
27	1, 26	eqtrid 2810	. 2 ⊢ (𝜑 → 𝑆 = (𝑥 ∈ 𝑃 ↦ (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝑥 − 𝑧) = (𝑥 − 𝑦) ∧ 𝑥 ∈ (𝑧𝐼𝑦))))))
28		simpll 779	. . . . . . . 8 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 ∈ 𝑃) ∧ 𝑧 ∈ 𝑃) → 𝑥 = 𝐴)
29	28	oveq1d 7461	. . . . . . 7 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 ∈ 𝑃) ∧ 𝑧 ∈ 𝑃) → (𝑥 − 𝑧) = (𝐴 − 𝑧))
30	28	oveq1d 7461	. . . . . . 7 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 ∈ 𝑃) ∧ 𝑧 ∈ 𝑃) → (𝑥 − 𝑦) = (𝐴 − 𝑦))
31	29, 30	eqeq12d 2779	. . . . . 6 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 ∈ 𝑃) ∧ 𝑧 ∈ 𝑃) → ((𝑥 − 𝑧) = (𝑥 − 𝑦) ↔ (𝐴 − 𝑧) = (𝐴 − 𝑦)))
32	28	eleq1d 2849	. . . . . 6 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 ∈ 𝑃) ∧ 𝑧 ∈ 𝑃) → (𝑥 ∈ (𝑧𝐼𝑦) ↔ 𝐴 ∈ (𝑧𝐼𝑦)))
33	31, 32	anbi12d 644	. . . . 5 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 ∈ 𝑃) ∧ 𝑧 ∈ 𝑃) → (((𝑥 − 𝑧) = (𝑥 − 𝑦) ∧ 𝑥 ∈ (𝑧𝐼𝑦)) ↔ ((𝐴 − 𝑧) = (𝐴 − 𝑦) ∧ 𝐴 ∈ (𝑧𝐼𝑦))))
34	33	riotabidva 7422	. . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 ∈ 𝑃) → (℩𝑧 ∈ 𝑃 ((𝑥 − 𝑧) = (𝑥 − 𝑦) ∧ 𝑥 ∈ (𝑧𝐼𝑦))) = (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑦) ∧ 𝐴 ∈ (𝑧𝐼𝑦))))
35	34	mpteq2dva 5202	. . 3 ⊢ (𝑥 = 𝐴 → (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝑥 − 𝑧) = (𝑥 − 𝑦) ∧ 𝑥 ∈ (𝑧𝐼𝑦)))) = (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑦) ∧ 𝐴 ∈ (𝑧𝐼𝑦)))))
36	35	adantl 487	. 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝑥 − 𝑧) = (𝑥 − 𝑦) ∧ 𝑥 ∈ (𝑧𝐼𝑦)))) = (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑦) ∧ 𝐴 ∈ (𝑧𝐼𝑦)))))
37		mirval.a	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
38	23	mptex 7255	. . 3 ⊢ (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑦) ∧ 𝐴 ∈ (𝑧𝐼𝑦)))) ∈ V
39	38	a1i 11	. 2 ⊢ (𝜑 → (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑦) ∧ 𝐴 ∈ (𝑧𝐼𝑦)))) ∈ V)
40	27, 36, 37, 39	fvmptd 7027	1 ⊢ (𝜑 → (𝑆‘𝐴) = (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑦) ∧ 𝐴 ∈ (𝑧𝐼𝑦)))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ↦ cmpt 5190  ‘cfv 6561  ℩crio 7402  (class class class)co 7446  Basecbs 17419  distcds 17469  TarskiGcstrkg 28922  Itvcitv 28928  LineGclng 28929  pInvGcmir 29157

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pr 5396

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7403  df-ov 7449  df-mir 29158

This theorem is used by:  mirfv  29161  mirf  29165