| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prlngd | Structured version Visualization version GIF version | ||
| Description: Deduce parallelism between two lines 𝐴 and 𝐵. (Contributed by Thierry Arnoux, 18-Jun-2026.) |
| Ref | Expression |
|---|---|
| brprlng.l | ⊢ 𝐿 = (LineG‘𝐺) |
| brprlng.e | ⊢ 𝐸 = (hlG‘𝐺) |
| brprlng.p | ⊢ ∥ = (parlnG‘𝐺) |
| brprlng.g | ⊢ (𝜑 → 𝐺 ∈ 𝑉) |
| prlngd.a | ⊢ (𝜑 → 𝐴 ∈ ran 𝐿) |
| prlngd.b | ⊢ (𝜑 → 𝐵 ∈ ran 𝐿) |
| prlngd.h | ⊢ (𝜑 → 𝐻 ∈ ran 𝐸) |
| prlngd.1 | ⊢ (𝜑 → 𝐴 ⊆ 𝐻) |
| prlngd.2 | ⊢ (𝜑 → 𝐵 ⊆ 𝐻) |
| prlngd.3 | ⊢ (𝜑 → (𝐴 ∩ 𝐵) = ∅) |
| Ref | Expression |
|---|---|
| prlngd | ⊢ (𝜑 → 𝐴 ∥ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prlngd.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ ran 𝐿) | |
| 2 | prlngd.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ ran 𝐿) | |
| 3 | 1, 2 | jca 521 | . 2 ⊢ (𝜑 → (𝐴 ∈ ran 𝐿 ∧ 𝐵 ∈ ran 𝐿)) |
| 4 | sseq2 3939 | . . . . . 6 ⊢ (ℎ = 𝐻 → (𝐴 ⊆ ℎ ↔ 𝐴 ⊆ 𝐻)) | |
| 5 | sseq2 3939 | . . . . . 6 ⊢ (ℎ = 𝐻 → (𝐵 ⊆ ℎ ↔ 𝐵 ⊆ 𝐻)) | |
| 6 | 4, 5 | anbi12d 644 | . . . . 5 ⊢ (ℎ = 𝐻 → ((𝐴 ⊆ ℎ ∧ 𝐵 ⊆ ℎ) ↔ (𝐴 ⊆ 𝐻 ∧ 𝐵 ⊆ 𝐻))) |
| 7 | prlngd.h | . . . . 5 ⊢ (𝜑 → 𝐻 ∈ ran 𝐸) | |
| 8 | prlngd.1 | . . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ 𝐻) | |
| 9 | prlngd.2 | . . . . . 6 ⊢ (𝜑 → 𝐵 ⊆ 𝐻) | |
| 10 | 8, 9 | jca 521 | . . . . 5 ⊢ (𝜑 → (𝐴 ⊆ 𝐻 ∧ 𝐵 ⊆ 𝐻)) |
| 11 | 6, 7, 10 | rspcedvdw 3583 | . . . 4 ⊢ (𝜑 → ∃ℎ ∈ ran 𝐸(𝐴 ⊆ ℎ ∧ 𝐵 ⊆ ℎ)) |
| 12 | prlngd.3 | . . . 4 ⊢ (𝜑 → (𝐴 ∩ 𝐵) = ∅) | |
| 13 | 11, 12 | jca 521 | . . 3 ⊢ (𝜑 → (∃ℎ ∈ ran 𝐸(𝐴 ⊆ ℎ ∧ 𝐵 ⊆ ℎ) ∧ (𝐴 ∩ 𝐵) = ∅)) |
| 14 | 13 | olcd 888 | . 2 ⊢ (𝜑 → (𝐴 = 𝐵 ∨ (∃ℎ ∈ ran 𝐸(𝐴 ⊆ ℎ ∧ 𝐵 ⊆ ℎ) ∧ (𝐴 ∩ 𝐵) = ∅))) |
| 15 | brprlng.l | . . 3 ⊢ 𝐿 = (LineG‘𝐺) | |
| 16 | brprlng.e | . . 3 ⊢ 𝐸 = (hlG‘𝐺) | |
| 17 | brprlng.p | . . 3 ⊢ ∥ = (parlnG‘𝐺) | |
| 18 | brprlng.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑉) | |
| 19 | 15, 16, 17, 18 | brprlng 29473 | . 2 ⊢ (𝜑 → (𝐴 ∥ 𝐵 ↔ ((𝐴 ∈ ran 𝐿 ∧ 𝐵 ∈ ran 𝐿) ∧ (𝐴 = 𝐵 ∨ (∃ℎ ∈ ran 𝐸(𝐴 ⊆ ℎ ∧ 𝐵 ⊆ ℎ) ∧ (𝐴 ∩ 𝐵) = ∅))))) |
| 20 | 3, 14, 19 | mpbir2and 726 | 1 ⊢ (𝜑 → 𝐴 ∥ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2147 ∃wrex 3090 ⊆ wss 3900 ∩ cin 4092 ∅c0 4281 class class class wbr 5108 ran crn 5659 ‘cfv 6566 LineGclng 28953 hlGcplng 29308 parlnGcprlng 29471 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-iota 6520 df-fun 6568 df-fv 6574 df-prlng 29472 |
| This theorem is used by: perpprlng 29485 prlngplngtr 29494 prlnginn0 29495 |
| Copyright terms: Public domain | W3C validator |