Metamath Proof Explorer


Theorem prlngmo2

Description: Playfair's axiom, without the restriction that the point X is outside of the line A . Theorem 12.11 of Schwabhauser p. 123. (Contributed by Thierry Arnoux, 13-Jul-2026)

Ref Expression
Hypotheses prlngmo2.p ⊢ P = Base G
prlngmo2.l ⊢ L = Line 𝒢 ⁡ G
prlngmo2.r No typesetting found for |- .|| = ( parlnG ` G ) with typecode |-
prlngmo2.g ⊢ φ → G ∈ 𝒢 Tarski
prlngmo2.a ⊢ φ → A ∈ ran ⁡ L
prlngmo2.x ⊢ φ → X ∈ P
prlngmo2.1 ⊢ φ → G ∈ 𝒢 Tarski E
Assertion prlngmo2 ⊢ φ → ∃* b ∈ ran ⁡ L A ∥ ˙ b ∧ X ∈ b

Proof

Step Hyp Ref Expression
1 prlngmo2.p ⊢ P = Base G
2 prlngmo2.l ⊢ L = Line 𝒢 ⁡ G
3 prlngmo2.r Could not format .|| = ( parlnG ` G ) : No typesetting found for |- .|| = ( parlnG ` G ) with typecode |-
4 prlngmo2.g ⊢ φ → G ∈ 𝒢 Tarski
5 prlngmo2.a ⊢ φ → A ∈ ran ⁡ L
6 prlngmo2.x ⊢ φ → X ∈ P
7 prlngmo2.1 ⊢ φ → G ∈ 𝒢 Tarski E
8 eqeq2 ⊢ a = A → b = a ↔ b = A
9 8 imbi2d ⊢ a = A → A ∥ ˙ b ∧ X ∈ b → b = a ↔ A ∥ ˙ b ∧ X ∈ b → b = A
10 9 ralbidv ⊢ a = A → ∀ b ∈ ran ⁡ L A ∥ ˙ b ∧ X ∈ b → b = a ↔ ∀ b ∈ ran ⁡ L A ∥ ˙ b ∧ X ∈ b → b = A
11 5 adantr ⊢ φ ∧ X ∈ A → A ∈ ran ⁡ L
12 4 ad5antr ⊢ φ ∧ X ∈ A ∧ b ∈ ran ⁡ L ∧ A ∥ ˙ b ∧ X ∈ b ∧ ¬ b = A → G ∈ 𝒢 Tarski
13 simpllr ⊢ φ ∧ X ∈ A ∧ b ∈ ran ⁡ L ∧ A ∥ ˙ b ∧ X ∈ b ∧ ¬ b = A → A ∥ ˙ b
14 simpr ⊢ φ ∧ X ∈ A ∧ b ∈ ran ⁡ L ∧ A ∥ ˙ b ∧ X ∈ b ∧ ¬ b = A → ¬ b = A
15 14 neqned ⊢ φ ∧ X ∈ A ∧ b ∈ ran ⁡ L ∧ A ∥ ˙ b ∧ X ∈ b ∧ ¬ b = A → b ≠ A
16 15 necomd ⊢ φ ∧ X ∈ A ∧ b ∈ ran ⁡ L ∧ A ∥ ˙ b ∧ X ∈ b ∧ ¬ b = A → A ≠ b
17 2 3 12 13 16 prlngin0 ⊢ φ ∧ X ∈ A ∧ b ∈ ran ⁡ L ∧ A ∥ ˙ b ∧ X ∈ b ∧ ¬ b = A → A ∩ b = ∅
18 simp-5r ⊢ φ ∧ X ∈ A ∧ b ∈ ran ⁡ L ∧ A ∥ ˙ b ∧ X ∈ b ∧ ¬ b = A → X ∈ A
19 simplr ⊢ φ ∧ X ∈ A ∧ b ∈ ran ⁡ L ∧ A ∥ ˙ b ∧ X ∈ b ∧ ¬ b = A → X ∈ b
20 18 19 elind ⊢ φ ∧ X ∈ A ∧ b ∈ ran ⁡ L ∧ A ∥ ˙ b ∧ X ∈ b ∧ ¬ b = A → X ∈ A ∩ b
21 20 ne0d ⊢ φ ∧ X ∈ A ∧ b ∈ ran ⁡ L ∧ A ∥ ˙ b ∧ X ∈ b ∧ ¬ b = A → A ∩ b ≠ ∅
22 21 neneqd ⊢ φ ∧ X ∈ A ∧ b ∈ ran ⁡ L ∧ A ∥ ˙ b ∧ X ∈ b ∧ ¬ b = A → ¬ A ∩ b = ∅
23 17 22 condan ⊢ φ ∧ X ∈ A ∧ b ∈ ran ⁡ L ∧ A ∥ ˙ b ∧ X ∈ b → b = A
24 23 expl ⊢ φ ∧ X ∈ A ∧ b ∈ ran ⁡ L → A ∥ ˙ b ∧ X ∈ b → b = A
25 24 ralrimiva ⊢ φ ∧ X ∈ A → ∀ b ∈ ran ⁡ L A ∥ ˙ b ∧ X ∈ b → b = A
26 10 11 25 rspcedvdw ⊢ φ ∧ X ∈ A → ∃ a ∈ ran ⁡ L ∀ b ∈ ran ⁡ L A ∥ ˙ b ∧ X ∈ b → b = a
27 nfv ⊢ Ⅎ a A ∥ ˙ b ∧ X ∈ b
28 27 rmo2i ⊢ ∃ a ∈ ran ⁡ L ∀ b ∈ ran ⁡ L A ∥ ˙ b ∧ X ∈ b → b = a → ∃* b ∈ ran ⁡ L A ∥ ˙ b ∧ X ∈ b
29 26 28 syl ⊢ φ ∧ X ∈ A → ∃* b ∈ ran ⁡ L A ∥ ˙ b ∧ X ∈ b
30 4 adantr ⊢ φ ∧ ¬ X ∈ A → G ∈ 𝒢 Tarski
31 5 adantr ⊢ φ ∧ ¬ X ∈ A → A ∈ ran ⁡ L
32 6 adantr ⊢ φ ∧ ¬ X ∈ A → X ∈ P
33 simpr ⊢ φ ∧ ¬ X ∈ A → ¬ X ∈ A
34 32 33 eldifd ⊢ φ ∧ ¬ X ∈ A → X ∈ P ∖ A
35 7 adantr ⊢ φ ∧ ¬ X ∈ A → G ∈ 𝒢 Tarski E
36 1 2 3 30 31 34 35 prlngmo ⊢ φ ∧ ¬ X ∈ A → ∃* b ∈ ran ⁡ L A ∥ ˙ b ∧ X ∈ b
37 29 36 pm2.61dan ⊢ φ → ∃* b ∈ ran ⁡ L A ∥ ˙ b ∧ X ∈ b