A restricted signed r-set is a pair (A, f), where A ⊆ [n] = {1, 2, …, n} is an r-set and f is a map from A to [n] with f(i) ≠ i for all i ∈ A. For two restricted signed sets (A, f) and (B, g), we define an order as (A, f) ≤ (B, g) if A ⊆ B and g|A = f. A family $$ \mathcal{A} $$ of restricted signed sets on [n] is an intersecting antichain if for any (A, f), (B, g) ∈ $$ \mathcal{A} $$ , they are incomparable and there exists x ∈ A ∩ B such that f(x) = g(x). In this paper, we first give a LYM-type inequality for any intersecting antichain $$ \mathcal{A} $$ of restricted signed sets, from which we then obtain $$ \left| \mathcal{A} \right| \leqslant \left( {\begin{array}{*{20}c} {n - 1} \\ {r - 1} \\ \end{array} } \right)(n - 1)^{r - 1} $$ if $$ \mathcal{A} $$ consists of restricted signed r-sets on [n]. Unless r = n = 3, equality holds if and only if $$ \mathcal{A} $$ consists of all restricted signed r-sets (A, f) such that x 0 ∈ A and f(x 0) = ɛ 0 for some fixed x 0 ∈ [n], ɛ 0 ∈ [n] / {x 0}.