fi1: B → A
}.
-interpretation "logical iff" 'iff x y = (Iff x y).
-
notation "hvbox(a break ⇔ b)" right associative with precedence 25 for @{'iff1 $a $b}.
+interpretation "logical iff" 'iff x y = (Iff x y).
interpretation "logical iff type1" 'iff1 x y = (Iff1 x y).
inductive exT (A:Type0) (P:A→CProp0) : CProp0 ≝
ex_introT: ∀w:A. P w → exT A P.
-
-notation "\ll term 19 a, break term 19 b \gg"
-with precedence 90 for @{'dependent_pair $a $b}.
-interpretation "dependent pair" 'dependent_pair a b =
- (ex_introT _ _ a b).
interpretation "CProp exists" 'exists \eta.x = (exT _ x).