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

Theorem plngval 29110
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 29071). (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 29107 . . . 4 hlG = (𝑔 ∈ V ↦ (𝑎 ∈ ran (LineG‘𝑔), 𝑟 ∈ ((Base‘𝑔) ∖ 𝑎) ↦ {𝑥 ∈ (Base‘𝑔) ∣ (𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))}))
3 fveq2 6885 . . . . . . 7 (𝑔 = 𝐺 → (LineG‘𝑔) = (LineG‘𝐺))
4 plngval.1 . . . . . . 7 𝐿 = (LineG‘𝐺)
53, 4eqtr4di 2818 . . . . . 6 (𝑔 = 𝐺 → (LineG‘𝑔) = 𝐿)
65rneqd 5930 . . . . 5 (𝑔 = 𝐺 → ran (LineG‘𝑔) = ran 𝐿)
7 fveq2 6885 . . . . . . 7 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
8 plngval.p . . . . . . 7 𝑃 = (Base‘𝐺)
97, 8eqtr4di 2818 . . . . . 6 (𝑔 = 𝐺 → (Base‘𝑔) = 𝑃)
109difeq1d 4080 . . . . 5 (𝑔 = 𝐺 → ((Base‘𝑔) ∖ 𝑎) = (𝑃𝑎))
11 biidd 265 . . . . . . 7 (𝑔 = 𝐺 → (𝑥𝑎𝑥𝑎))
12 fveq2 6885 . . . . . . . . 9 (𝑔 = 𝐺 → (hpG‘𝑔) = (hpG‘𝐺))
1312fveq1d 6887 . . . . . . . 8 (𝑔 = 𝐺 → ((hpG‘𝑔)‘𝑎) = ((hpG‘𝐺)‘𝑎))
1413breqd 5122 . . . . . . 7 (𝑔 = 𝐺 → (𝑥((hpG‘𝑔)‘𝑎)𝑟𝑥((hpG‘𝐺)‘𝑎)𝑟))
15 fveq2 6885 . . . . . . . . . . 11 (𝑔 = 𝐺 → (Itv‘𝑔) = (Itv‘𝐺))
16 plngval.i . . . . . . . . . . 11 𝐼 = (Itv‘𝐺)
1715, 16eqtr4di 2818 . . . . . . . . . 10 (𝑔 = 𝐺 → (Itv‘𝑔) = 𝐼)
1817oveqd 7436 . . . . . . . . 9 (𝑔 = 𝐺 → (𝑥(Itv‘𝑔)𝑟) = (𝑥𝐼𝑟))
1918eleq2d 2851 . . . . . . . 8 (𝑔 = 𝐺 → (𝑡 ∈ (𝑥(Itv‘𝑔)𝑟) ↔ 𝑡 ∈ (𝑥𝐼𝑟)))
2019rexbidv 3191 . . . . . . 7 (𝑔 = 𝐺 → (∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟) ↔ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟)))
2111, 14, 203orbi123d 1463 . . . . . 6 (𝑔 = 𝐺 → ((𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟)) ↔ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))))
229, 21rabeqbidv 3436 . . . . 5 (𝑔 = 𝐺 → {𝑥 ∈ (Base‘𝑔) ∣ (𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))} = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))})
236, 10, 22mpoeq123dv 7494 . . . 4 (𝑔 = 𝐺 → (𝑎 ∈ ran (LineG‘𝑔), 𝑟 ∈ ((Base‘𝑔) ∖ 𝑎) ↦ {𝑥 ∈ (Base‘𝑔) ∣ (𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))}) = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
24 plngval.g . . . . 5 (𝜑𝐺 ∈ TarskiG)
2524elexd 3480 . . . 4 (𝜑𝐺 ∈ V)
264fvexi 6899 . . . . . . 7 𝐿 ∈ V
2726rnex 7913 . . . . . 6 ran 𝐿 ∈ V
2827a1i 11 . . . . 5 (𝜑 → ran 𝐿 ∈ V)
298fvexi 6899 . . . . . . 7 𝑃 ∈ V
3029difexi 5303 . . . . . 6 (𝑃𝑎) ∈ V
3130a1i 11 . . . . 5 ((𝜑𝑎 ∈ ran 𝐿) → (𝑃𝑎) ∈ V)
3228, 31mpoexd 8083 . . . 4 (𝜑 → (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}) ∈ V)
332, 23, 25, 32fvmptd3 7017 . . 3 (𝜑 → (hlG‘𝐺) = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
341, 33eqtrid 2812 . 2 (𝜑𝐸 = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
35 plngval.a . . 3 (𝜑𝐴 ∈ ran 𝐿)
36 plngval.r . . . . 5 (𝜑𝑅 ∈ (𝑃𝐴))
3736adantr 486 . . . 4 ((𝜑𝑎 = 𝐴) → 𝑅 ∈ (𝑃𝐴))
38 difeq2 4075 . . . . 5 (𝑎 = 𝐴 → (𝑃𝑎) = (𝑃𝐴))
3938adantl 487 . . . 4 ((𝜑𝑎 = 𝐴) → (𝑃𝑎) = (𝑃𝐴))
4037, 39eleqtrrd 2868 . . 3 ((𝜑𝑎 = 𝐴) → 𝑅 ∈ (𝑃𝑎))
41 eqid 2765 . . . 4 {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}
4229a1i 11 . . . 4 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑃 ∈ V)
4341, 42rabexd 5312 . . 3 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} ∈ V)
44 eleq2w2 2761 . . . . . 6 (𝑎 = 𝐴 → (𝑥𝑎𝑥𝐴))
4544ad2antrl 741 . . . . 5 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑥𝑎𝑥𝐴))
46 eqidd 2766 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑥 = 𝑥)
47 fveq2 6885 . . . . . . 7 (𝑎 = 𝐴 → ((hpG‘𝐺)‘𝑎) = ((hpG‘𝐺)‘𝐴))
4847ad2antrl 741 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → ((hpG‘𝐺)‘𝑎) = ((hpG‘𝐺)‘𝐴))
49 simprr 785 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑟 = 𝑅)
5046, 48, 49breq123d 5125 . . . . 5 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑥((hpG‘𝐺)‘𝑎)𝑟𝑥((hpG‘𝐺)‘𝐴)𝑅))
51 simprl 783 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑎 = 𝐴)
5249oveq2d 7435 . . . . . . 7 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑥𝐼𝑟) = (𝑥𝐼𝑅))
5352eleq2d 2851 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑡 ∈ (𝑥𝐼𝑟) ↔ 𝑡 ∈ (𝑥𝐼𝑅)))
5451, 53rexeqbidv 3341 . . . . 5 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟) ↔ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅)))
5545, 50, 543orbi123d 1463 . . . 4 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → ((𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟)) ↔ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))))
5655rabbidv 3425 . . 3 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} = {𝑥𝑃 ∣ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))})
5735, 40, 43, 56ovmpodv2 7577 . 2 (𝜑 → (𝐸 = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}) → (𝐴𝐸𝑅) = {𝑥𝑃 ∣ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))}))
5834, 57mpd 16 1 (𝜑 → (𝐴𝐸𝑅) = {𝑥𝑃 ∣ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  w3o 1102   = wceq 1570  wcel 2146  wrex 3091  {crab 3418  Vcvv 3457  cdif 3903   class class class wbr 5111  ran crn 5664  cfv 6540  (class class class)co 7419  cmpo 7421  Basecbs 17291  TarskiGcstrkg 28747  Itvcitv 28753  LineGclng 28754  hpGchpg 29090  hlGcplng 29106
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-plng 29107
This theorem is used by:  isplng  29111  plngrnssp  29112  elplng  29113  plngssp  29114  plngcplem  29118
  Copyright terms: Public domain W3C validator