mideulem - Metamath Proof Explorer

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

Theorem mideulem 25849

Description: Lemma for mideu 25851. We can assume mideulem.9 "without loss of generality" (Contributed by Thierry Arnoux, 25-Nov-2019.)

**Hypotheses**
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‘𝐺)(𝐵 − 𝑄))

**Assertion**
Ref	Expression
mideulem	⊢ (𝜑 → ∃𝑥 ∈ 𝑃 𝐵 = ((𝑆‘𝑥)‘𝐴))

Distinct variable groups: 𝑥, − 𝑥,𝐴 𝑥,𝐵 𝑥,𝐼 𝑥,𝑂 𝑥,𝑃 𝑥,𝑄 𝑥,𝑇 𝜑,𝑥 Allowed substitution hints: 𝑆(𝑥) 𝐺(𝑥) 𝐿(𝑥)

Proof of Theorem mideulem Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simprrl 766	. . 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 705	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝐺 ∈ TarskiG)
8		mideu.s	. . . 4 ⊢ 𝑆 = (pInvG‘𝐺)
9		mideu.1	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
10	9	ad2antrr 705	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝐴 ∈ 𝑃)
11		mideu.2	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
12	11	ad2antrr 705	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝐵 ∈ 𝑃)
13		mideulem.1	. . . . 5 ⊢ (𝜑 → 𝐴 ≠ 𝐵)
14	13	ad2antrr 705	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝐴 ≠ 𝐵)
15		mideulem.2	. . . . 5 ⊢ (𝜑 → 𝑄 ∈ 𝑃)
16	15	ad2antrr 705	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑄 ∈ 𝑃)
17		mideulem.3	. . . . 5 ⊢ (𝜑 → 𝑂 ∈ 𝑃)
18	17	ad2antrr 705	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑂 ∈ 𝑃)
19		mideulem.4	. . . . 5 ⊢ (𝜑 → 𝑇 ∈ 𝑃)
20	19	ad2antrr 705	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑇 ∈ 𝑃)
21		mideulem.5	. . . . 5 ⊢ (𝜑 → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝑄𝐿𝐵))
22	21	ad2antrr 705	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝑄𝐿𝐵))
23		mideulem.6	. . . . 5 ⊢ (𝜑 → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝐴𝐿𝑂))
24	23	ad2antrr 705	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝐴𝐿𝑂))
25		mideulem.7	. . . . 5 ⊢ (𝜑 → 𝑇 ∈ (𝐴𝐿𝐵))
26	25	ad2antrr 705	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑇 ∈ (𝐴𝐿𝐵))
27		mideulem.8	. . . . 5 ⊢ (𝜑 → 𝑇 ∈ (𝑄𝐼𝑂))
28	27	ad2antrr 705	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑇 ∈ (𝑄𝐼𝑂))
29		simplr 752	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑟 ∈ 𝑃)
30		simprl 754	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑟 ∈ (𝐵𝐼𝑄))
31		simprr 756	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → (𝐴 − 𝑂) = (𝐵 − 𝑟))
32	2, 3, 4, 5, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 29, 30, 31	opphllem 25848	. . 3 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → ∃𝑥 ∈ 𝑃 (𝐵 = ((𝑆‘𝑥)‘𝐴) ∧ 𝑂 = ((𝑆‘𝑥)‘𝑟)))
33	1, 32	reximddv 3166	. 2 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → ∃𝑥 ∈ 𝑃 𝐵 = ((𝑆‘𝑥)‘𝐴))
34		mideulem.9	. . 3 ⊢ (𝜑 → (𝐴 − 𝑂)(≤G‘𝐺)(𝐵 − 𝑄))
35		eqid 2771	. . . 4 ⊢ (≤G‘𝐺) = (≤G‘𝐺)
36	2, 3, 4, 35, 6, 9, 17, 11, 15	legov 25701	. . 3 ⊢ (𝜑 → ((𝐴 − 𝑂)(≤G‘𝐺)(𝐵 − 𝑄) ↔ ∃𝑟 ∈ 𝑃 (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))))
37	34, 36	mpbid 222	. 2 ⊢ (𝜑 → ∃𝑟 ∈ 𝑃 (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟)))
38	33, 37	r19.29a 3226	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 𝐵 = ((𝑆‘𝑥)‘𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 382 = wceq 1631 ∈ wcel 2145 ≠ wne 2943 ∃wrex 3062 class class class wbr 4787 ‘cfv 6030 (class class class)co 6796 Basecbs 16064 distcds 16158 TarskiGcstrkg 25550 Itvcitv 25556 LineGclng 25557 ≤Gcleg 25698 pInvGcmir 25768 ⟂Gcperpg 25811

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-rep 4905 ax-sep 4916 ax-nul 4924 ax-pow 4975 ax-pr 5035 ax-un 7100 ax-cnex 10198 ax-resscn 10199 ax-1cn 10200 ax-icn 10201 ax-addcl 10202 ax-addrcl 10203 ax-mulcl 10204 ax-mulrcl 10205 ax-mulcom 10206 ax-addass 10207 ax-mulass 10208 ax-distr 10209 ax-i2m1 10210 ax-1ne0 10211 ax-1rid 10212 ax-rnegex 10213 ax-rrecex 10214 ax-cnre 10215 ax-pre-lttri 10216 ax-pre-lttrn 10217 ax-pre-ltadd 10218 ax-pre-mulgt0 10219

This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3or 1072 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-pss 3739 df-nul 4064 df-if 4227 df-pw 4300 df-sn 4318 df-pr 4320 df-tp 4322 df-op 4324 df-uni 4576 df-int 4613 df-iun 4657 df-br 4788 df-opab 4848 df-mpt 4865 df-tr 4888 df-id 5158 df-eprel 5163 df-po 5171 df-so 5172 df-fr 5209 df-we 5211 df-xp 5256 df-rel 5257 df-cnv 5258 df-co 5259 df-dm 5260 df-rn 5261 df-res 5262 df-ima 5263 df-pred 5822 df-ord 5868 df-on 5869 df-lim 5870 df-suc 5871 df-iota 5993 df-fun 6032 df-fn 6033 df-f 6034 df-f1 6035 df-fo 6036 df-f1o 6037 df-fv 6038 df-riota 6757 df-ov 6799 df-oprab 6800 df-mpt2 6801 df-om 7217 df-1st 7319 df-2nd 7320 df-wrecs 7563 df-recs 7625 df-rdg 7663 df-1o 7717 df-oadd 7721 df-er 7900 df-map 8015 df-pm 8016 df-en 8114 df-dom 8115 df-sdom 8116 df-fin 8117 df-card 8969 df-cda 9196 df-pnf 10282 df-mnf 10283 df-xr 10284 df-ltxr 10285 df-le 10286 df-sub 10474 df-neg 10475 df-nn 11227 df-2 11285 df-3 11286 df-n0 11500 df-xnn0 11571 df-z 11585 df-uz 11894 df-fz 12534 df-fzo 12674 df-hash 13322 df-word 13495 df-concat 13497 df-s1 13498 df-s2 13802 df-s3 13803 df-trkgc 25568 df-trkgb 25569 df-trkgcb 25570 df-trkg 25573 df-cgrg 25627 df-leg 25699 df-mir 25769 df-rag 25810 df-perpg 25812

This theorem is referenced by: midex 25850

W3C validator