---

Step * 1 2 2 1 1 1 of Lemma fdl-1-join-irreducible


1. X : Type
2. x : Point(free-dl(X))
3. y : Point(free-dl(X))
⊢ λa,b,c. Ax ∈ (¬↑fdl-is-1(x)) ⇒ (¬↑fdl-is-1(y)) ⇒ (¬↑fdl-is-1(x ∨ y))
BY
{ ((Subst' Point(free-dl(X)) ~ free-dl-type(X) -2 THENA Computation)
   THEN (Subst' Point(free-dl(X)) ~ free-dl-type(X) -1 THENA Computation)
   ) }

1
1. X : Type
2. x : free-dl-type(X)
3. y : free-dl-type(X)
⊢ λa,b,c. Ax ∈ (¬↑fdl-is-1(x)) ⇒ (¬↑fdl-is-1(y)) ⇒ (¬↑fdl-is-1(x ∨ y))

---

Latex:

---

Latex:

1.  X  :  Type
2.  x  :  Point(free-dl(X))
3.  y  :  Point(free-dl(X))
\mvdash{}  \mlambda{}a,b,c.  Ax  \mmember{}  (\mneg{}\muparrow{}fdl-is-1(x))  {}\mRightarrow{}  (\mneg{}\muparrow{}fdl-is-1(y))  {}\mRightarrow{}  (\mneg{}\muparrow{}fdl-is-1(x  \mvee{}  y))


By

---

Latex:
((Subst'  Point(free-dl(X))  \msim{}  free-dl-type(X)  -2  THENA  Computation)
  THEN  (Subst'  Point(free-dl(X))  \msim{}  free-dl-type(X)  -1  THENA  Computation)
  )

---

Home Index