| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > miduniq2 | Structured version Visualization version GIF version | ||
| Description: If two point inversions commute, they are identical. Theorem 7.19 of [Schwabhauser] p. 52. (Contributed by Thierry Arnoux, 30-Jul-2019.) |
| Ref | Expression |
|---|---|
| mirval.p | ⊢ 𝑃 = (Base‘𝐺) |
| mirval.d | ⊢ − = (dist‘𝐺) |
| mirval.i | ⊢ 𝐼 = (Itv‘𝐺) |
| mirval.l | ⊢ 𝐿 = (LineG‘𝐺) |
| mirval.s | ⊢ 𝑆 = (pInvG‘𝐺) |
| mirval.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| miduniq2.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| miduniq2.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| miduniq2.x | ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
| miduniq2.e | ⊢ (𝜑 → ((𝑆‘𝐴)‘((𝑆‘𝐵)‘𝑋)) = ((𝑆‘𝐵)‘((𝑆‘𝐴)‘𝑋))) |
| Ref | Expression |
|---|---|
| miduniq2 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Step | Hyp | Ref | 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 | miduniq2.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 8 | eqid 2763 | . . . . . 6 ⊢ (𝑆‘𝐵) = (𝑆‘𝐵) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | mirf 29165 | . . . . 5 ⊢ (𝜑 → (𝑆‘𝐵):𝑃⟶𝑃) |
| 10 | miduniq2.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 11 | 9, 10 | ffvelcdmd 7112 | . . . 4 ⊢ (𝜑 → ((𝑆‘𝐵)‘𝐴) ∈ 𝑃) |
| 12 | miduniq2.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
| 13 | eqid 2763 | . . . . . 6 ⊢ ((𝑆‘𝐵)‘𝐴) = ((𝑆‘𝐵)‘𝐴) | |
| 14 | eqid 2763 | . . . . . 6 ⊢ ((𝑆‘𝐵)‘((𝑆‘𝐵)‘𝑋)) = ((𝑆‘𝐵)‘((𝑆‘𝐵)‘𝑋)) | |
| 15 | eqid 2763 | . . . . . 6 ⊢ ((𝑆‘𝐵)‘((𝑆‘𝐵)‘((𝑆‘𝐴)‘𝑋))) = ((𝑆‘𝐵)‘((𝑆‘𝐵)‘((𝑆‘𝐴)‘𝑋))) | |
| 16 | 9, 12 | ffvelcdmd 7112 | . . . . . 6 ⊢ (𝜑 → ((𝑆‘𝐵)‘𝑋) ∈ 𝑃) |
| 17 | eqid 2763 | . . . . . . . 8 ⊢ (𝑆‘𝐴) = (𝑆‘𝐴) | |
| 18 | 1, 2, 3, 4, 5, 6, 10, 17, 12 | mircl 29166 | . . . . . . 7 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝑋) ∈ 𝑃) |
| 19 | 9, 18 | ffvelcdmd 7112 | . . . . . 6 ⊢ (𝜑 → ((𝑆‘𝐵)‘((𝑆‘𝐴)‘𝑋)) ∈ 𝑃) |
| 20 | miduniq2.e | . . . . . 6 ⊢ (𝜑 → ((𝑆‘𝐴)‘((𝑆‘𝐵)‘𝑋)) = ((𝑆‘𝐵)‘((𝑆‘𝐴)‘𝑋))) | |
| 21 | 1, 2, 3, 4, 5, 6, 8, 13, 14, 15, 7, 10, 16, 19, 20 | mirauto 29189 | . . . . 5 ⊢ (𝜑 → ((𝑆‘((𝑆‘𝐵)‘𝐴))‘((𝑆‘𝐵)‘((𝑆‘𝐵)‘𝑋))) = ((𝑆‘𝐵)‘((𝑆‘𝐵)‘((𝑆‘𝐴)‘𝑋)))) |
| 22 | 1, 2, 3, 4, 5, 6, 7, 8, 12 | mirmir 29167 | . . . . . 6 ⊢ (𝜑 → ((𝑆‘𝐵)‘((𝑆‘𝐵)‘𝑋)) = 𝑋) |
| 23 | 22 | fveq2d 6915 | . . . . 5 ⊢ (𝜑 → ((𝑆‘((𝑆‘𝐵)‘𝐴))‘((𝑆‘𝐵)‘((𝑆‘𝐵)‘𝑋))) = ((𝑆‘((𝑆‘𝐵)‘𝐴))‘𝑋)) |
| 24 | 1, 2, 3, 4, 5, 6, 7, 8, 18 | mirmir 29167 | . . . . 5 ⊢ (𝜑 → ((𝑆‘𝐵)‘((𝑆‘𝐵)‘((𝑆‘𝐴)‘𝑋))) = ((𝑆‘𝐴)‘𝑋)) |
| 25 | 21, 23, 24 | 3eqtr3d 2806 | . . . 4 ⊢ (𝜑 → ((𝑆‘((𝑆‘𝐵)‘𝐴))‘𝑋) = ((𝑆‘𝐴)‘𝑋)) |
| 26 | 1, 2, 3, 4, 5, 6, 11, 10, 12, 25 | miduniq1 29191 | . . 3 ⊢ (𝜑 → ((𝑆‘𝐵)‘𝐴) = 𝐴) |
| 27 | 1, 2, 3, 4, 5, 6, 7, 8, 10 | mirinv 29171 | . . 3 ⊢ (𝜑 → (((𝑆‘𝐵)‘𝐴) = 𝐴 ↔ 𝐵 = 𝐴)) |
| 28 | 26, 27 | mpbid 235 | . 2 ⊢ (𝜑 → 𝐵 = 𝐴) |
| 29 | 28 | eqcomd 2769 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ‘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-pow 5332 ax-pr 5396 ax-un 7778 ax-cnex 11286 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-nel 3066 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-pss 4017 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-tp 4593 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 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-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 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-oprab 7450 df-mpo 7451 df-om 7905 df-1st 8028 df-2nd 8029 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-1o 8507 df-oadd 8511 df-er 8748 df-pm 8881 df-en 9005 df-dom 9006 df-sdom 9007 df-fin 9008 df-dju 10012 df-card 10050 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-nn 12366 df-2 12435 df-3 12436 df-n0 12637 df-xnn0 12710 df-z 12724 df-uz 12996 df-fz 13670 df-fzo 13819 df-hash 14505 df-word 14689 df-concat 14746 df-s1 14773 df-s2 15030 df-s3 15031 df-trkgc 28943 df-trkgb 28944 df-trkgcb 28945 df-trkg 28948 df-cgrg 29007 df-mir 29158 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |