---

Step * 1 of Lemma bexists_nil_lemma


1. f : Top@i
2. T : Top@i
⊢ ∃bx(:T) ∈ []
     f[x] ~ ff
BY
{ Try (RW (AddrC [1] (UnfoldC `bexists` ANDTHENC ReduceC)) 0)⋅ }

1
1. f : Top@i
2. T : Top@i
⊢ ff ~ ff

---

Latex:

---

Latex:

1.  f  :  Top@i
2.  T  :  Top@i
\mvdash{}  \mexists{}\msubb{}x(:T)  \mmember{}  []
          f[x]  \msim{}  ff


By

---

Latex:
Try  (RW  (AddrC  [1]  (UnfoldC  `bexists`  ANDTHENC  ReduceC))  0)\mcdot{}

---

Home Index