---

Step * of Lemma satisfiable-full-omega-tt

∀[fmla:int_formula()]. ↑isl(full-omega(fmla)) supposing satisfiable_int_formula(fmla)
BY
{ ((D 0 THENA Auto)
   THEN (GenConclTerm ⌜full-omega(fmla)⌝⋅ THENA Auto)
   THEN D -2
   THEN BoolCase ⌜v⌝⋅
   THEN Auto
   THEN D -3
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[fmla:int\_formula()].  \muparrow{}isl(full-omega(fmla))  supposing  satisfiable\_int\_formula(fmla)


By

---

Latex:
((D  0  THENA  Auto)
  THEN  (GenConclTerm  \mkleeneopen{}full-omega(fmla)\mkleeneclose{}\mcdot{}  THENA  Auto)
  THEN  D  -2
  THEN  BoolCase  \mkleeneopen{}v\mkleeneclose{}\mcdot{}
  THEN  Auto
  THEN  D  -3
  THEN  Auto)

---

Home Index