MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mirf1o Structured version   Visualization version   GIF version

Theorem mirf1o 29146
Description: The point inversion function 𝑀 is a bijection. Theorem 7.11 of [Schwabhauser] p. 50. (Contributed by Thierry Arnoux, 6-Jun-2019.)
Hypotheses
Ref Expression
mirval.p 𝑃 = (Base‘𝐺)
mirval.d − = (dist‘𝐺)
mirval.i 𝐼 = (Itv‘𝐺)
mirval.l 𝐿 = (LineG‘𝐺)
mirval.s 𝑆 = (pInvG‘𝐺)
mirval.g (𝜑 → 𝐺 ∈ TarskiG)
mirval.a (𝜑 → 𝐴 ∈ 𝑃)
mirfv.m 𝑀 = (𝑆‘𝐴)
Assertion
Ref Expression
mirf1o (𝜑 → 𝑀:𝑃–1-1-onto→𝑃)

Proof of Theorem mirf1o
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 mirval.p . . . 4 𝑃 = (Base‘𝐺)
2 mirval.d . . . 4 − = (dist‘𝐺)
3 mirval.i . . . 4 𝐼 = (Itv‘𝐺)
4 mirval.l . . . 4 𝐿 = (LineG‘𝐺)
5 mirval.s . . . 4 𝑆 = (pInvG‘𝐺)
6 mirval.g . . . 4 (𝜑 → 𝐺 ∈ TarskiG)
7 mirval.a . . . 4 (𝜑 → 𝐴 ∈ 𝑃)
8 mirfv.m . . . 4 𝑀 = (𝑆‘𝐴)
91, 2, 3, 4, 5, 6, 7, 8mirf 29137 . . 3 (𝜑 → 𝑀:𝑃⟶𝑃)
109ffnd 6710 . 2 (𝜑 → 𝑀 Fn 𝑃)
116adantr 486 . . . . 5 ((𝜑 ∧ 𝑎 ∈ 𝑃) → 𝐺 ∈ TarskiG)
127adantr 486 . . . . 5 ((𝜑 ∧ 𝑎 ∈ 𝑃) → 𝐴 ∈ 𝑃)
13 simpr 490 . . . . 5 ((𝜑 ∧ 𝑎 ∈ 𝑃) → 𝑎 ∈ 𝑃)
141, 2, 3, 4, 5, 11, 12, 8, 13mirmir 29139 . . . 4 ((𝜑 ∧ 𝑎 ∈ 𝑃) → (𝑀‘(𝑀‘𝑎)) = 𝑎)
1514ralrimiva 3154 . . 3 (𝜑 → ∀𝑎 ∈ 𝑃 (𝑀‘(𝑀‘𝑎)) = 𝑎)
16 nvocnv 7289 . . 3 ((𝑀:𝑃⟶𝑃 ∧ ∀𝑎 ∈ 𝑃 (𝑀‘(𝑀‘𝑎)) = 𝑎) → ◡𝑀 = 𝑀)
179, 15, 16syl2anc 596 . 2 (𝜑 → ◡𝑀 = 𝑀)
18 nvof1o 7288 . 2 ((𝑀 Fn 𝑃 ∧ ◡𝑀 = 𝑀) → 𝑀:𝑃–1-1-onto→𝑃)
1910, 17, 18syl2anc 596 1 (𝜑 → 𝑀:𝑃–1-1-onto→𝑃)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ◡ccnv 5649   Fn wfn 6533  ⟶wf 6534  –1-1-onto→wf1o 6537  ‘cfv 6538  Basecbs 17392  distcds 17442  TarskiGcstrkg 28894  Itvcitv 28900  LineGclng 28901  pInvGcmir 29129
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-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390
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-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  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-riota 7377  df-ov 7423  df-trkgc 28915  df-trkgb 28916  df-trkgcb 28917  df-trkg 28920  df-mir 29130
This theorem is used by:  mirmot  29152
  Copyright terms: Public domain W3C validator