| 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 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝐺 ∈ TarskiG) |
| 6 | tglineelsb2.2 | . . . . 5 ⊢ (𝜑 → 𝑄 ∈ 𝐵) | |
| 7 | 6 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑄 ∈ 𝐵) |
| 8 | tglineelsb2.1 | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ 𝐵) | |
| 9 | 8 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑃 ∈ 𝐵) |
| 10 | tglineelsb2.4 | . . . . . 6 ⊢ (𝜑 → 𝑃 ≠ 𝑄) | |
| 11 | 1, 3, 2, 4, 8, 6, 10 | tglnssp 28573 | . . . . 5 ⊢ (𝜑 → (𝑃𝐿𝑄) ⊆ 𝐵) |
| 12 | 11 | sselda 3931 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ 𝐵) |
| 13 | 10 | necomd 2985 | . . . . 5 ⊢ (𝜑 → 𝑄 ≠ 𝑃) |
| 14 | 13 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑄 ≠ 𝑃) |
| 15 | simpr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ (𝑃𝐿𝑄)) | |
| 16 | 1, 2, 3, 5, 7, 9, 12, 14, 15 | lncom 28643 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ (𝑄𝐿𝑃)) |
| 17 | 4 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝐺 ∈ TarskiG) |
| 18 | 8 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑃 ∈ 𝐵) |
| 19 | 6 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑄 ∈ 𝐵) |
| 20 | 1, 3, 2, 4, 6, 8, 13 | tglnssp 28573 | . . . . 5 ⊢ (𝜑 → (𝑄𝐿𝑃) ⊆ 𝐵) |
| 21 | 20 | sselda 3931 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑥 ∈ 𝐵) |
| 22 | 10 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑃 ≠ 𝑄) |
| 23 | simpr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑥 ∈ (𝑄𝐿𝑃)) | |
| 24 | 1, 2, 3, 17, 18, 19, 21, 22, 23 | lncom 28643 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑥 ∈ (𝑃𝐿𝑄)) |
| 25 | 16, 24 | impbida 800 | . 2 ⊢ (𝜑 → (𝑥 ∈ (𝑃𝐿𝑄) ↔ 𝑥 ∈ (𝑄𝐿𝑃))) |
| 26 | 25 | eqrdv 2732 | 1 ⊢ (𝜑 → (𝑃𝐿𝑄) = (𝑄𝐿𝑃)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 ‘cfv 6490 (class class class)co 7356 Basecbs 17134 TarskiGcstrkg 28448 Itvcitv 28454 LineGclng 28455 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-sbc 3739 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-iota 6446 df-fun 6492 df-fv 6498 df-ov 7359 df-oprab 7360 df-mpo 7361 df-trkgc 28469 df-trkgb 28470 df-trkgcb 28471 df-trkg 28474 |
| This theorem is referenced by: tglinethru 28657 coltr3 28669 footeq 28745 colperpexlem3 28753 mideulem2 28755 opphllem 28756 midex 28758 opphllem3 28770 opphllem5 28772 lmicom 28809 lmiisolem 28817 lnperpex 28824 trgcopy 28825 |
| Copyright terms: Public domain | W3C validator |