Let L be a first-order language and Φ and Ψ two Σ1 1 L-sentences that cannot be satisfied simultaneously in any finite L-structure. Then obviously the following principle ChainL,Φ,Ψ(n, m) holds: For any chain of finite L-structures C1, . . . , Cm with the universe [n] one of the following conditions must fail: