Theorem lineset 40323

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 3474	. 2 ⊢ (𝐾 ∈ 𝐵 → 𝐾 ∈ V)
2		lineset.n	. . 3 ⊢ 𝑁 = (Lines‘𝐾)
3		fveq2 6862	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
4		lineset.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
5	3, 4	eqtr4di 2814	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
6		fveq2 6862	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
7		lineset.l	. . . . . . . . . . . . 13 ⊢ ≤ = (le‘𝐾)
8	6, 7	eqtr4di 2814	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
9	8	breqd 5108	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐾 → (𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟) ↔ 𝑝 ≤ (𝑞(join‘𝑘)𝑟)))
10		fveq2 6862	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝐾 → (join‘𝑘) = (join‘𝐾))
11		lineset.j	. . . . . . . . . . . . . 14 ⊢ ∨ = (join‘𝐾)
12	10, 11	eqtr4di 2814	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝐾 → (join‘𝑘) = ∨ )
13	12	oveqd 7408	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝐾 → (𝑞(join‘𝑘)𝑟) = (𝑞 ∨ 𝑟))
14	13	breq2d 5109	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐾 → (𝑝 ≤ (𝑞(join‘𝑘)𝑟) ↔ 𝑝 ≤ (𝑞 ∨ 𝑟)))
15	9, 14	bitrd 281	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟) ↔ 𝑝 ≤ (𝑞 ∨ 𝑟)))
16	5, 15	rabeqbidv 3431	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)} = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})
17	16	eqeq2d 2772	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)} ↔ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}))
18	17	anbi2d 639	. . . . . . 7 ⊢ (𝑘 = 𝐾 → ((𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)}) ↔ (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})))
19	5, 18	rexeqbidv 3336	. . . . . 6 ⊢ (𝑘 = 𝐾 → (∃𝑟 ∈ (Atoms‘𝑘)(𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)}) ↔ ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})))
20	5, 19	rexeqbidv 3336	. . . . 5 ⊢ (𝑘 = 𝐾 → (∃𝑞 ∈ (Atoms‘𝑘)∃𝑟 ∈ (Atoms‘𝑘)(𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)}) ↔ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})))
21	20	abbidv 2827	. . . 4 ⊢ (𝑘 = 𝐾 → {𝑠 ∣ ∃𝑞 ∈ (Atoms‘𝑘)∃𝑟 ∈ (Atoms‘𝑘)(𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)})} = {𝑠 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})})
22		df-lines 40086	. . . 4 ⊢ Lines = (𝑘 ∈ V ↦ {𝑠 ∣ ∃𝑞 ∈ (Atoms‘𝑘)∃𝑟 ∈ (Atoms‘𝑘)(𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ (Atoms‘𝑘) ∣ 𝑝(le‘𝑘)(𝑞(join‘𝑘)𝑟)})})
23	4	fvexi 6876	. . . . 5 ⊢ 𝐴 ∈ V
24		df-sn 4580	. . . . . . 7 ⊢ {{𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}} = {𝑠 ∣ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}}
25		snex 5393	. . . . . . 7 ⊢ {{𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}} ∈ V
26	24, 25	eqeltrri 2858	. . . . . 6 ⊢ {𝑠 ∣ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}} ∈ V
27		simpr 488	. . . . . . 7 ⊢ ((𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}) → 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})
28	27	ss2abi 4017	. . . . . 6 ⊢ {𝑠 ∣ (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})} ⊆ {𝑠 ∣ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}}
29	26, 28	ssexi 5275	. . . . 5 ⊢ {𝑠 ∣ (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})} ∈ V
30	23, 23, 29	ab2rexex2 7956	. . . 4 ⊢ {𝑠 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})} ∈ V
31	21, 22, 30	fvmpt 6970	. . 3 ⊢ (𝐾 ∈ V → (Lines‘𝐾) = {𝑠 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})})
32	2, 31	eqtrid 2808	. 2 ⊢ (𝐾 ∈ V → 𝑁 = {𝑠 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})})
33	1, 32	syl 17	1 ⊢ (𝐾 ∈ 𝐵 → 𝑁 = {𝑠 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑠 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})})

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1559   ∈ wcel 2141  {cab 2739   ≠ wne 2956  ∃wrex 3085  {crab 3413  Vcvv 3453  {csn 4579   class class class wbr 5097  ‘cfv 6516  (class class class)co 7391  lecple 17284  joincjn 18334  Atomscatm 39848  Linesclines 40079

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pr 5387  ax-un 7713

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-iota 6472  df-fun 6518  df-fv 6524  df-ov 7394  df-lines 40086

This theorem is referenced by:  isline  40324