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

Theorem lpni 27184
Description: For any line in a planar incidence geometry, there exists a point not on the line. (Contributed by Jeff Hankins, 15-Aug-2009.)
Hypothesis
Ref Expression
lpni.1 𝑃 = 𝐺
Assertion
Ref Expression
lpni ((𝐺 ∈ Plig ∧ 𝐿𝐺) → ∃𝑎𝑃 𝑎𝐿)
Distinct variable groups:   𝐺,𝑎   𝐿,𝑎   𝑃,𝑎

Proof of Theorem lpni
Dummy variables 𝑏 𝑐 𝑑 𝑙 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lpni.1 . . . 4 𝑃 = 𝐺
21tncp 27183 . . 3 (𝐺 ∈ Plig → ∃𝑏𝑃𝑐𝑃𝑑𝑃𝑙𝐺 ¬ (𝑏𝑙𝑐𝑙𝑑𝑙))
3 eleq2 2687 . . . . . . . . . 10 (𝑙 = 𝐿 → (𝑏𝑙𝑏𝐿))
4 eleq2 2687 . . . . . . . . . 10 (𝑙 = 𝐿 → (𝑐𝑙𝑐𝐿))
5 eleq2 2687 . . . . . . . . . 10 (𝑙 = 𝐿 → (𝑑𝑙𝑑𝐿))
63, 4, 53anbi123d 1396 . . . . . . . . 9 (𝑙 = 𝐿 → ((𝑏𝑙𝑐𝑙𝑑𝑙) ↔ (𝑏𝐿𝑐𝐿𝑑𝐿)))
76notbid 308 . . . . . . . 8 (𝑙 = 𝐿 → (¬ (𝑏𝑙𝑐𝑙𝑑𝑙) ↔ ¬ (𝑏𝐿𝑐𝐿𝑑𝐿)))
87rspccv 3292 . . . . . . 7 (∀𝑙𝐺 ¬ (𝑏𝑙𝑐𝑙𝑑𝑙) → (𝐿𝐺 → ¬ (𝑏𝐿𝑐𝐿𝑑𝐿)))
9 eleq1 2686 . . . . . . . . . . . 12 (𝑎 = 𝑏 → (𝑎𝐿𝑏𝐿))
109notbid 308 . . . . . . . . . . 11 (𝑎 = 𝑏 → (¬ 𝑎𝐿 ↔ ¬ 𝑏𝐿))
1110rspcev 3295 . . . . . . . . . 10 ((𝑏𝑃 ∧ ¬ 𝑏𝐿) → ∃𝑎𝑃 ¬ 𝑎𝐿)
1211ex 450 . . . . . . . . 9 (𝑏𝑃 → (¬ 𝑏𝐿 → ∃𝑎𝑃 ¬ 𝑎𝐿))
13 eleq1 2686 . . . . . . . . . . . 12 (𝑎 = 𝑐 → (𝑎𝐿𝑐𝐿))
1413notbid 308 . . . . . . . . . . 11 (𝑎 = 𝑐 → (¬ 𝑎𝐿 ↔ ¬ 𝑐𝐿))
1514rspcev 3295 . . . . . . . . . 10 ((𝑐𝑃 ∧ ¬ 𝑐𝐿) → ∃𝑎𝑃 ¬ 𝑎𝐿)
1615ex 450 . . . . . . . . 9 (𝑐𝑃 → (¬ 𝑐𝐿 → ∃𝑎𝑃 ¬ 𝑎𝐿))
17 eleq1 2686 . . . . . . . . . . . 12 (𝑎 = 𝑑 → (𝑎𝐿𝑑𝐿))
1817notbid 308 . . . . . . . . . . 11 (𝑎 = 𝑑 → (¬ 𝑎𝐿 ↔ ¬ 𝑑𝐿))
1918rspcev 3295 . . . . . . . . . 10 ((𝑑𝑃 ∧ ¬ 𝑑𝐿) → ∃𝑎𝑃 ¬ 𝑎𝐿)
2019ex 450 . . . . . . . . 9 (𝑑𝑃 → (¬ 𝑑𝐿 → ∃𝑎𝑃 ¬ 𝑎𝐿))
2112, 16, 203jaao 1393 . . . . . . . 8 ((𝑏𝑃𝑐𝑃𝑑𝑃) → ((¬ 𝑏𝐿 ∨ ¬ 𝑐𝐿 ∨ ¬ 𝑑𝐿) → ∃𝑎𝑃 ¬ 𝑎𝐿))
22 3ianor 1053 . . . . . . . 8 (¬ (𝑏𝐿𝑐𝐿𝑑𝐿) ↔ (¬ 𝑏𝐿 ∨ ¬ 𝑐𝐿 ∨ ¬ 𝑑𝐿))
23 df-nel 2894 . . . . . . . . 9 (𝑎𝐿 ↔ ¬ 𝑎𝐿)
2423rexbii 3034 . . . . . . . 8 (∃𝑎𝑃 𝑎𝐿 ↔ ∃𝑎𝑃 ¬ 𝑎𝐿)
2521, 22, 243imtr4g 285 . . . . . . 7 ((𝑏𝑃𝑐𝑃𝑑𝑃) → (¬ (𝑏𝐿𝑐𝐿𝑑𝐿) → ∃𝑎𝑃 𝑎𝐿))
268, 25syl9r 78 . . . . . 6 ((𝑏𝑃𝑐𝑃𝑑𝑃) → (∀𝑙𝐺 ¬ (𝑏𝑙𝑐𝑙𝑑𝑙) → (𝐿𝐺 → ∃𝑎𝑃 𝑎𝐿)))
27263expia 1264 . . . . 5 ((𝑏𝑃𝑐𝑃) → (𝑑𝑃 → (∀𝑙𝐺 ¬ (𝑏𝑙𝑐𝑙𝑑𝑙) → (𝐿𝐺 → ∃𝑎𝑃 𝑎𝐿))))
2827rexlimdv 3023 . . . 4 ((𝑏𝑃𝑐𝑃) → (∃𝑑𝑃𝑙𝐺 ¬ (𝑏𝑙𝑐𝑙𝑑𝑙) → (𝐿𝐺 → ∃𝑎𝑃 𝑎𝐿)))
2928rexlimivv 3029 . . 3 (∃𝑏𝑃𝑐𝑃𝑑𝑃𝑙𝐺 ¬ (𝑏𝑙𝑐𝑙𝑑𝑙) → (𝐿𝐺 → ∃𝑎𝑃 𝑎𝐿))
302, 29syl 17 . 2 (𝐺 ∈ Plig → (𝐿𝐺 → ∃𝑎𝑃 𝑎𝐿))
3130imp 445 1 ((𝐺 ∈ Plig ∧ 𝐿𝐺) → ∃𝑎𝑃 𝑎𝐿)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384  w3o 1035  w3a 1036   = wceq 1480  wcel 1987  wnel 2893  wral 2907  wrex 2908   cuni 4402  Pligcplig 27180
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-nel 2894  df-ral 2912  df-rex 2913  df-reu 2914  df-v 3188  df-uni 4403  df-plig 27181
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator