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

Theorem plngval 29059
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 29020). (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 29056 . . . 4 hlG = (𝑔 ∈ V ↦ (𝑎 ∈ ran (LineG‘𝑔), 𝑟 ∈ ((Base‘𝑔) ∖ 𝑎) ↦ {𝑥 ∈ (Base‘𝑔) ∣ (𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))}))
3 fveq2 6881 . . . . . . 7 (𝑔 = 𝐺 → (LineG‘𝑔) = (LineG‘𝐺))
4 plngval.1 . . . . . . 7 𝐿 = (LineG‘𝐺)
53, 4eqtr4di 2816 . . . . . 6 (𝑔 = 𝐺 → (LineG‘𝑔) = 𝐿)
65rneqd 5928 . . . . 5 (𝑔 = 𝐺 → ran (LineG‘𝑔) = ran 𝐿)
7 fveq2 6881 . . . . . . 7 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
8 plngval.p . . . . . . 7 𝑃 = (Base‘𝐺)
97, 8eqtr4di 2816 . . . . . 6 (𝑔 = 𝐺 → (Base‘𝑔) = 𝑃)
109difeq1d 4080 . . . . 5 (𝑔 = 𝐺 → ((Base‘𝑔) ∖ 𝑎) = (𝑃𝑎))
11 biidd 265 . . . . . . 7 (𝑔 = 𝐺 → (𝑥𝑎𝑥𝑎))
12 fveq2 6881 . . . . . . . . 9 (𝑔 = 𝐺 → (hpG‘𝑔) = (hpG‘𝐺))
1312fveq1d 6883 . . . . . . . 8 (𝑔 = 𝐺 → ((hpG‘𝑔)‘𝑎) = ((hpG‘𝐺)‘𝑎))
1413breqd 5120 . . . . . . 7 (𝑔 = 𝐺 → (𝑥((hpG‘𝑔)‘𝑎)𝑟𝑥((hpG‘𝐺)‘𝑎)𝑟))
15 fveq2 6881 . . . . . . . . . . 11 (𝑔 = 𝐺 → (Itv‘𝑔) = (Itv‘𝐺))
16 plngval.i . . . . . . . . . . 11 𝐼 = (Itv‘𝐺)
1715, 16eqtr4di 2816 . . . . . . . . . 10 (𝑔 = 𝐺 → (Itv‘𝑔) = 𝐼)
1817oveqd 7427 . . . . . . . . 9 (𝑔 = 𝐺 → (𝑥(Itv‘𝑔)𝑟) = (𝑥𝐼𝑟))
1918eleq2d 2849 . . . . . . . 8 (𝑔 = 𝐺 → (𝑡 ∈ (𝑥(Itv‘𝑔)𝑟) ↔ 𝑡 ∈ (𝑥𝐼𝑟)))
2019rexbidv 3189 . . . . . . 7 (𝑔 = 𝐺 → (∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟) ↔ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟)))
2111, 14, 203orbi123d 1463 . . . . . 6 (𝑔 = 𝐺 → ((𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟)) ↔ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))))
229, 21rabeqbidv 3434 . . . . 5 (𝑔 = 𝐺 → {𝑥 ∈ (Base‘𝑔) ∣ (𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))} = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))})
236, 10, 22mpoeq123dv 7485 . . . 4 (𝑔 = 𝐺 → (𝑎 ∈ ran (LineG‘𝑔), 𝑟 ∈ ((Base‘𝑔) ∖ 𝑎) ↦ {𝑥 ∈ (Base‘𝑔) ∣ (𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))}) = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
24 plngval.g . . . . 5 (𝜑𝐺 ∈ TarskiG)
2524elexd 3478 . . . 4 (𝜑𝐺 ∈ V)
264fvexi 6895 . . . . . . 7 𝐿 ∈ V
2726rnex 7903 . . . . . 6 ran 𝐿 ∈ V
2827a1i 11 . . . . 5 (𝜑 → ran 𝐿 ∈ V)
298fvexi 6895 . . . . . . 7 𝑃 ∈ V
3029difexi 5301 . . . . . 6 (𝑃𝑎) ∈ V
3130a1i 11 . . . . 5 ((𝜑𝑎 ∈ ran 𝐿) → (𝑃𝑎) ∈ V)
3228, 31mpoexd 8073 . . . 4 (𝜑 → (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}) ∈ V)
332, 23, 25, 32fvmptd3 7013 . . 3 (𝜑 → (hlG‘𝐺) = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
341, 33eqtrid 2810 . 2 (𝜑𝐸 = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
35 plngval.a . . 3 (𝜑𝐴 ∈ ran 𝐿)
36 plngval.r . . . . 5 (𝜑𝑅 ∈ (𝑃𝐴))
3736adantr 485 . . . 4 ((𝜑𝑎 = 𝐴) → 𝑅 ∈ (𝑃𝐴))
38 difeq2 4075 . . . . 5 (𝑎 = 𝐴 → (𝑃𝑎) = (𝑃𝐴))
3938adantl 486 . . . 4 ((𝜑𝑎 = 𝐴) → (𝑃𝑎) = (𝑃𝐴))
4037, 39eleqtrrd 2866 . . 3 ((𝜑𝑎 = 𝐴) → 𝑅 ∈ (𝑃𝑎))
41 eqid 2763 . . . 4 {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}
4229a1i 11 . . . 4 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑃 ∈ V)
4341, 42rabexd 5310 . . 3 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} ∈ V)
44 eleq2w2 2759 . . . . . 6 (𝑎 = 𝐴 → (𝑥𝑎𝑥𝐴))
4544ad2antrl 740 . . . . 5 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑥𝑎𝑥𝐴))
46 eqidd 2764 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑥 = 𝑥)
47 fveq2 6881 . . . . . . 7 (𝑎 = 𝐴 → ((hpG‘𝐺)‘𝑎) = ((hpG‘𝐺)‘𝐴))
4847ad2antrl 740 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → ((hpG‘𝐺)‘𝑎) = ((hpG‘𝐺)‘𝐴))
49 simprr 784 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑟 = 𝑅)
5046, 48, 49breq123d 5123 . . . . 5 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑥((hpG‘𝐺)‘𝑎)𝑟𝑥((hpG‘𝐺)‘𝐴)𝑅))
51 simprl 782 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → 𝑎 = 𝐴)
5249oveq2d 7426 . . . . . . 7 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑥𝐼𝑟) = (𝑥𝐼𝑅))
5352eleq2d 2849 . . . . . 6 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (𝑡 ∈ (𝑥𝐼𝑟) ↔ 𝑡 ∈ (𝑥𝐼𝑅)))
5451, 53rexeqbidv 3339 . . . . 5 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → (∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟) ↔ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅)))
5545, 50, 543orbi123d 1463 . . . 4 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → ((𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟)) ↔ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))))
5655rabbidv 3423 . . 3 ((𝜑 ∧ (𝑎 = 𝐴𝑟 = 𝑅)) → {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} = {𝑥𝑃 ∣ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))})
5735, 40, 43, 56ovmpodv2 7568 . 2 (𝜑 → (𝐸 = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}) → (𝐴𝐸𝑅) = {𝑥𝑃 ∣ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))}))
5834, 57mpd 16 1 (𝜑 → (𝐴𝐸𝑅) = {𝑥𝑃 ∣ (𝑥𝐴𝑥((hpG‘𝐺)‘𝐴)𝑅 ∨ ∃𝑡𝐴 𝑡 ∈ (𝑥𝐼𝑅))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3o 1102   = wceq 1570  wcel 2143  wrex 3089  {crab 3416  Vcvv 3455  cdif 3902   class class class wbr 5109  ran crn 5662  cfv 6536  (class class class)co 7410  cmpo 7412  Basecbs 17264  TarskiGcstrkg 28696  Itvcitv 28702  LineGclng 28703  hpGchpg 29039  hlGcplng 29055
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-plng 29056
This theorem is referenced by:  isplng  29060  plngrnssp  29061  elplng  29062  plngssp  29063  plngcplem  29067
  Copyright terms: Public domain W3C validator