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

Theorem plngval 29016
Description: The plane defined by a line 𝐴 and a point 𝑅 outside of 𝐴. This is defined as the union of 3 parts: the line itself, the open half-plane containing 𝑅, and the points opposite to 𝑅 (see islnopp 28978). (Contributed by Thierry Arnoux, 17-Jun-2026.)
Hypotheses
Ref Expression
plngval.p 𝑃 = (Base‘𝐺)
plngval.i 𝐼 = (Itv‘𝐺)
plngval.1 𝐿 = (LineG‘𝐺)
plngval.e 𝐸 = (hlG‘𝐺)
plngval.g (𝜑𝐺 ∈ TarskiG)
plngval.a (𝜑𝐴 ∈ ran 𝐿)
plngval.r (𝜑𝑅 ∈ (𝑃𝐴))
Assertion
Ref Expression
plngval (𝜑 → (𝐴𝐸𝑅) = {𝑥𝑃 ∣ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))})
Distinct variable groups:   𝑡,𝐴,𝑥   𝑡,𝐺,𝑥   𝑥,𝑃   𝑡,𝑅,𝑥   𝜑,𝑡,𝑥
Allowed substitution hints:   𝑃(𝑡)   𝐸(𝑥,𝑡)   𝐼(𝑥,𝑡)   𝐿(𝑥,𝑡)

