| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mideulem | Structured version Visualization version GIF version | ||
| Description: Lemma for mideu 28641. We can assume mideulem.9 "without loss of generality". (Contributed by Thierry Arnoux, 25-Nov-2019.) |
| Ref | Expression |
|---|---|
| colperpex.p | ⊢ 𝑃 = (Base‘𝐺) |
| colperpex.d | ⊢ − = (dist‘𝐺) |
| colperpex.i | ⊢ 𝐼 = (Itv‘𝐺) |
| colperpex.l | ⊢ 𝐿 = (LineG‘𝐺) |
| colperpex.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| mideu.s | ⊢ 𝑆 = (pInvG‘𝐺) |
| mideu.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| mideu.2 | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| mideulem.1 | ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
| mideulem.2 | ⊢ (𝜑 → 𝑄 ∈ 𝑃) |
| mideulem.3 | ⊢ (𝜑 → 𝑂 ∈ 𝑃) |
| mideulem.4 | ⊢ (𝜑 → 𝑇 ∈ 𝑃) |
| mideulem.5 | ⊢ (𝜑 → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝑄𝐿𝐵)) |
| mideulem.6 | ⊢ (𝜑 → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝐴𝐿𝑂)) |
| mideulem.7 | ⊢ (𝜑 → 𝑇 ∈ (𝐴𝐿𝐵)) |
| mideulem.8 | ⊢ (𝜑 → 𝑇 ∈ (𝑄𝐼𝑂)) |
| mideulem.9 | ⊢ (𝜑 → (𝐴 − 𝑂)(≤G‘𝐺)(𝐵 − 𝑄)) |
| Ref | Expression |
|---|---|
| mideulem | ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 𝐵 = ((𝑆‘𝑥)‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simprrl 780 | . . 3 ⊢ ((((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) ∧ (𝑥 ∈ 𝑃 ∧ (𝐵 = ((𝑆‘𝑥)‘𝐴) ∧ 𝑂 = ((𝑆‘𝑥)‘𝑟)))) → 𝐵 = ((𝑆‘𝑥)‘𝐴)) | |
| 2 | colperpex.p | . . . 4 ⊢ 𝑃 = (Base‘𝐺) | |
| 3 | colperpex.d | . . . 4 ⊢ − = (dist‘𝐺) | |
| 4 | colperpex.i | . . . 4 ⊢ 𝐼 = (Itv‘𝐺) | |
| 5 | colperpex.l | . . . 4 ⊢ 𝐿 = (LineG‘𝐺) | |
| 6 | colperpex.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 7 | 6 | ad2antrr 726 | . . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝐺 ∈ TarskiG) |
| 8 | mideu.s | . . . 4 ⊢ 𝑆 = (pInvG‘𝐺) | |
| 9 | mideu.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 10 | 9 | ad2antrr 726 | . . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝐴 ∈ 𝑃) |
| 11 | mideu.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 12 | 11 | ad2antrr 726 | . . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝐵 ∈ 𝑃) |
| 13 | mideulem.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ≠ 𝐵) | |
| 14 | 13 | ad2antrr 726 | . . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝐴 ≠ 𝐵) |
| 15 | mideulem.2 | . . . . 5 ⊢ (𝜑 → 𝑄 ∈ 𝑃) | |
| 16 | 15 | ad2antrr 726 | . . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑄 ∈ 𝑃) |
| 17 | mideulem.3 | . . . . 5 ⊢ (𝜑 → 𝑂 ∈ 𝑃) | |
| 18 | 17 | ad2antrr 726 | . . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑂 ∈ 𝑃) |
| 19 | mideulem.4 | . . . . 5 ⊢ (𝜑 → 𝑇 ∈ 𝑃) | |
| 20 | 19 | ad2antrr 726 | . . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑇 ∈ 𝑃) |
| 21 | mideulem.5 | . . . . 5 ⊢ (𝜑 → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝑄𝐿𝐵)) | |
| 22 | 21 | ad2antrr 726 | . . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝑄𝐿𝐵)) |
| 23 | mideulem.6 | . . . . 5 ⊢ (𝜑 → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝐴𝐿𝑂)) | |
| 24 | 23 | ad2antrr 726 | . . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝐴𝐿𝑂)) |
| 25 | mideulem.7 | . . . . 5 ⊢ (𝜑 → 𝑇 ∈ (𝐴𝐿𝐵)) | |
| 26 | 25 | ad2antrr 726 | . . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑇 ∈ (𝐴𝐿𝐵)) |
| 27 | mideulem.8 | . . . . 5 ⊢ (𝜑 → 𝑇 ∈ (𝑄𝐼𝑂)) | |
| 28 | 27 | ad2antrr 726 | . . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑇 ∈ (𝑄𝐼𝑂)) |
| 29 | simplr 768 | . . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑟 ∈ 𝑃) | |
| 30 | simprl 770 | . . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑟 ∈ (𝐵𝐼𝑄)) | |
| 31 | simprr 772 | . . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → (𝐴 − 𝑂) = (𝐵 − 𝑟)) | |
| 32 | 2, 3, 4, 5, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 29, 30, 31 | opphllem 28638 | . . 3 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → ∃𝑥 ∈ 𝑃 (𝐵 = ((𝑆‘𝑥)‘𝐴) ∧ 𝑂 = ((𝑆‘𝑥)‘𝑟))) |
| 33 | 1, 32 | reximddv 3149 | . 2 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → ∃𝑥 ∈ 𝑃 𝐵 = ((𝑆‘𝑥)‘𝐴)) |
| 34 | mideulem.9 | . . 3 ⊢ (𝜑 → (𝐴 − 𝑂)(≤G‘𝐺)(𝐵 − 𝑄)) | |
| 35 | eqid 2729 | . . . 4 ⊢ (≤G‘𝐺) = (≤G‘𝐺) | |
| 36 | 2, 3, 4, 35, 6, 9, 17, 11, 15 | legov 28488 | . . 3 ⊢ (𝜑 → ((𝐴 − 𝑂)(≤G‘𝐺)(𝐵 − 𝑄) ↔ ∃𝑟 ∈ 𝑃 (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟)))) |
| 37 | 34, 36 | mpbid 232 | . 2 ⊢ (𝜑 → ∃𝑟 ∈ 𝑃 (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) |
| 38 | 33, 37 | r19.29a 3141 | 1 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 𝐵 = ((𝑆‘𝑥)‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∃wrex 3053 class class class wbr 5102 ‘cfv 6499 (class class class)co 7369 Basecbs 17155 distcds 17205 TarskiGcstrkg 28330 Itvcitv 28336 LineGclng 28337 ≤Gcleg 28485 pInvGcmir 28555 ⟂Gcperpg 28598 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-oadd 8415 df-er 8648 df-map 8778 df-pm 8779 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-dju 9830 df-card 9868 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-nn 12163 df-2 12225 df-3 12226 df-n0 12419 df-xnn0 12492 df-z 12506 df-uz 12770 df-fz 13445 df-fzo 13592 df-hash 14272 df-word 14455 df-concat 14512 df-s1 14537 df-s2 14790 df-s3 14791 df-trkgc 28351 df-trkgb 28352 df-trkgcb 28353 df-trkg 28356 df-cgrg 28414 df-leg 28486 df-mir 28556 df-rag 28597 df-perpg 28599 |
| This theorem is referenced by: midex 28640 |
| Copyright terms: Public domain | W3C validator |