| 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 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝐺 ∈ TarskiG) |
| 6 | tglineelsb2.2 | . . . . 5 ⊢ (𝜑 → 𝑄 ∈ 𝐵) | |
| 7 | 6 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑄 ∈ 𝐵) |
| 8 | tglineelsb2.1 | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ 𝐵) | |
| 9 | 8 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑃 ∈ 𝐵) |
| 10 | tglineelsb2.4 | . . . . . 6 ⊢ (𝜑 → 𝑃 ≠ 𝑄) | |
| 11 | 1, 3, 2, 4, 8, 6, 10 | tglnssp 28787 | . . . . 5 ⊢ (𝜑 → (𝑃𝐿𝑄) ⊆ 𝐵) |
| 12 | 11 | sselda 3945 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ 𝐵) |
| 13 | 10 | necomd 3019 | . . . . 5 ⊢ (𝜑 → 𝑄 ≠ 𝑃) |
| 14 | 13 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑄 ≠ 𝑃) |
| 15 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ (𝑃𝐿𝑄)) | |
| 16 | 1, 2, 3, 5, 7, 9, 12, 14, 15 | lncom 28857 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ (𝑄𝐿𝑃)) |
| 17 | 4 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝐺 ∈ TarskiG) |
| 18 | 8 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑃 ∈ 𝐵) |
| 19 | 6 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑄 ∈ 𝐵) |
| 20 | 1, 3, 2, 4, 6, 8, 13 | tglnssp 28787 | . . . . 5 ⊢ (𝜑 → (𝑄𝐿𝑃) ⊆ 𝐵) |
| 21 | 20 | sselda 3945 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑥 ∈ 𝐵) |
| 22 | 10 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑃 ≠ 𝑄) |
| 23 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑥 ∈ (𝑄𝐿𝑃)) | |
| 24 | 1, 2, 3, 17, 18, 19, 21, 22, 23 | lncom 28857 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑥 ∈ (𝑃𝐿𝑄)) |
| 25 | 16, 24 | impbida 812 | . 2 ⊢ (𝜑 → (𝑥 ∈ (𝑃𝐿𝑄) ↔ 𝑥 ∈ (𝑄𝐿𝑃))) |
| 26 | 25 | eqrdv 2767 | 1 ⊢ (𝜑 → (𝑃𝐿𝑄) = (𝑄𝐿𝑃)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ‘cfv 6537 (class class class)co 7411 Basecbs 17269 TarskiGcstrkg 28662 Itvcitv 28668 LineGclng 28669 |
| 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-sep 5261 ax-nul 5271 ax-pr 5405 |
| 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-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-trkgc 28683 df-trkgb 28684 df-trkgcb 28685 df-trkg 28688 |
| This theorem is referenced by: tglinethru 28871 coltr3 28884 footeq 28963 colperpexlem3 28972 mideulem2 28974 opphllem 28975 midex 28977 opphllem3 28989 opphllem5 28991 plngrotlem1 29027 plngrotlem2 29028 lnssplnglem 29031 lnssplng 29032 lmicom 29055 lmiisolem 29063 lnperpex 29070 trgcopy 29072 perpeqlem 29105 |
| Copyright terms: Public domain | W3C validator |