Nuprl Definition : inverse-letters
a = -b ==
∃x:X. (((a = (inl x) ∈ (X + X)) ∧ (b = (inr x ) ∈ (X + X))) ∨ ((a = (inr x ) ∈ (X + X)) ∧ (b = (inl x) ∈ (X + X))))
Definitions occuring in Statement :
exists: ∃x:A. B[x],
or: P ∨ Q,
and: P ∧ Q,
inr: inr x ,
inl: inl x,
union: left + right,
equal: s = t ∈ T
Definitions occuring in definition :
exists: ∃x:A. B[x],
or: P ∨ Q,
and: P ∧ Q,
inr: inr x ,
equal: s = t ∈ T,
union: left + right,
inl: inl x
FDL editor aliases :
inverse-letters
Latex:
a = -b == \mexists{}x:X. (((a = (inl x)) \mwedge{} (b = (inr x ))) \mvee{} ((a = (inr x )) \mwedge{} (b = (inl x))))
Date html generated:
2020_05_20-AM-08_21_41
Last ObjectModification:
2017_01_13-PM-10_04_57
Theory : free!groups
Home
Index