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 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝐺 ∈ TarskiG) |
6 | tglineelsb2.2 | . . . . 5 ⊢ (𝜑 → 𝑄 ∈ 𝐵) | |
7 | 6 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑄 ∈ 𝐵) |
8 | tglineelsb2.1 | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ 𝐵) | |
9 | 8 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑃 ∈ 𝐵) |
10 | tglineelsb2.4 | . . . . . 6 ⊢ (𝜑 → 𝑃 ≠ 𝑄) | |
11 | 1, 3, 2, 4, 8, 6, 10 | tglnssp 26338 | . . . . 5 ⊢ (𝜑 → (𝑃𝐿𝑄) ⊆ 𝐵) |
12 | 11 | sselda 3967 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ 𝐵) |
13 | 10 | necomd 3071 | . . . . 5 ⊢ (𝜑 → 𝑄 ≠ 𝑃) |
14 | 13 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑄 ≠ 𝑃) |
15 | simpr 487 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ (𝑃𝐿𝑄)) | |
16 | 1, 2, 3, 5, 7, 9, 12, 14, 15 | lncom 26408 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑃𝐿𝑄)) → 𝑥 ∈ (𝑄𝐿𝑃)) |
17 | 4 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝐺 ∈ TarskiG) |
18 | 8 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑃 ∈ 𝐵) |
19 | 6 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑄 ∈ 𝐵) |
20 | 1, 3, 2, 4, 6, 8, 13 | tglnssp 26338 | . . . . 5 ⊢ (𝜑 → (𝑄𝐿𝑃) ⊆ 𝐵) |
21 | 20 | sselda 3967 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑥 ∈ 𝐵) |
22 | 10 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑃 ≠ 𝑄) |
23 | simpr 487 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑥 ∈ (𝑄𝐿𝑃)) | |
24 | 1, 2, 3, 17, 18, 19, 21, 22, 23 | lncom 26408 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑄𝐿𝑃)) → 𝑥 ∈ (𝑃𝐿𝑄)) |
25 | 16, 24 | impbida 799 | . 2 ⊢ (𝜑 → (𝑥 ∈ (𝑃𝐿𝑄) ↔ 𝑥 ∈ (𝑄𝐿𝑃))) |
26 | 25 | eqrdv 2819 | 1 ⊢ (𝜑 → (𝑃𝐿𝑄) = (𝑄𝐿𝑃)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ≠ wne 3016 ‘cfv 6355 (class class class)co 7156 Basecbs 16483 TarskiGcstrkg 26216 Itvcitv 26222 LineGclng 26223 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-iota 6314 df-fun 6357 df-fv 6363 df-ov 7159 df-oprab 7160 df-mpo 7161 df-trkgc 26234 df-trkgb 26235 df-trkgcb 26236 df-trkg 26239 |
This theorem is referenced by: tglinethru 26422 coltr3 26434 footeq 26510 colperpexlem3 26518 mideulem2 26520 opphllem 26521 midex 26523 opphllem3 26535 opphllem5 26537 lmicom 26574 lmiisolem 26582 lnperpex 26589 trgcopy 26590 |
Copyright terms: Public domain | W3C validator |