Theorem lineset 40902

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.

Step	Hyp	Ref	Expression
1		elex 3471	. 2 ⊢ (𝐾 ∈ 𝐵 → 𝐾 ∈ V)
2		lineset.n	. . 3 ⊢ 𝑁 = (Lines‘𝐾)
3		fveq2 6888	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
4		lineset.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
5	3, 4	eqtr4di 2813	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
6		fveq2 6888	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
7		lineset.l	. . . . . . . . . . . . 13 ⊢ ≤ = (le‘𝐾)
8	6, 7	eqtr4di 2813	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
9	8	breqd 5113	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐾 → (𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟) ↔ 𝑝 ≤ (𝑞(join‘𝑘)𝑟)))
10		fveq2 6888	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝐾 → (join‘𝑘) = (join‘𝐾))
11		lineset.j	. . . . . . . . . . . . . 14 ⊢ ∨ = (join‘𝐾)
12	10, 11	eqtr4di 2813	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝐾 → (join‘𝑘) = ∨ )
13	12	oveqd 7439	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝐾 → (𝑞(join‘𝑘)𝑟) = (𝑞 ∨ 𝑟))
14	13	breq2d 5114	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐾 → (𝑝 ≤ (𝑞(join‘𝑘)𝑟) ↔ 𝑝 ≤ (𝑞 ∨ 𝑟)))
15	9, 14	bitrd 282	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟) ↔ 𝑝 ≤ (𝑞 ∨ 𝑟)))
16	5, 15	rabeqbidv 3429	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)} = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})
17	16	eqeq2d 2771	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)} ↔ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}))
18	17	anbi2d 642	. . . . . . 7 ⊢ (𝑘 = 𝐾 → ((𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)}) ↔ (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})))
19	5, 18	rexeqbidv 3335	. . . . . 6 ⊢ (𝑘 = 𝐾 → (∃𝑟 ∈ (Atoms‘𝑘)(𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)}) ↔ ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})))
20	5, 19	rexeqbidv 3335	. . . . 5 ⊢ (𝑘 = 𝐾 → (∃𝑞 ∈ (Atoms‘𝑘)∃𝑟 ∈ (Atoms‘𝑘)(𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)}) ↔ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})))
21	20	abbidv 2826	. . . 4 ⊢ (𝑘 = 𝐾 → {𝑠 ∣ ∃𝑞 ∈ (Atoms‘𝑘)∃𝑟 ∈ (Atoms‘𝑘)(𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)})} = {𝑠 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})})
22		df-lines 40665	. . . 4 ⊢ Lines = (𝑘 ∈ V ↦ {𝑠 ∣ ∃𝑞 ∈ (Atoms‘𝑘)∃𝑟 ∈ (Atoms‘𝑘)(𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)})})
23	4	fvexi 6902	. . . . 5 ⊢ 𝐴 ∈ V
24		df-sn 4585	. . . . . . 7 ⊢ {{𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}} = {𝑠 ∣ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}}
25		snex 5396	. . . . . . 7 ⊢ {{𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}} ∈ V
26	24, 25	eqeltrri 2857	. . . . . 6 ⊢ {𝑠 ∣ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}} ∈ V
27		simpr 490	. . . . . . 7 ⊢ ((𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}) → 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})
28	27	ss2abi 3990	. . . . . 6 ⊢ {𝑠 ∣ (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})} ⊆ {𝑠 ∣ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}}
29	26, 28	ssexi 5283	. . . . 5 ⊢ {𝑠 ∣ (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})} ∈ V
30	23, 23, 29	ab2rexex2 7994	. . . 4 ⊢ {𝑠 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})} ∈ V
31	21, 22, 30	fvmpt 6996	. . 3 ⊢ (𝐾 ∈ V → (Lines‘𝐾) = {𝑠 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})})
32	2, 31	eqtrid 2807	. 2 ⊢ (𝐾 ∈ V → 𝑁 = {𝑠 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})})
33	1, 32	syl 18	1 ⊢ (𝐾 ∈ 𝐵 → 𝑁 = {𝑠 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738   ≠ wne 2955  ∃wrex 3086  {crab 3412  Vcvv 3450  {csn 4584   class class class wbr 5102  ‘cfv 6541  (class class class)co 7422  lecple 17442  joincjn 18492  Atomscatm 40427  Linesclines 40658

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7753

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6496  df-fun 6543  df-fv 6549  df-ov 7425  df-lines 40665

This theorem is used by:  isline  40903