Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  lineset Structured version   Visualization version   GIF version

Theorem lineset 36868
Description: The set of lines in a Hilbert lattice. (Contributed by NM, 19-Sep-2011.)
Hypotheses
Ref Expression
lineset.l = (le‘𝐾)
lineset.j = (join‘𝐾)
lineset.a 𝐴 = (Atoms‘𝐾)
lineset.n 𝑁 = (Lines‘𝐾)
Assertion
Ref Expression
lineset (𝐾𝐵𝑁 = {𝑠 ∣ ∃𝑞𝐴𝑟𝐴 (𝑞𝑟𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)})})
Distinct variable groups:   𝑞,𝑝,𝑟,𝑠,𝐴   𝐾,𝑝,𝑞,𝑟,𝑠   ,𝑠   ,𝑠
Allowed substitution hints:   𝐵(𝑠,𝑟,𝑞,𝑝)   (𝑟,𝑞,𝑝)   (𝑟,𝑞,𝑝)   𝑁(𝑠,𝑟,𝑞,𝑝)

Proof of Theorem lineset
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 elex 3512 . 2 (𝐾𝐵𝐾 ∈ V)
2 lineset.n . . 3 𝑁 = (Lines‘𝐾)
3 fveq2 6664 . . . . . . 7 (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
4 lineset.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
53, 4syl6eqr 2874 . . . . . 6 (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
6 fveq2 6664 . . . . . . . . . . . . 13 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
7 lineset.l . . . . . . . . . . . . 13 = (le‘𝐾)
86, 7syl6eqr 2874 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (le‘𝑘) = )
98breqd 5069 . . . . . . . . . . 11 (𝑘 = 𝐾 → (𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟) ↔ 𝑝 (𝑞(join‘𝑘)𝑟)))
10 fveq2 6664 . . . . . . . . . . . . . 14 (𝑘 = 𝐾 → (join‘𝑘) = (join‘𝐾))
11 lineset.j . . . . . . . . . . . . . 14 = (join‘𝐾)
1210, 11syl6eqr 2874 . . . . . . . . . . . . 13 (𝑘 = 𝐾 → (join‘𝑘) = )
1312oveqd 7167 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (𝑞(join‘𝑘)𝑟) = (𝑞 𝑟))
1413breq2d 5070 . . . . . . . . . . 11 (𝑘 = 𝐾 → (𝑝 (𝑞(join‘𝑘)𝑟) ↔ 𝑝 (𝑞 𝑟)))
159, 14bitrd 281 . . . . . . . . . 10 (𝑘 = 𝐾 → (𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟) ↔ 𝑝 (𝑞 𝑟)))
165, 15rabeqbidv 3485 . . . . . . . . 9 (𝑘 = 𝐾 → {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)} = {𝑝𝐴𝑝 (𝑞 𝑟)})
1716eqeq2d 2832 . . . . . . . 8 (𝑘 = 𝐾 → (𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)} ↔ 𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)}))
1817anbi2d 630 . . . . . . 7 (𝑘 = 𝐾 → ((𝑞𝑟𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)}) ↔ (𝑞𝑟𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)})))
195, 18rexeqbidv 3402 . . . . . 6 (𝑘 = 𝐾 → (∃𝑟 ∈ (Atoms‘𝑘)(𝑞𝑟𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)}) ↔ ∃𝑟𝐴 (𝑞𝑟𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)})))
205, 19rexeqbidv 3402 . . . . 5 (𝑘 = 𝐾 → (∃𝑞 ∈ (Atoms‘𝑘)∃𝑟 ∈ (Atoms‘𝑘)(𝑞𝑟𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)}) ↔ ∃𝑞𝐴𝑟𝐴 (𝑞𝑟𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)})))
2120abbidv 2885 . . . 4 (𝑘 = 𝐾 → {𝑠 ∣ ∃𝑞 ∈ (Atoms‘𝑘)∃𝑟 ∈ (Atoms‘𝑘)(𝑞𝑟𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)})} = {𝑠 ∣ ∃𝑞𝐴𝑟𝐴 (𝑞𝑟𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)})})
22 df-lines 36631 . . . 4 Lines = (𝑘 ∈ V ↦ {𝑠 ∣ ∃𝑞 ∈ (Atoms‘𝑘)∃𝑟 ∈ (Atoms‘𝑘)(𝑞𝑟𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)})})
234fvexi 6678 . . . . 5 𝐴 ∈ V
24 df-sn 4561 . . . . . . 7 {{𝑝𝐴𝑝 (𝑞 𝑟)}} = {𝑠𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)}}
25 snex 5323 . . . . . . 7 {{𝑝𝐴𝑝 (𝑞 𝑟)}} ∈ V
2624, 25eqeltrri 2910 . . . . . 6 {𝑠𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)}} ∈ V
27 simpr 487 . . . . . . 7 ((𝑞𝑟𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)}) → 𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)})
2827ss2abi 4042 . . . . . 6 {𝑠 ∣ (𝑞𝑟𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)})} ⊆ {𝑠𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)}}
2926, 28ssexi 5218 . . . . 5 {𝑠 ∣ (𝑞𝑟𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)})} ∈ V
3023, 23, 29ab2rexex2 7675 . . . 4 {𝑠 ∣ ∃𝑞𝐴𝑟𝐴 (𝑞𝑟𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)})} ∈ V
3121, 22, 30fvmpt 6762 . . 3 (𝐾 ∈ V → (Lines‘𝐾) = {𝑠 ∣ ∃𝑞𝐴𝑟𝐴 (𝑞𝑟𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)})})
322, 31syl5eq 2868 . 2 (𝐾 ∈ V → 𝑁 = {𝑠 ∣ ∃𝑞𝐴𝑟𝐴 (𝑞𝑟𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)})})
331, 32syl 17 1 (𝐾𝐵𝑁 = {𝑠 ∣ ∃𝑞𝐴𝑟𝐴 (𝑞𝑟𝑠 = {𝑝𝐴𝑝 (𝑞 𝑟)})})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1533  wcel 2110  {cab 2799  wne 3016  wrex 3139  {crab 3142  Vcvv 3494  {csn 4560   class class class wbr 5058  cfv 6349  (class class class)co 7150  lecple 16566  joincjn 17548  Atomscatm 36393  Linesclines 36624
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5182  ax-sep 5195  ax-nul 5202  ax-pr 5321  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-iun 4913  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-ov 7153  df-lines 36631
This theorem is referenced by:  isline  36869
  Copyright terms: Public domain W3C validator