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

Theorem cdleme29ex 41697
Description: Lemma for cdleme29b 41698. (Compare cdleme25a 41676.) TODO: FIX COMMENT. (Contributed by NM, 7-Feb-2013.)
Hypotheses
Ref Expression
cdleme26.b 𝐵 = (Base‘𝐾)
cdleme26.l ≤ = (le‘𝐾)
cdleme26.j ∨ = (join‘𝐾)
cdleme26.m ∧ = (meet‘𝐾)
cdleme26.a 𝐴 = (Atoms‘𝐾)
cdleme26.h 𝐻 = (LHyp‘𝐾)
cdleme27.u 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdleme27.f 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
cdleme27.z 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊)))
cdleme27.n 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊)))
cdleme27.d 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁))
cdleme27.c 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹)
Assertion
Ref Expression
cdleme29ex ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → ∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (𝐶 ∨ (𝑋 ∧ 𝑊)) ∈ 𝐵))
Distinct variable groups:   𝑢,𝑠,𝑧,𝐴   𝐵,𝑠,𝑢,𝑧   𝑢,𝐹   𝐻,𝑠,𝑧   ∨ ,𝑠,𝑢,𝑧   𝐾,𝑠,𝑧   ≤ ,𝑠,𝑢,𝑧   ∧ ,𝑠,𝑢,𝑧   𝑢,𝑁   𝑃,𝑠,𝑢,𝑧   𝑄,𝑠,𝑢,𝑧   𝑈,𝑠,𝑢,𝑧   𝑊,𝑠,𝑢,𝑧   𝑋,𝑠
Allowed substitution hints:   𝐶(𝑧, 𝑢, 𝑠)   𝐷(𝑧, 𝑢, 𝑠)   𝐹(𝑧, 𝑠)   𝐻(𝑢)   𝐾(𝑢)   𝑁(𝑧, 𝑠)   𝑋(𝑧, 𝑢)   𝑍(𝑧, 𝑢, 𝑠)

Proof of Theorem cdleme29ex
StepHypRef Expression
1 simp11 1222 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2 simp3 1156 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊))
3 cdleme26.b . . . 4 𝐵 = (Base‘𝐾)
4 cdleme26.l . . . 4 ≤ = (le‘𝐾)
5 cdleme26.j . . . 4 ∨ = (join‘𝐾)
6 cdleme26.m . . . 4 ∧ = (meet‘𝐾)
7 cdleme26.a . . . 4 𝐴 = (Atoms‘𝐾)
8 cdleme26.h . . . 4 𝐻 = (LHyp‘𝐾)
93, 4, 5, 6, 7, 8lhpmcvr2 41347 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → ∃𝑠 ∈ 𝐴 (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋))
101, 2, 9syl2anc 596 . 2 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → ∃𝑠 ∈ 𝐴 (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋))
11 simp11l 1303 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝐾 ∈ HL)
1211adantr 486 . . . . . . . 8 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) → 𝐾 ∈ HL)
1312hllatd 40687 . . . . . . 7 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) → 𝐾 ∈ Lat)
14 simp11r 1304 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝑊 ∈ 𝐻)
1514adantr 486 . . . . . . . 8 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) → 𝑊 ∈ 𝐻)
16 simpl12 1268 . . . . . . . 8 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
17 simpl13 1269 . . . . . . . 8 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
18 simpr 490 . . . . . . . 8 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) → (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊))
19 simpl2 1211 . . . . . . . 8 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) → 𝑃 ≠ 𝑄)
20 cdleme27.u . . . . . . . . 9 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
21 cdleme27.f . . . . . . . . 9 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
22 cdleme27.z . . . . . . . . 9 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊)))
23 cdleme27.n . . . . . . . . 9 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊)))
24 cdleme27.d . . . . . . . . 9 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁))
25 cdleme27.c . . . . . . . . 9 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹)
263, 4, 5, 6, 7, 8, 20, 21, 22, 23, 24, 25cdleme27cl 41689 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ 𝑃 ≠ 𝑄)) → 𝐶 ∈ 𝐵)
2712, 15, 16, 17, 18, 19, 26syl222anc 1414 . . . . . . 7 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) → 𝐶 ∈ 𝐵)
28 simpl3l 1247 . . . . . . . 8 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) → 𝑋 ∈ 𝐵)
293, 8lhpbase 41321 . . . . . . . . 9 (𝑊 ∈ 𝐻 → 𝑊 ∈ 𝐵)
3015, 29syl 18 . . . . . . . 8 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) → 𝑊 ∈ 𝐵)
313, 6latmcl 18664 . . . . . . . 8 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑋 ∧ 𝑊) ∈ 𝐵)
3213, 28, 30, 31syl3anc 1399 . . . . . . 7 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) → (𝑋 ∧ 𝑊) ∈ 𝐵)
333, 5latjcl 18663 . . . . . . 7 ((𝐾 ∈ Lat ∧ 𝐶 ∈ 𝐵 ∧ (𝑋 ∧ 𝑊) ∈ 𝐵) → (𝐶 ∨ (𝑋 ∧ 𝑊)) ∈ 𝐵)
3413, 27, 32, 33syl3anc 1399 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) → (𝐶 ∨ (𝑋 ∧ 𝑊)) ∈ 𝐵)
3534expr 462 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑠 ∈ 𝐴) → (¬ 𝑠 ≤ 𝑊 → (𝐶 ∨ (𝑋 ∧ 𝑊)) ∈ 𝐵))
3635adantrd 497 . . . 4 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑠 ∈ 𝐴) → ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → (𝐶 ∨ (𝑋 ∧ 𝑊)) ∈ 𝐵))
3736ancld 560 . . 3 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ 𝑠 ∈ 𝐴) → ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (𝐶 ∨ (𝑋 ∧ 𝑊)) ∈ 𝐵)))
3837reximdva 3179 . 2 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → (∃𝑠 ∈ 𝐴 (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → ∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (𝐶 ∨ (𝑋 ∧ 𝑊)) ∈ 𝐵)))
3910, 38mpd 16 1 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → ∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (𝐶 ∨ (𝑋 ∧ 𝑊)) ∈ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  ifcif 4485   class class class wbr 5108  ‘cfv 6566  ℩crio 7407  (class class class)co 7451  Basecbs 17431  lecple 17479  joincjn 18535  meetcmee 18536  Latclat 18655  Atomscatm 40586  HLchlt 40673  LHypclh 41307
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-iin 4959  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-proset 18518  df-poset 18537  df-plt 18552  df-lub 18568  df-glb 18569  df-join 18570  df-meet 18571  df-p0 18647  df-p1 18648  df-lat 18656  df-clat 18723  df-oposet 40499  df-ol 40501  df-oml 40502  df-covers 40589  df-ats 40590  df-atl 40621  df-cvlat 40645  df-hlat 40674  df-llines 40821  df-lplanes 40822  df-lvols 40823  df-lines 40824  df-psubsp 40826  df-pmap 40827  df-padd 41119  df-lhyp 41311
This theorem is used by:  cdleme29b  41698
  Copyright terms: Public domain W3C validator