| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tglineelsb2 | Structured version Visualization version GIF version | ||
| Description: If 𝑆 lies on PQ , then PQ = PS . Theorem 6.16 of [Schwabhauser] p. 45. (Contributed by Thierry Arnoux, 17-May-2019.) |
| Ref | Expression |
|---|---|
| tglineelsb2.p | ⊢ 𝐵 = (Base‘𝐺) |
| tglineelsb2.i | ⊢ 𝐼 = (Itv‘𝐺) |
| tglineelsb2.l | ⊢ 𝐿 = (LineG‘𝐺) |
| tglineelsb2.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| tglineelsb2.1 | ⊢ (𝜑 → 𝑃 ∈ 𝐵) |
| tglineelsb2.2 | ⊢ (𝜑 → 𝑄 ∈ 𝐵) |
| tglineelsb2.4 | ⊢ (𝜑 → 𝑃 ≠ 𝑄) |
| tglineelsb2.3 | ⊢ (𝜑 → 𝑆 ∈ 𝐵) |
| tglineelsb2.5 | ⊢ (𝜑 → 𝑆 ≠ 𝑃) |
| tglineelsb2.6 | ⊢ (𝜑 → 𝑆 ∈ (𝑃𝐿𝑄)) |
| Ref | Expression |
|---|---|
| tglineelsb2 | ⊢ (𝜑 → (𝑃𝐿𝑄) = (𝑃𝐿𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tglineelsb2.p | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | tglineelsb2.i | . . . 4 ⊢ 𝐼 = (Itv‘𝐺) | |
| 3 | tglineelsb2.l | . . . 4 ⊢ 𝐿 = (LineG‘𝐺) | |
| 4 | tglineelsb2.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 5 | 4 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝐺 ∈ TarskiG) |
| 6 | tglineelsb2.1 | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ 𝐵) | |
| 7 | 6 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑃 ∈ 𝐵) |
| 8 | tglineelsb2.3 | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝐵) | |
| 9 | 8 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑆 ∈ 𝐵) |
| 10 | tglineelsb2.5 | . . . . . 6 ⊢ (𝜑 → 𝑆 ≠ 𝑃) | |
| 11 | 10 | necomd 3010 | . . . . 5 ⊢ (𝜑 → 𝑃 ≠ 𝑆) |
| 12 | 11 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑃 ≠ 𝑆) |
| 13 | tglineelsb2.2 | . . . . 5 ⊢ (𝜑 → 𝑄 ∈ 𝐵) | |
| 14 | 13 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑄 ∈ 𝐵) |
| 15 | tglineelsb2.4 | . . . . . 6 ⊢ (𝜑 → 𝑃 ≠ 𝑄) | |
| 16 | 15 | necomd 3010 | . . . . 5 ⊢ (𝜑 → 𝑄 ≠ 𝑃) |
| 17 | 16 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑄 ≠ 𝑃) |
| 18 | tglineelsb2.6 | . . . . . . 7 ⊢ (𝜑 → 𝑆 ∈ (𝑃𝐿𝑄)) | |
| 19 | 18 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑆 ∈ (𝑃𝐿𝑄)) |
| 20 | 1, 2, 3, 5, 14, 7, 9, 17, 19 | lncom 29090 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑆 ∈ (𝑄𝐿𝑃)) |
| 21 | 1, 2, 3, 5, 7, 9, 14, 12, 20, 17 | lnrot1 29091 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑄 ∈ (𝑃𝐿𝑆)) |
| 22 | 1, 3, 2, 4, 6, 13, 15 | tglnssp 29015 | . . . . 5 ⊢ (𝜑 → (𝑃𝐿𝑄) ⊆ 𝐵) |
| 23 | 22 | sselda 3908 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ 𝐵) |
| 24 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ (𝑃𝐿𝑄)) | |
| 25 | 1, 2, 3, 5, 7, 9, 12, 14, 17, 21, 23, 24 | tglineeltr 29099 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ (𝑃𝐿𝑆)) |
| 26 | 4 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑆)) → 𝐺 ∈ TarskiG) |
| 27 | 6 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑆)) → 𝑃 ∈ 𝐵) |
| 28 | 13 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑆)) → 𝑄 ∈ 𝐵) |
| 29 | 15 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑆)) → 𝑃 ≠ 𝑄) |
| 30 | 8 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑆)) → 𝑆 ∈ 𝐵) |
| 31 | 10 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑆)) → 𝑆 ≠ 𝑃) |
| 32 | 18 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑆)) → 𝑆 ∈ (𝑃𝐿𝑄)) |
| 33 | 1, 3, 2, 4, 6, 8, 11 | tglnssp 29015 | . . . . 5 ⊢ (𝜑 → (𝑃𝐿𝑆) ⊆ 𝐵) |
| 34 | 33 | sselda 3908 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑆)) → 𝑥 ∈ 𝐵) |
| 35 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑆)) → 𝑥 ∈ (𝑃𝐿𝑆)) | |
| 36 | 1, 2, 3, 26, 27, 28, 29, 30, 31, 32, 34, 35 | tglineeltr 29099 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑆)) → 𝑥 ∈ (𝑃𝐿𝑄)) |
| 37 | 25, 36 | impbida 813 | . 2 ⊢ (𝜑 → (𝑥 ∈ (𝑃𝐿𝑄) ↔ 𝑥 ∈ (𝑃𝐿𝑆))) |
| 38 | 37 | eqrdv 2758 | 1 ⊢ (𝜑 → (𝑃𝐿𝑄) = (𝑃𝐿𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ‘cfv 6538 (class class class)co 7420 Basecbs 17387 TarskiGcstrkg 28889 Itvcitv 28895 LineGclng 28896 |
| 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 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| 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-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 4584 df-pr 4586 df-tp 4588 df-op 4590 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 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-oadd 8480 df-er 8717 df-pm 8850 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-dju 9982 df-card 10020 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-2 12405 df-3 12406 df-n0 12607 df-xnn0 12680 df-z 12694 df-uz 12966 df-fz 13640 df-fzo 13789 df-hash 14475 df-word 14659 df-concat 14716 df-s1 14743 df-s2 14999 df-s3 15000 df-trkgc 28910 df-trkgb 28911 df-trkgcb 28912 df-trkg 28915 df-cgrg 28974 |
| This theorem is used by: tglinethru 29104 ncolncol 29115 coltr3 29117 hlperpnel 29201 colperpexlem3 29208 mideulem2 29210 plngrotlem1 29265 plngrotlem2 29266 lmieu 29289 lmiisolem 29301 perpeq 29348 tgaaddcpbllem2 29350 prlngsymquadopp 29443 morleylemrneab 35300 |
| Copyright terms: Public domain | W3C validator |