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

Theorem isplng 28982
Description: The property of being a plane. (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)
isplng.h (𝜑𝐻 ∈ ran 𝐸)
Assertion
Ref Expression
isplng (𝜑 → ∃𝑎 ∈ ran 𝐿𝑟 ∈ (𝑃𝑎)𝐻 = (𝑎𝐸𝑟))
Distinct variable groups:   𝐺,𝑎,𝑟   𝐻,𝑎,𝑟   𝐿,𝑎,𝑟   𝑃,𝑟   𝜑,𝑎,𝑟
Allowed substitution hints:   𝑃(𝑎)   𝐸(𝑟,𝑎)   𝐼(𝑟,𝑎)

Proof of Theorem isplng
Dummy variables 𝑔 𝑡 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isplng.h . . . 4 (𝜑𝐻 ∈ ran 𝐸)
2 plngval.e . . . . . 6 𝐸 = (hlG‘𝐺)
3 df-plng 28978 . . . . . . 7 hlG = (𝑔 ∈ V ↦ (𝑎 ∈ ran (LineG‘𝑔), 𝑟 ∈ ((Base‘𝑔) ∖ 𝑎) ↦ {𝑥 ∈ (Base‘𝑔) ∣ (𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))}))
4 fveq2 6867 . . . . . . . . . 10 (𝑔 = 𝐺 → (LineG‘𝑔) = (LineG‘𝐺))
5 plngval.1 . . . . . . . . . 10 𝐿 = (LineG‘𝐺)
64, 5eqtr4di 2815 . . . . . . . . 9 (𝑔 = 𝐺 → (LineG‘𝑔) = 𝐿)
76rneqd 5914 . . . . . . . 8 (𝑔 = 𝐺 → ran (LineG‘𝑔) = ran 𝐿)
8 fveq2 6867 . . . . . . . . . 10 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
9 plngval.p . . . . . . . . . 10 𝑃 = (Base‘𝐺)
108, 9eqtr4di 2815 . . . . . . . . 9 (𝑔 = 𝐺 → (Base‘𝑔) = 𝑃)
1110difeq1d 4079 . . . . . . . 8 (𝑔 = 𝐺 → ((Base‘𝑔) ∖ 𝑎) = (𝑃𝑎))
12 biidd 264 . . . . . . . . . 10 (𝑔 = 𝐺 → (𝑥𝑎𝑥𝑎))
13 fveq2 6867 . . . . . . . . . . . 12 (𝑔 = 𝐺 → (hpG‘𝑔) = (hpG‘𝐺))
1413fveq1d 6869 . . . . . . . . . . 11 (𝑔 = 𝐺 → ((hpG‘𝑔)‘𝑎) = ((hpG‘𝐺)‘𝑎))
1514breqd 5111 . . . . . . . . . 10 (𝑔 = 𝐺 → (𝑥((hpG‘𝑔)‘𝑎)𝑟𝑥((hpG‘𝐺)‘𝑎)𝑟))
16 fveq2 6867 . . . . . . . . . . . . . 14 (𝑔 = 𝐺 → (Itv‘𝑔) = (Itv‘𝐺))
17 plngval.i . . . . . . . . . . . . . 14 𝐼 = (Itv‘𝐺)
1816, 17eqtr4di 2815 . . . . . . . . . . . . 13 (𝑔 = 𝐺 → (Itv‘𝑔) = 𝐼)
1918oveqd 7413 . . . . . . . . . . . 12 (𝑔 = 𝐺 → (𝑥(Itv‘𝑔)𝑟) = (𝑥𝐼𝑟))
2019eleq2d 2848 . . . . . . . . . . 11 (𝑔 = 𝐺 → (𝑡 ∈ (𝑥(Itv‘𝑔)𝑟) ↔ 𝑡 ∈ (𝑥𝐼𝑟)))
2120rexbidv 3186 . . . . . . . . . 10 (𝑔 = 𝐺 → (∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟) ↔ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟)))
2212, 15, 213orbi123d 1456 . . . . . . . . 9 (𝑔 = 𝐺 → ((𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟)) ↔ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))))
2310, 22rabeqbidv 3432 . . . . . . . 8 (𝑔 = 𝐺 → {𝑥 ∈ (Base‘𝑔) ∣ (𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))} = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))})
247, 11, 23mpoeq123dv 7471 . . . . . . 7 (𝑔 = 𝐺 → (𝑎 ∈ ran (LineG‘𝑔), 𝑟 ∈ ((Base‘𝑔) ∖ 𝑎) ↦ {𝑥 ∈ (Base‘𝑔) ∣ (𝑥𝑎𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))}) = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
25 plngval.g . . . . . . . 8 (𝜑𝐺 ∈ TarskiG)
2625elexd 3477 . . . . . . 7 (𝜑𝐺 ∈ V)
275fvexi 6881 . . . . . . . . . 10 𝐿 ∈ V
2827rnex 7891 . . . . . . . . 9 ran 𝐿 ∈ V
2928a1i 11 . . . . . . . 8 (𝜑 → ran 𝐿 ∈ V)
309fvexi 6881 . . . . . . . . . 10 𝑃 ∈ V
3130difexi 5286 . . . . . . . . 9 (𝑃𝑎) ∈ V
3231a1i 11 . . . . . . . 8 ((𝜑𝑎 ∈ ran 𝐿) → (𝑃𝑎) ∈ V)
3329, 32mpoexd 8061 . . . . . . 7 (𝜑 → (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}) ∈ V)
343, 24, 26, 33fvmptd3 6999 . . . . . 6 (𝜑 → (hlG‘𝐺) = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
352, 34eqtrid 2809 . . . . 5 (𝜑𝐸 = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
3635rneqd 5914 . . . 4 (𝜑 → ran 𝐸 = ran (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
371, 36eleqtrd 2864 . . 3 (𝜑𝐻 ∈ ran (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
38 eqid 2762 . . . 4 (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}) = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))})
3930rabex 5295 . . . 4 {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} ∈ V
4038, 39elrnmpo 7532 . . 3 (𝐻 ∈ ran (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃𝑎) ↦ {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}) ↔ ∃𝑎 ∈ ran 𝐿𝑟 ∈ (𝑃𝑎)𝐻 = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))})
4137, 40sylib 220 . 2 (𝜑 → ∃𝑎 ∈ ran 𝐿𝑟 ∈ (𝑃𝑎)𝐻 = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))})
4225ad2antrr 736 . . . . . . 7 (((𝜑𝑎 ∈ ran 𝐿) ∧ 𝑟 ∈ (𝑃𝑎)) → 𝐺 ∈ TarskiG)
43 simplr 778 . . . . . . 7 (((𝜑𝑎 ∈ ran 𝐿) ∧ 𝑟 ∈ (𝑃𝑎)) → 𝑎 ∈ ran 𝐿)
44 simpr 488 . . . . . . 7 (((𝜑𝑎 ∈ ran 𝐿) ∧ 𝑟 ∈ (𝑃𝑎)) → 𝑟 ∈ (𝑃𝑎))
459, 17, 5, 2, 42, 43, 44plngval 28981 . . . . . 6 (((𝜑𝑎 ∈ ran 𝐿) ∧ 𝑟 ∈ (𝑃𝑎)) → (𝑎𝐸𝑟) = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))})
4645eqeq2d 2773 . . . . 5 (((𝜑𝑎 ∈ ran 𝐿) ∧ 𝑟 ∈ (𝑃𝑎)) → (𝐻 = (𝑎𝐸𝑟) ↔ 𝐻 = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
4746biimprd 250 . . . 4 (((𝜑𝑎 ∈ ran 𝐿) ∧ 𝑟 ∈ (𝑃𝑎)) → (𝐻 = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} → 𝐻 = (𝑎𝐸𝑟)))
4847anasss 470 . . 3 ((𝜑 ∧ (𝑎 ∈ ran 𝐿𝑟 ∈ (𝑃𝑎))) → (𝐻 = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} → 𝐻 = (𝑎𝐸𝑟)))
4948reximdvva 3210 . 2 (𝜑 → (∃𝑎 ∈ ran 𝐿𝑟 ∈ (𝑃𝑎)𝐻 = {𝑥𝑃 ∣ (𝑥𝑎𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡𝑎 𝑡 ∈ (𝑥𝐼𝑟))} → ∃𝑎 ∈ ran 𝐿𝑟 ∈ (𝑃𝑎)𝐻 = (𝑎𝐸𝑟)))
5041, 49mpd 15 1 (𝜑 → ∃𝑎 ∈ ran 𝐿𝑟 ∈ (𝑃𝑎)𝐻 = (𝑎𝐸𝑟))
Colors of variables: wff setvar class
Syntax hints:  wi 4  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:  plngrnssp  28983  lnssplng  28996
  Copyright terms: Public domain W3C validator