Proof of Theorem plngval
Dummy variables 𝑎 𝑟 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 plngval.e . . 3 𝐸 = (hlG‘𝐺)
2 df-plng 29013 . . . 4 hlG = (𝑔 ∈ V ↦ (𝑎 ∈ ran (LineG‘𝑔), 𝑟 ∈ ((Base‘𝑔) ∖ 𝑎) ↦ {𝑥 ∈ (Base‘𝑔) ∣ (𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))}))
3 fveq2 6882 . . . . . . 7 (𝑔 = 𝐺 → (LineG‘𝑔) = (LineG‘𝐺))
4 plngval.1 . . . . . . 7 𝐿 = (LineG‘𝐺)
53, 4eqtr4di 2822 . . . . . 6 (𝑔 = 𝐺 → (LineG‘𝑔) = 𝐿)
65rneqd 5929 . . . . 5 (𝑔 = 𝐺 → ran (LineG‘𝑔) = ran 𝐿)
7 fveq2 6882 . . . . . . 7 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
8 plngval.p . . . . . . 7 𝑃 = (Base‘𝐺)
97, 8eqtr4di 2822 . . . . . 6 (𝑔 = 𝐺 → (Base‘𝑔) = 𝑃)
109difeq1d 4088 . . . . 5 (𝑔 = 𝐺 → ((Base‘𝑔) ∖ 𝑎) = (𝑃𝑎))
11 biidd 265 . . . . . . 7 (𝑔 = 𝐺 → (𝑥𝑎𝑥𝑎))
12 fveq2 6882 . . . . . . . . 9 (𝑔 = 𝐺 → (hpG‘𝑔) = (hpG‘𝐺))
1312fveq1d 6884 . . . . . . . 8 (𝑔 = 𝐺 → ((hpG‘𝑔)‘𝑎) = ((hpG‘𝐺)‘𝑎))
1413breqd 5124 . . . . . . 7 (𝑔 = 𝐺 → (𝑥((hpG‘𝑔)‘𝑎)𝑟𝑥((hpG‘𝐺)‘𝑎)𝑟))
15 fveq2 6882 . . . . . . . . . . 11 (𝑔 = 𝐺 → (Itv‘𝑔) = (Itv‘𝐺))
16 plngval.i . . . . . . . . . . 11 𝐼 = (Itv‘𝐺)
1715, 16eqtr4di 2822 . . . . . . . . . 10 (𝑔 = 𝐺 → (Itv‘𝑔) = 𝐼)
1817oveqd 7428 . . . . . . . . 9 (𝑔 = 𝐺 → (𝑥(Itv‘𝑔)𝑟) = (𝑥𝐼𝑟))
1918eleq2d 2855 . . . . . . . 8 (𝑔 = 𝐺 → (𝑡 ∈ (𝑥(Itv‘𝑔)𝑟) ↔ 𝑡 ∈ (𝑥𝐼𝑟)))
2019rexbidv 3195 . . . . . . 7 (𝑔 = 𝐺 → (∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟) ↔ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟)))
2111, 14, 203orbi123d 1461 . . . . . 6 (𝑔 = 𝐺 → ((𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟)) ↔ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))))
229, 21rabeqbidv 3441 . . . . 5 (𝑔 = 𝐺 → {𝑥 ∈ (Base‘𝑔) ∣ (𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))} = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))})
236, 10, 22mpoeq123dv 7486 . . . 4 (𝑔 = 𝐺 → (𝑎 ∈ ran (LineG‘𝑔), 𝑟 ∈ ((Base‘𝑔) ∖ 𝑎) ↦ {𝑥 ∈ (Base‘𝑔) ∣ (𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))}) = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
24 plngval.g . . . . 5 (𝜑𝐺 ∈ TarskiG)
2524elexd 3486 . . . 4 (𝜑𝐺 ∈ V)
264fvexi 6896 . . . . . . 7 𝐿 ∈ V
2726rnex 7906 . . . . . 6 ran 𝐿 ∈ V
2827a1i 11 . . . . 5 (𝜑 → ran 𝐿 ∈ V)
298fvexi 6896 . . . . . . 7 𝑃 ∈ V
3029difexi 5301 . . . . . 6 (𝑃𝑎) ∈ V
3130a1i 11 . . . . 5 ((𝜑𝑎 ∈ ran 𝐿) → (𝑃𝑎) ∈ V)
3228, 31mpoexd 8076 . . . 4 (𝜑 → (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}) ∈ V)
332, 23, 25, 32fvmptd3 7014 . . 3 (𝜑 → (hlG‘𝐺) = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
341, 33eqtrid 2816 . 2 (𝜑𝐸 = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
35 plngval.a . . 3 (𝜑𝐴 ∈ ran 𝐿)
36 plngval.r . . . . 5 (𝜑𝑅 ∈ (𝑃𝐴))
3736adantr 485 . . . 4 ((𝜑𝑎 = 𝐴) → 𝑅 ∈ (𝑃𝐴))
38 difeq2 4083 . . . . 5 (𝑎 = 𝐴 → (𝑃𝑎) = (𝑃𝐴))
3938adantl 486 . . . 4 ((𝜑𝑎 = 𝐴) → (𝑃𝑎) = (𝑃𝐴))
4037, 39eleqtrrd 2872 . . 3 ((𝜑𝑎 = 𝐴) → 𝑅 ∈ (𝑃𝑎))
41 eqid 2769 . . . 4 {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}
4229a1i 11 . . . 4 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑃 ∈ V)
4341, 42rabexd 5311 . . 3 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} ∈ V)
44 eleq2w2 2765 . . . . . 6 (𝑎 = 𝐴 → (𝑥𝑎𝑥𝐴))
4544ad2antrl 740 . . . . 5 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑥𝑎𝑥𝐴))
46 eqidd 2770 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑥 = 𝑥)
47 fveq2 6882 . . . . . . 7 (𝑎 = 𝐴 → ((hpG‘𝐺)‘𝑎) = ((hpG‘𝐺)‘𝐴))
4847ad2antrl 740 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → ((hpG‘𝐺)‘𝑎) = ((hpG‘𝐺)‘𝐴))
49 simprr 784 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑟 = 𝑅)
5046, 48, 49breq123d 5127 . . . . 5 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑥((hpG‘𝐺)‘𝑎)𝑟𝑥((hpG‘𝐺)‘𝐴)𝑅))
51 simprl 782 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑎 = 𝐴)
5249oveq2d 7427 . . . . . . 7 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑥𝐼𝑟) = (𝑥𝐼𝑅))
5352eleq2d 2855 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑡 ∈ (𝑥𝐼𝑟) ↔ 𝑡 ∈ (𝑥𝐼𝑅)))
5451, 53rexeqbidv 3346 . . . . 5 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟) ↔ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅)))
5545, 50, 543orbi123d 1461 . . . 4 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → ((𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟)) ↔ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))))
5655rabbidv 3430 . . 3 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} = {𝑥𝑃 ∣ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))})
5735, 40, 43, 56ovmpodv2 7569 . 2 (𝜑 → (𝐸 = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}) → (𝐴𝐸𝑅) = {𝑥𝑃 ∣ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))}))
5834, 57mpd 16 1 (𝜑 → (𝐴𝐸𝑅) = {𝑥𝑃 ∣ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3o 1100   = wceq 1567  wcel 2149  wrex 3095  {crab 3423  Vcvv 3463  cdif 3910   class class class wbr 5113  ran crn 5663  cfv 6537  (class class class)co 7411  cmpo 7413  Basecbs 17268  TarskiGcstrkg 28661  Itvcitv 28667  LineGclng 28668  hpGchpg 28997  hlGcplng 29012
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-rep 5242  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-3or 1102  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-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  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-iun 4962  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-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-1st 7985  df-2nd 7986  df-plng 29013
This theorem is referenced by:  isplng  29017  plngrnssp  29018  elplng  29019  plngssp  29020  plngcplem  29024
  Copyright terms: Public domain W3C validator