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

Theorem plngval 28981
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 28909). (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 28978 . . . 4 hlG = (𝑔 ∈ V ↦ (𝑎 ∈ ran (LineG‘𝑔), 𝑟 ∈ ((Base‘𝑔) ∖ 𝑎) ↦ {𝑥 ∈ (Base‘𝑔) ∣ (𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))}))
3 fveq2 6867 . . . . . . 7 (𝑔 = 𝐺 → (LineG‘𝑔) = (LineG‘𝐺))
4 plngval.1 . . . . . . 7 𝐿 = (LineG‘𝐺)
53, 4eqtr4di 2815 . . . . . 6 (𝑔 = 𝐺 → (LineG‘𝑔) = 𝐿)
65rneqd 5914 . . . . 5 (𝑔 = 𝐺 → ran (LineG‘𝑔) = ran 𝐿)
7 fveq2 6867 . . . . . . 7 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
8 plngval.p . . . . . . 7 𝑃 = (Base‘𝐺)
97, 8eqtr4di 2815 . . . . . 6 (𝑔 = 𝐺 → (Base‘𝑔) = 𝑃)
109difeq1d 4079 . . . . 5 (𝑔 = 𝐺 → ((Base‘𝑔) ∖ 𝑎) = (𝑃𝑎))
11 biidd 264 . . . . . . 7 (𝑔 = 𝐺 → (𝑥𝑎𝑥𝑎))
12 fveq2 6867 . . . . . . . . 9 (𝑔 = 𝐺 → (hpG‘𝑔) = (hpG‘𝐺))
1312fveq1d 6869 . . . . . . . 8 (𝑔 = 𝐺 → ((hpG‘𝑔)‘𝑎) = ((hpG‘𝐺)‘𝑎))
1413breqd 5111 . . . . . . 7 (𝑔 = 𝐺 → (𝑥((hpG‘𝑔)‘𝑎)𝑟𝑥((hpG‘𝐺)‘𝑎)𝑟))
15 fveq2 6867 . . . . . . . . . . 11 (𝑔 = 𝐺 → (Itv‘𝑔) = (Itv‘𝐺))
16 plngval.i . . . . . . . . . . 11 𝐼 = (Itv‘𝐺)
1715, 16eqtr4di 2815 . . . . . . . . . 10 (𝑔 = 𝐺 → (Itv‘𝑔) = 𝐼)
1817oveqd 7413 . . . . . . . . 9 (𝑔 = 𝐺 → (𝑥(Itv‘𝑔)𝑟) = (𝑥𝐼𝑟))
1918eleq2d 2848 . . . . . . . 8 (𝑔 = 𝐺 → (𝑡 ∈ (𝑥(Itv‘𝑔)𝑟) ↔ 𝑡 ∈ (𝑥𝐼𝑟)))
2019rexbidv 3186 . . . . . . 7 (𝑔 = 𝐺 → (∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟) ↔ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟)))
2111, 14, 203orbi123d 1456 . . . . . 6 (𝑔 = 𝐺 → ((𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟)) ↔ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))))
229, 21rabeqbidv 3432 . . . . 5 (𝑔 = 𝐺 → {𝑥 ∈ (Base‘𝑔) ∣ (𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))} = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))})
236, 10, 22mpoeq123dv 7471 . . . 4 (𝑔 = 𝐺 → (𝑎 ∈ ran (LineG‘𝑔), 𝑟 ∈ ((Base‘𝑔) ∖ 𝑎) ↦ {𝑥 ∈ (Base‘𝑔) ∣ (𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))}) = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
24 plngval.g . . . . 5 (𝜑𝐺 ∈ TarskiG)
2524elexd 3477 . . . 4 (𝜑𝐺 ∈ V)
264fvexi 6881 . . . . . . 7 𝐿 ∈ V
2726rnex 7891 . . . . . 6 ran 𝐿 ∈ V
2827a1i 11 . . . . 5 (𝜑 → ran 𝐿 ∈ V)
298fvexi 6881 . . . . . . 7 𝑃 ∈ V
3029difexi 5286 . . . . . 6 (𝑃𝑎) ∈ V
3130a1i 11 . . . . 5 ((𝜑𝑎 ∈ ran 𝐿) → (𝑃𝑎) ∈ V)
3228, 31mpoexd 8061 . . . 4 (𝜑 → (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}) ∈ V)
332, 23, 25, 32fvmptd3 6999 . . 3 (𝜑 → (hlG‘𝐺) = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
341, 33eqtrid 2809 . 2 (𝜑𝐸 = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
35 plngval.a . . 3 (𝜑𝐴 ∈ ran 𝐿)
36 plngval.r . . . . 5 (𝜑𝑅 ∈ (𝑃𝐴))
3736adantr 484 . . . 4 ((𝜑𝑎 = 𝐴) → 𝑅 ∈ (𝑃𝐴))
38 difeq2 4074 . . . . 5 (𝑎 = 𝐴 → (𝑃𝑎) = (𝑃𝐴))
3938adantl 485 . . . 4 ((𝜑𝑎 = 𝐴) → (𝑃𝑎) = (𝑃𝐴))
4037, 39eleqtrrd 2865 . . 3 ((𝜑𝑎 = 𝐴) → 𝑅 ∈ (𝑃𝑎))
41 eqid 2762 . . . 4 {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}
4229a1i 11 . . . 4 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑃 ∈ V)
4341, 42rabexd 5296 . . 3 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} ∈ V)
44 eleq2w2 2758 . . . . . 6 (𝑎 = 𝐴 → (𝑥𝑎𝑥𝐴))
4544ad2antrl 738 . . . . 5 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑥𝑎𝑥𝐴))
46 eqidd 2763 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑥 = 𝑥)
47 fveq2 6867 . . . . . . 7 (𝑎 = 𝐴 → ((hpG‘𝐺)‘𝑎) = ((hpG‘𝐺)‘𝐴))
4847ad2antrl 738 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → ((hpG‘𝐺)‘𝑎) = ((hpG‘𝐺)‘𝐴))
49 simprr 782 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑟 = 𝑅)
5046, 48, 49breq123d 5114 . . . . 5 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑥((hpG‘𝐺)‘𝑎)𝑟𝑥((hpG‘𝐺)‘𝐴)𝑅))
51 simprl 780 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑎 = 𝐴)
5249oveq2d 7412 . . . . . . 7 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑥𝐼𝑟) = (𝑥𝐼𝑅))
5352eleq2d 2848 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑡 ∈ (𝑥𝐼𝑟) ↔ 𝑡 ∈ (𝑥𝐼𝑅)))
5451, 53rexeqbidv 3337 . . . . 5 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟) ↔ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅)))
5545, 50, 543orbi123d 1456 . . . 4 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → ((𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟)) ↔ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))))
5655rabbidv 3421 . . 3 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} = {𝑥𝑃 ∣ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))})
5735, 40, 43, 56ovmpodv2 7554 . 2 (𝜑 → (𝐸 = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}) → (𝐴𝐸𝑅) = {𝑥𝑃 ∣ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))}))
5834, 57mpd 15 1 (𝜑 → (𝐴𝐸𝑅) = {𝑥𝑃 ∣ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  w3o 1097   = wceq 1560  wcel 2142  wrex 3086  {crab 3414  Vcvv 3454  cdif 3901   class class class wbr 5100  ran crn 5648  cfv 6521  (class class class)co 7396  cmpo 7398  Basecbs 17245  TarskiGcstrkg 28593  Itvcitv 28599  LineGclng 28600  hpGchpg 28927  hlGcplng 28977
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-ov 7399  df-oprab 7400  df-mpo 7401  df-1st 7970  df-2nd 7971  df-plng 28978
This theorem is referenced by:  isplng  28982  plngrnssp  28983  elplng  28984  plngssp  28985  plngcplem  28989
  Copyright terms: Public domain W3C validator