For all quantifier

[Berke-Ates]

Is there a way to express a "for all" quantifier in a rule?
For example:

.decl bicycle(id: symbol, tire_id: symbol)
bicycle("B1", "T1").
bicycle("B1", "T2").
bicycle("B2", "T3").
bicycle("B2", "T4").

.decl tire(id: symbol, condition: symbol)
tire("T1", "Good").
tire("T2", "Good").
tire("T3", "Good").
tire("T4", "Flat").

.decl safeBicycle(id: symbol)
// Only safe if every tire in good condition
safeBicycle(id) :- bicycle(id, tid), tire(tid, "Good").

// Should only output "B1"
.output safeBicycle

Assuming we can not change the bicycle and tire relations, is there a way to correctly build the safeBicycle relation?
I got it working by introducing a helper relation, but I wonder if there is a better way:

.decl safeBicycle(id: symbol)
// Only safe if every tire in good condition
safeBicycle(id) :- bicycle(id, _), !unsafeBicycle(id).

// Should only output "B1"
.output safeBicycle

.decl unsafeBicycle(id: symbol)
unsafeBicycle(id) :- bicycle(id, tid), tire(tid, "Flat").

[XiaowenHu96]

I think this is the supposed way in Datalog. You calculate the dual problem: \neg \exists \neg = \forall