MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  prlngd Structured version   Visualization version   GIF version

Theorem prlngd 29143
Description: Deduce parallelism between two lines 𝐴 and 𝐵. (Contributed by Thierry Arnoux, 18-Jun-2026.)
Hypotheses
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 (𝜑 → (𝐴𝐵) = ∅)
Assertion
Ref Expression
prlngd (𝜑𝐴 𝐵)

Proof of Theorem prlngd
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 prlngd.a . . 3 (𝜑𝐴 ∈ ran 𝐿)
2 prlngd.b . . 3 (𝜑𝐵 ∈ ran 𝐿)
31, 2jca 520 . 2 (𝜑 → (𝐴 ∈ ran 𝐿𝐵 ∈ ran 𝐿))
4 sseq2 3971 . . . . . 6 ( = 𝐻 → (𝐴𝐴𝐻))
5 sseq2 3971 . . . . . 6 ( = 𝐻 → (𝐵𝐵𝐻))
64, 5anbi12d 643 . . . . 5 ( = 𝐻 → ((𝐴𝐵) ↔ (𝐴𝐻𝐵𝐻)))
7 prlngd.h . . . . 5 (𝜑𝐻 ∈ ran 𝐸)
8 prlngd.1 . . . . . 6 (𝜑𝐴𝐻)
9 prlngd.2 . . . . . 6 (𝜑𝐵𝐻)
108, 9jca 520 . . . . 5 (𝜑 → (𝐴𝐻𝐵𝐻))
116, 7, 10rspcedvdw 3593 . . . 4 (𝜑 → ∃ ∈ ran 𝐸(𝐴𝐵))
12 prlngd.3 . . . 4 (𝜑 → (𝐴𝐵) = ∅)
1311, 12jca 520 . . 3 (𝜑 → (∃ ∈ ran 𝐸(𝐴𝐵) ∧ (𝐴𝐵) = ∅))
1413olcd 887 . 2 (𝜑 → (𝐴 = 𝐵 ∨ (∃ ∈ ran 𝐸(𝐴𝐵) ∧ (𝐴𝐵) = ∅)))
15 brprlng.l . . 3 𝐿 = (LineG‘𝐺)
16 brprlng.e . . 3 𝐸 = (hlG‘𝐺)
17 brprlng.p . . 3 = (parlnG‘𝐺)
18 brprlng.g . . 3 (𝜑𝐺𝑉)
1915, 16, 17, 18brprlng 29142 . 2 (𝜑 → (𝐴 𝐵 ↔ ((𝐴 ∈ ran 𝐿𝐵 ∈ ran 𝐿) ∧ (𝐴 = 𝐵 ∨ (∃ ∈ ran 𝐸(𝐴𝐵) ∧ (𝐴𝐵) = ∅)))))
203, 14, 19mpbir2and 725 1 (𝜑𝐴 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  wo 860   = wceq 1567  wcel 2149  wrex 3095  cin 3912  wss 3913  c0 4294   class class class wbr 5113  ran crn 5663  cfv 6537  LineGclng 28668  hlGcplng 29012  parlnGcprlng 29140
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-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  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-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-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-iota 6493  df-fun 6539  df-fv 6545  df-prlng 29141
This theorem is referenced by:  perpprlng  29152
  Copyright terms: Public domain W3C validator