| 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 28531 | . . . . 5 ⊢ (𝜑 → (𝑃𝐿𝑄) ⊆ 𝐵) |
| 12 | 11 | sselda 3930 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ 𝐵) |
| 13 | 10 | necomd 2984 | . . . . 5 ⊢ (𝜑 → 𝑄 ≠ 𝑃) |
| 14 | 13 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑄 ≠ 𝑃) |
| 15 | simpr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ (𝑃𝐿𝑄)) | |
| 16 | 1, 2, 3, 5, 7, 9, 12, 14, 15 | lncom 28601 | . . 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 28531 | . . . . 5 ⊢ (𝜑 → (𝑄𝐿𝑃) ⊆ 𝐵) |
| 21 | 20 | sselda 3930 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑥 ∈ 𝐵) |
| 22 | 10 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑃 ≠ 𝑄) |
| 23 | simpr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑥 ∈ (𝑄𝐿𝑃)) | |
| 24 | 1, 2, 3, 17, 18, 19, 21, 22, 23 | lncom 28601 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑥 ∈ (𝑃𝐿𝑄)) |
| 25 | 16, 24 | impbida 800 | . 2 ⊢ (𝜑 → (𝑥 ∈ (𝑃𝐿𝑄) ↔ 𝑥 ∈ (𝑄𝐿𝑃))) |
| 26 | 25 | eqrdv 2731 | 1 ⊢ (𝜑 → (𝑃𝐿𝑄) = (𝑄𝐿𝑃)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2929 ‘cfv 6486 (class class class)co 7352 Basecbs 17122 TarskiGcstrkg 28406 Itvcitv 28412 LineGclng 28413 |
| 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 2705 ax-sep 5236 ax-nul 5246 ax-pr 5372 |
| 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 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-sbc 3738 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-br 5094 df-opab 5156 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-iota 6442 df-fun 6488 df-fv 6494 df-ov 7355 df-oprab 7356 df-mpo 7357 df-trkgc 28427 df-trkgb 28428 df-trkgcb 28429 df-trkg 28432 |
| This theorem is referenced by: tglinethru 28615 coltr3 28627 footeq 28703 colperpexlem3 28711 mideulem2 28713 opphllem 28714 midex 28716 opphllem3 28728 opphllem5 28730 lmicom 28767 lmiisolem 28775 lnperpex 28782 trgcopy 28783 |
| Copyright terms: Public domain | W3C validator |