Theorem prlngrcl2 29144

Description: Reverse closure for parallelism. (Contributed by Thierry Arnoux, 5-Jul-2026.)

Hypotheses

Ref	Expression
prlngin0.l	⊢ 𝐿 = (LineG‘𝐺)
prlngin0.p	⊢ ∥ = (parlnG‘𝐺)
prlngin0.g	⊢ (𝜑 → 𝐺 ∈ 𝑉)
prlngin0.1	⊢ (𝜑 → 𝐴 ∥ 𝐵)

Assertion

Ref	Expression
prlngrcl2	⊢ (𝜑 → 𝐵 ∈ ran 𝐿)

Proof of Theorem prlngrcl2

Dummy variable ℎ is distinct from all other variables.

Step	Hyp	Ref	Expression
1		prlngin0.1	. . 3 ⊢ (𝜑 → 𝐴 ∥ 𝐵)
2		prlngin0.l	. . . 4 ⊢ 𝐿 = (LineG‘𝐺)
3		eqid 2769	. . . 4 ⊢ (hlG‘𝐺) = (hlG‘𝐺)
4		prlngin0.p	. . . 4 ⊢ ∥ = (parlnG‘𝐺)
5		prlngin0.g	. . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝑉)
6	2, 3, 4, 5	brprlng 29139	. . 3 ⊢ (𝜑 → (𝐴 ∥ 𝐵 ↔ ((𝐴 ∈ ran 𝐿 ∧ 𝐵 ∈ ran 𝐿) ∧ (𝐴 = 𝐵 ∨ (∃ℎ ∈ ran (hlG‘𝐺)(𝐴 ⊆ ℎ ∧ 𝐵 ⊆ ℎ) ∧ (𝐴 ∩ 𝐵) = ∅)))))
7	1, 6	mpbid 235	. 2 ⊢ (𝜑 → ((𝐴 ∈ ran 𝐿 ∧ 𝐵 ∈ ran 𝐿) ∧ (𝐴 = 𝐵 ∨ (∃ℎ ∈ ran (hlG‘𝐺)(𝐴 ⊆ ℎ ∧ 𝐵 ⊆ ℎ) ∧ (𝐴 ∩ 𝐵) = ∅))))
8	7	simplrd 781	1 ⊢ (𝜑 → 𝐵 ∈ ran 𝐿)

Syntax hints:   → wi 4   ∧ wa 400   ∨ wo 860   = wceq 1567   ∈ wcel 2149  ∃wrex 3095   ∩ cin 3912   ⊆ wss 3913  ∅c0 4294   class class class wbr 5110  ran crn 5660  ‘cfv 6533  LineGclng 28665  hlGcplng 29009  parlnGcprlng 29137

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 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730

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 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6489  df-fun 6535  df-fv 6541  df-prlng 29138

This theorem is referenced by:  prlngpln3  29148