| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tglinecom | Structured version Visualization version GIF version | ||
| Description: Commutativity law for lines. Part of theorem 6.17 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 | ⊢ (𝜑 → 𝑃 ≠ 𝑄) |
| Ref | Expression |
|---|---|
| tglinecom | ⊢ (𝜑 → (𝑃𝐿𝑄) = (𝑄𝐿𝑃)) |
| 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.2 | . . . . 5 ⊢ (𝜑 → 𝑄 ∈ 𝐵) | |
| 7 | 6 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑄 ∈ 𝐵) |
| 8 | tglineelsb2.1 | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ 𝐵) | |
| 9 | 8 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑃 ∈ 𝐵) |
| 10 | tglineelsb2.4 | . . . . . 6 ⊢ (𝜑 → 𝑃 ≠ 𝑄) | |
| 11 | 1, 3, 2, 4, 8, 6, 10 | tglnssp 29015 | . . . . 5 ⊢ (𝜑 → (𝑃𝐿𝑄) ⊆ 𝐵) |
| 12 | 11 | sselda 3931 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ 𝐵) |
| 13 | 10 | necomd 3011 | . . . . 5 ⊢ (𝜑 → 𝑄 ≠ 𝑃) |
| 14 | 13 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑄 ≠ 𝑃) |
| 15 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ (𝑃𝐿𝑄)) | |
| 16 | 1, 2, 3, 5, 7, 9, 12, 14, 15 | lncom 29090 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ (𝑄𝐿𝑃)) |
| 17 | 4 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝐺 ∈ TarskiG) |
| 18 | 8 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑃 ∈ 𝐵) |
| 19 | 6 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑄 ∈ 𝐵) |
| 20 | 1, 3, 2, 4, 6, 8, 13 | tglnssp 29015 | . . . . 5 ⊢ (𝜑 → (𝑄𝐿𝑃) ⊆ 𝐵) |
| 21 | 20 | sselda 3931 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑥 ∈ 𝐵) |
| 22 | 10 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑃 ≠ 𝑄) |
| 23 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑥 ∈ (𝑄𝐿𝑃)) | |
| 24 | 1, 2, 3, 17, 18, 19, 21, 22, 23 | lncom 29090 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑥 ∈ (𝑃𝐿𝑄)) |
| 25 | 16, 24 | impbida 813 | . 2 ⊢ (𝜑 → (𝑥 ∈ (𝑃𝐿𝑄) ↔ 𝑥 ∈ (𝑄𝐿𝑃))) |
| 26 | 25 | eqrdv 2759 | 1 ⊢ (𝜑 → (𝑃𝐿𝑄) = (𝑄𝐿𝑃)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ‘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 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6494 df-fun 6540 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-trkgc 28910 df-trkgb 28911 df-trkgcb 28912 df-trkg 28915 |
| This theorem is used by: tglinethru 29104 coltr3 29117 symquadprlnglem 29165 footeq 29199 colperpexlem3 29208 mideulem2 29210 opphllem 29211 midex 29213 opphllem3 29225 opphllem5 29227 plngrotlem1 29265 plngrotlem2 29266 lnssplnglem 29269 lnssplng 29270 lmicom 29293 lmiisolem 29301 symquadmid 29304 lnperpex 29309 trgcopy 29311 perpeqlem 29347 tgaaddcpbllem1 29349 tgaaddcpbl 29352 angmgmaddeu1 29379 prlngmid2 29439 symquadprlng 29440 prlngsymquadlem 29441 prlngsymquadopp 29443 quadcgrprlng 29444 tgaltai 29445 |
| Copyright terms: Public domain | W3C validator |