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 28976

Description: Lemma for mideu 28978. 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 792	. . 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 738	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝐺 ∈ TarskiG)
8		mideu.s	. . . 4 ⊢ 𝑆 = (pInvG‘𝐺)
9		mideu.1	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
10	9	ad2antrr 738	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝐴 ∈ 𝑃)
11		mideu.2	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
12	11	ad2antrr 738	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝐵 ∈ 𝑃)
13		mideulem.1	. . . . 5 ⊢ (𝜑 → 𝐴 ≠ 𝐵)
14	13	ad2antrr 738	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝐴 ≠ 𝐵)
15		mideulem.2	. . . . 5 ⊢ (𝜑 → 𝑄 ∈ 𝑃)
16	15	ad2antrr 738	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑄 ∈ 𝑃)
17		mideulem.3	. . . . 5 ⊢ (𝜑 → 𝑂 ∈ 𝑃)
18	17	ad2antrr 738	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑂 ∈ 𝑃)
19		mideulem.4	. . . . 5 ⊢ (𝜑 → 𝑇 ∈ 𝑃)
20	19	ad2antrr 738	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑇 ∈ 𝑃)
21		mideulem.5	. . . . 5 ⊢ (𝜑 → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝑄𝐿𝐵))
22	21	ad2antrr 738	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝑄𝐿𝐵))
23		mideulem.6	. . . . 5 ⊢ (𝜑 → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝐴𝐿𝑂))
24	23	ad2antrr 738	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝐴𝐿𝑂))
25		mideulem.7	. . . . 5 ⊢ (𝜑 → 𝑇 ∈ (𝐴𝐿𝐵))
26	25	ad2antrr 738	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑇 ∈ (𝐴𝐿𝐵))
27		mideulem.8	. . . . 5 ⊢ (𝜑 → 𝑇 ∈ (𝑄𝐼𝑂))
28	27	ad2antrr 738	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑇 ∈ (𝑄𝐼𝑂))
29		simplr 780	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑟 ∈ 𝑃)
30		simprl 782	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → 𝑟 ∈ (𝐵𝐼𝑄))
31		simprr 784	. . . 4 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → (𝐴 − 𝑂) = (𝐵 − 𝑟))
32	2, 3, 4, 5, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 29, 30, 31	opphllem 28975	. . 3 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → ∃𝑥 ∈ 𝑃 (𝐵 = ((𝑆‘𝑥)‘𝐴) ∧ 𝑂 = ((𝑆‘𝑥)‘𝑟)))
33	1, 32	reximddv 3187	. 2 ⊢ (((𝜑 ∧ 𝑟 ∈ 𝑃) ∧ (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))) → ∃𝑥 ∈ 𝑃 𝐵 = ((𝑆‘𝑥)‘𝐴))
34		mideulem.9	. . 3 ⊢ (𝜑 → (𝐴 − 𝑂)(≤G‘𝐺)(𝐵 − 𝑄))
35		eqid 2769	. . . 4 ⊢ (≤G‘𝐺) = (≤G‘𝐺)
36	2, 3, 4, 35, 6, 9, 17, 11, 15	legov 28820	. . 3 ⊢ (𝜑 → ((𝐴 − 𝑂)(≤G‘𝐺)(𝐵 − 𝑄) ↔ ∃𝑟 ∈ 𝑃 (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟))))
37	34, 36	mpbid 235	. 2 ⊢ (𝜑 → ∃𝑟 ∈ 𝑃 (𝑟 ∈ (𝐵𝐼𝑄) ∧ (𝐴 − 𝑂) = (𝐵 − 𝑟)))
38	33, 37	r19.29a 3179	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 𝐵 = ((𝑆‘𝑥)‘𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∃wrex 3095 class class class wbr 5113 ‘cfv 6537 (class class class)co 7411 Basecbs 17269 distcds 17319 TarskiGcstrkg 28662 Itvcitv 28668 LineGclng 28669 ≤Gcleg 28817 pInvGcmir 28891 ⟂Gcperpg 28934

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-oadd 8457 df-er 8694 df-map 8826 df-pm 8827 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-dju 9887 df-card 9925 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-3 12304 df-n0 12505 df-xnn0 12578 df-z 12592 df-uz 12863 df-fz 13536 df-fzo 13683 df-hash 14367 df-word 14551 df-concat 14608 df-s1 14634 df-s2 14885 df-s3 14886 df-trkgc 28683 df-trkgb 28684 df-trkgcb 28685 df-trkg 28688 df-cgrg 28746 df-leg 28818 df-mir 28892 df-rag 28933 df-perpg 28935

This theorem is referenced by: midex 28977

W3C validator