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

Theorem mirf1o 29174
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-1onto𝑃)

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 29165 . . 3 (𝜑 → 𝑀:𝑃⟶𝑃)
109ffnd 6735 . 2 (𝜑 → 𝑀 Fn 𝑃)
116adantr 486 . . . . 5 ((𝜑 ∧ 𝑎 ∈ 𝑃) → 𝐺 ∈ TarskiG)
127adantr 486 . . . . 5 ((𝜑 ∧ 𝑎 ∈ 𝑃) → 𝐴 ∈ 𝑃)
13 simpr 490 . . . . 5 ((𝜑 ∧ 𝑎 ∈ 𝑃) → 𝑎 ∈ 𝑃)
141, 2, 3, 4, 5, 11, 12, 8, 13mirmir 29167 . . . 4 ((𝜑 ∧ 𝑎 ∈ 𝑃) → (𝑀‘(𝑀‘𝑎)) = 𝑎)
1514ralrimiva 3158 . . 3 (𝜑 → ∀𝑎 ∈ 𝑃 (𝑀‘(𝑀‘𝑎)) = 𝑎)
16 nvocnv 7315 . . 3 ((𝑀:𝑃⟶𝑃 ∧ ∀𝑎 ∈ 𝑃 (𝑀‘(𝑀‘𝑎)) = 𝑎) → ◡𝑀 = 𝑀)
179, 15, 16syl2anc 596 . 2 (𝜑 → ◡𝑀 = 𝑀)
18 nvof1o 7314 . 2 ((𝑀 Fn 𝑃 ∧ ◡𝑀 = 𝑀) → 𝑀:𝑃⟶1-1onto𝑃)
1910, 17, 18syl2anc 596 1 (𝜑 → 𝑀:𝑃⟶1-1onto𝑃)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ◡ccnv 5655   Fn wfn 6556  ⟶wf 6557  ⟶1-1ontowf1o 6560  ‘cfv 6561  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-rmo 3369  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-pw 4562  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-trkgc 28943  df-trkgb 28944  df-trkgcb 28945  df-trkg 28948  df-mir 29158
This theorem is used by:  mirmot  29180
  Copyright terms: Public domain W3C validator