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

Theorem isplig 27458
Description: The predicate "is a planar incidence geometry" for sets. (Contributed by FL, 2-Aug-2009.)
Hypothesis
Ref Expression
isplig.1 𝑃 = 𝐺
Assertion
Ref Expression
isplig (𝐺𝐴 → (𝐺 ∈ Plig ↔ (∀𝑎𝑃𝑏𝑃 (𝑎𝑏 → ∃!𝑙𝐺 (𝑎𝑙𝑏𝑙)) ∧ ∀𝑙𝐺𝑎𝑃𝑏𝑃 (𝑎𝑏𝑎𝑙𝑏𝑙) ∧ ∃𝑎𝑃𝑏𝑃𝑐𝑃𝑙𝐺 ¬ (𝑎𝑙𝑏𝑙𝑐𝑙))))
Distinct variable groups:   𝑎,𝑏,𝑐,𝑙,𝐺   𝑃,𝑎,𝑏,𝑐
Allowed substitution hints:   𝐴(𝑎,𝑏,𝑐,𝑙)   𝑃(𝑙)

Proof of Theorem isplig
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 unieq 4476 . . . . 5 (𝑥 = 𝐺 𝑥 = 𝐺)
2 isplig.1 . . . . 5 𝑃 = 𝐺
31, 2syl6eqr 2703 . . . 4 (𝑥 = 𝐺 𝑥 = 𝑃)
4 reueq1 3170 . . . . . 6 (𝑥 = 𝐺 → (∃!𝑙𝑥 (𝑎𝑙𝑏𝑙) ↔ ∃!𝑙𝐺 (𝑎𝑙𝑏𝑙)))
54imbi2d 329 . . . . 5 (𝑥 = 𝐺 → ((𝑎𝑏 → ∃!𝑙𝑥 (𝑎𝑙𝑏𝑙)) ↔ (𝑎𝑏 → ∃!𝑙𝐺 (𝑎𝑙𝑏𝑙))))
63, 5raleqbidv 3182 . . . 4 (𝑥 = 𝐺 → (∀𝑏 𝑥(𝑎𝑏 → ∃!𝑙𝑥 (𝑎𝑙𝑏𝑙)) ↔ ∀𝑏𝑃 (𝑎𝑏 → ∃!𝑙𝐺 (𝑎𝑙𝑏𝑙))))
73, 6raleqbidv 3182 . . 3 (𝑥 = 𝐺 → (∀𝑎 𝑥𝑏 𝑥(𝑎𝑏 → ∃!𝑙𝑥 (𝑎𝑙𝑏𝑙)) ↔ ∀𝑎𝑃𝑏𝑃 (𝑎𝑏 → ∃!𝑙𝐺 (𝑎𝑙𝑏𝑙))))
83rexeqdv 3175 . . . . 5 (𝑥 = 𝐺 → (∃𝑏 𝑥(𝑎𝑏𝑎𝑙𝑏𝑙) ↔ ∃𝑏𝑃 (𝑎𝑏𝑎𝑙𝑏𝑙)))
93, 8rexeqbidv 3183 . . . 4 (𝑥 = 𝐺 → (∃𝑎 𝑥𝑏 𝑥(𝑎𝑏𝑎𝑙𝑏𝑙) ↔ ∃𝑎𝑃𝑏𝑃 (𝑎𝑏𝑎𝑙𝑏𝑙)))
109raleqbi1dv 3176 . . 3 (𝑥 = 𝐺 → (∀𝑙𝑥𝑎 𝑥𝑏 𝑥(𝑎𝑏𝑎𝑙𝑏𝑙) ↔ ∀𝑙𝐺𝑎𝑃𝑏𝑃 (𝑎𝑏𝑎𝑙𝑏𝑙)))
11 raleq 3168 . . . . . 6 (𝑥 = 𝐺 → (∀𝑙𝑥 ¬ (𝑎𝑙𝑏𝑙𝑐𝑙) ↔ ∀𝑙𝐺 ¬ (𝑎𝑙𝑏𝑙𝑐𝑙)))
123, 11rexeqbidv 3183 . . . . 5 (𝑥 = 𝐺 → (∃𝑐 𝑥𝑙𝑥 ¬ (𝑎𝑙𝑏𝑙𝑐𝑙) ↔ ∃𝑐𝑃𝑙𝐺 ¬ (𝑎𝑙𝑏𝑙𝑐𝑙)))
133, 12rexeqbidv 3183 . . . 4 (𝑥 = 𝐺 → (∃𝑏 𝑥𝑐 𝑥𝑙𝑥 ¬ (𝑎𝑙𝑏𝑙𝑐𝑙) ↔ ∃𝑏𝑃𝑐𝑃𝑙𝐺 ¬ (𝑎𝑙𝑏𝑙𝑐𝑙)))
143, 13rexeqbidv 3183 . . 3 (𝑥 = 𝐺 → (∃𝑎 𝑥𝑏 𝑥𝑐 𝑥𝑙𝑥 ¬ (𝑎𝑙𝑏𝑙𝑐𝑙) ↔ ∃𝑎𝑃𝑏𝑃𝑐𝑃𝑙𝐺 ¬ (𝑎𝑙𝑏𝑙𝑐𝑙)))
157, 10, 143anbi123d 1439 . 2 (𝑥 = 𝐺 → ((∀𝑎 𝑥𝑏 𝑥(𝑎𝑏 → ∃!𝑙𝑥 (𝑎𝑙𝑏𝑙)) ∧ ∀𝑙𝑥𝑎 𝑥𝑏 𝑥(𝑎𝑏𝑎𝑙𝑏𝑙) ∧ ∃𝑎 𝑥𝑏 𝑥𝑐 𝑥𝑙𝑥 ¬ (𝑎𝑙𝑏𝑙𝑐𝑙)) ↔ (∀𝑎𝑃𝑏𝑃 (𝑎𝑏 → ∃!𝑙𝐺 (𝑎𝑙𝑏𝑙)) ∧ ∀𝑙𝐺𝑎𝑃𝑏𝑃 (𝑎𝑏𝑎𝑙𝑏𝑙) ∧ ∃𝑎𝑃𝑏𝑃𝑐𝑃𝑙𝐺 ¬ (𝑎𝑙𝑏𝑙𝑐𝑙))))
16 df-plig 27457 . 2 Plig = {𝑥 ∣ (∀𝑎 𝑥𝑏 𝑥(𝑎𝑏 → ∃!𝑙𝑥 (𝑎𝑙𝑏𝑙)) ∧ ∀𝑙𝑥𝑎 𝑥𝑏 𝑥(𝑎𝑏𝑎𝑙𝑏𝑙) ∧ ∃𝑎 𝑥𝑏 𝑥𝑐 𝑥𝑙𝑥 ¬ (𝑎𝑙𝑏𝑙𝑐𝑙))}
1715, 16elab2g 3385 1 (𝐺𝐴 → (𝐺 ∈ Plig ↔ (∀𝑎𝑃𝑏𝑃 (𝑎𝑏 → ∃!𝑙𝐺 (𝑎𝑙𝑏𝑙)) ∧ ∀𝑙𝐺𝑎𝑃𝑏𝑃 (𝑎𝑏𝑎𝑙𝑏𝑙) ∧ ∃𝑎𝑃𝑏𝑃𝑐𝑃𝑙𝐺 ¬ (𝑎𝑙𝑏𝑙𝑐𝑙))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 383  w3a 1054   = wceq 1523  wcel 2030  wne 2823  wral 2941  wrex 2942  ∃!wreu 2943   cuni 4468  Pligcplig 27456
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-reu 2948  df-v 3233  df-uni 4469  df-plig 27457
This theorem is referenced by:  ispligb  27459  tncp  27460  l2p  27461  eulplig  27467
  Copyright terms: Public domain W3C validator