---

Step * 1 1 1 of Lemma Russell-theorem-take2


1. Type ∈ Type@i'
2. T : Type ⋂ Base@i
⊢ ¬(T ∈ T) ∈ Type
BY
{ (MemCD THEN RW (AddrC [2] UnfoldTopAbC) 0 THEN BLemma `equal-wf-base` THEN Auto) }

---

Latex:

---

Latex:

1.  Type  \mmember{}  Type@i'
2.  T  :  Type  \mcap{}  Base@i
\mvdash{}  \mneg{}(T  \mmember{}  T)  \mmember{}  Type


By

---

Latex:
(MemCD  THEN  RW  (AddrC  [2]  UnfoldTopAbC)  0  THEN  BLemma  `equal-wf-base`  THEN  Auto)

---

Home Index