| 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 2760 | . . . . . 6 ⊢ (𝑆‘𝐵) = (𝑆‘𝐵) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | mirf 29138 | . . . . 5 ⊢ (𝜑 → (𝑆‘𝐵):𝑃⟶𝑃) |
| 10 | miduniq2.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 11 | 9, 10 | ffvelcdmd 7086 | . . . 4 ⊢ (𝜑 → ((𝑆‘𝐵)‘𝐴) ∈ 𝑃) |
| 12 | miduniq2.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
| 13 | eqid 2760 | . . . . . 6 ⊢ ((𝑆‘𝐵)‘𝐴) = ((𝑆‘𝐵)‘𝐴) | |
| 14 | eqid 2760 | . . . . . 6 ⊢ ((𝑆‘𝐵)‘((𝑆‘𝐵)‘𝑋)) = ((𝑆‘𝐵)‘((𝑆‘𝐵)‘𝑋)) | |
| 15 | eqid 2760 | . . . . . 6 ⊢ ((𝑆‘𝐵)‘((𝑆‘𝐵)‘((𝑆‘𝐴)‘𝑋))) = ((𝑆‘𝐵)‘((𝑆‘𝐵)‘((𝑆‘𝐴)‘𝑋))) | |
| 16 | 9, 12 | ffvelcdmd 7086 | . . . . . 6 ⊢ (𝜑 → ((𝑆‘𝐵)‘𝑋) ∈ 𝑃) |
| 17 | eqid 2760 | . . . . . . . 8 ⊢ (𝑆‘𝐴) = (𝑆‘𝐴) | |
| 18 | 1, 2, 3, 4, 5, 6, 10, 17, 12 | mircl 29139 | . . . . . . 7 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝑋) ∈ 𝑃) |
| 19 | 9, 18 | ffvelcdmd 7086 | . . . . . 6 ⊢ (𝜑 → ((𝑆‘𝐵)‘((𝑆‘𝐴)‘𝑋)) ∈ 𝑃) |
| 20 | miduniq2.e | . . . . . 6 ⊢ (𝜑 → ((𝑆‘𝐴)‘((𝑆‘𝐵)‘𝑋)) = ((𝑆‘𝐵)‘((𝑆‘𝐴)‘𝑋))) | |
| 21 | 1, 2, 3, 4, 5, 6, 8, 13, 14, 15, 7, 10, 16, 19, 20 | mirauto 29162 | . . . . 5 ⊢ (𝜑 → ((𝑆‘((𝑆‘𝐵)‘𝐴))‘((𝑆‘𝐵)‘((𝑆‘𝐵)‘𝑋))) = ((𝑆‘𝐵)‘((𝑆‘𝐵)‘((𝑆‘𝐴)‘𝑋)))) |
| 22 | 1, 2, 3, 4, 5, 6, 7, 8, 12 | mirmir 29140 | . . . . . 6 ⊢ (𝜑 → ((𝑆‘𝐵)‘((𝑆‘𝐵)‘𝑋)) = 𝑋) |
| 23 | 22 | fveq2d 6890 | . . . . 5 ⊢ (𝜑 → ((𝑆‘((𝑆‘𝐵)‘𝐴))‘((𝑆‘𝐵)‘((𝑆‘𝐵)‘𝑋))) = ((𝑆‘((𝑆‘𝐵)‘𝐴))‘𝑋)) |
| 24 | 1, 2, 3, 4, 5, 6, 7, 8, 18 | mirmir 29140 | . . . . 5 ⊢ (𝜑 → ((𝑆‘𝐵)‘((𝑆‘𝐵)‘((𝑆‘𝐴)‘𝑋))) = ((𝑆‘𝐴)‘𝑋)) |
| 25 | 21, 23, 24 | 3eqtr3d 2803 | . . . 4 ⊢ (𝜑 → ((𝑆‘((𝑆‘𝐵)‘𝐴))‘𝑋) = ((𝑆‘𝐴)‘𝑋)) |
| 26 | 1, 2, 3, 4, 5, 6, 11, 10, 12, 25 | miduniq1 29164 | . . 3 ⊢ (𝜑 → ((𝑆‘𝐵)‘𝐴) = 𝐴) |
| 27 | 1, 2, 3, 4, 5, 6, 7, 8, 10 | mirinv 29144 | . . 3 ⊢ (𝜑 → (((𝑆‘𝐵)‘𝐴) = 𝐴 ↔ 𝐵 = 𝐴)) |
| 28 | 26, 27 | mpbid 235 | . 2 ⊢ (𝜑 → 𝐵 = 𝐴) |
| 29 | 28 | eqcomd 2766 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 ‘cfv 6539 Basecbs 17393 distcds 17443 TarskiGcstrkg 28895 Itvcitv 28901 LineGclng 28902 pInvGcmir 29130 |
| 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-pow 5326 ax-pr 5390 ax-un 7752 ax-cnex 11260 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 ax-pre-mulgt0 11281 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-nel 3062 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-pss 4014 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-tp 4589 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 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-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-om 7879 df-1st 8002 df-2nd 8003 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-1o 8480 df-oadd 8484 df-er 8721 df-pm 8854 df-en 8978 df-dom 8979 df-sdom 8980 df-fin 8981 df-dju 9986 df-card 10024 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 df-sub 11547 df-neg 11548 df-nn 12340 df-2 12409 df-3 12410 df-n0 12611 df-xnn0 12684 df-z 12698 df-uz 12970 df-fz 13644 df-fzo 13793 df-hash 14479 df-word 14663 df-concat 14720 df-s1 14747 df-s2 15004 df-s3 15005 df-trkgc 28916 df-trkgb 28917 df-trkgcb 28918 df-trkg 28921 df-cgrg 28980 df-mir 29131 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |