Step
*
of Lemma
p-conditional-domain
No Annotations
∀[A,B:Type]. ∀f,g:A ⟶ (B + Top). ∀x:A. (↑can-apply([f?g];x)
⇐⇒ (↑can-apply(f;x)) ∨ (↑can-apply(g;x)))
BY
{ (RepUR ``p-conditional can-apply`` 0 THEN Auto) }
1
1. [A] : Type
2. [B] : Type
3. f : A ⟶ (B + Top)
4. g : A ⟶ (B + Top)
5. x : A
6. ↑isl(if isl(f x) then f x else g x fi )
⊢ (↑isl(f x)) ∨ (↑isl(g x))
Latex:
Latex:
No Annotations
\mforall{}[A,B:Type].
\mforall{}f,g:A {}\mrightarrow{} (B + Top). \mforall{}x:A. (\muparrow{}can-apply([f?g];x) \mLeftarrow{}{}\mRightarrow{} (\muparrow{}can-apply(f;x)) \mvee{} (\muparrow{}can-apply(g;x)))
By
Latex:
(RepUR ``p-conditional can-apply`` 0 THEN Auto)
Home
Index