diff --git a/compiler/src/dotty/tools/dotc/core/TypeComparer.scala b/compiler/src/dotty/tools/dotc/core/TypeComparer.scala
index 8420049a6446..ffd21eaef5b4 100644
--- a/compiler/src/dotty/tools/dotc/core/TypeComparer.scala
+++ b/compiler/src/dotty/tools/dotc/core/TypeComparer.scala
@@ -3010,20 +3010,9 @@ class TypeComparer(@constructorOnly initctx: Context) extends ConstraintHandling
     def covariantDisjoint(tp1: Type, tp2: Type, tparam: TypeParamInfo): Boolean =
       provablyDisjoint(tp1, tp2, pending) && typeparamCorrespondsToField(cls.appliedRef, tparam)
 
-    // In the invariant case, we also use a stronger notion of disjointness:
-    // we consider fully instantiated types not equal wrt =:= to be disjoint
-    // (under any context). This is fine because it matches the runtime
-    // semantics of pattern matching. To implement a pattern such as
-    // `case Inv[T] => ...`, one needs a type tag for `T` and the compiler
-    // is used at runtime to check it the scrutinee's type is =:= to `T`.
-    // Note that this is currently a theoretical concern since Dotty
-    // doesn't have type tags, meaning that users cannot write patterns
-    // that do type tests on higher kinded types.
+    // In the invariant case, direct type parameter disjointness is enough.
     def invariantDisjoint(tp1: Type, tp2: Type, tparam: TypeParamInfo): Boolean =
-      provablyDisjoint(tp1, tp2, pending) ||
-      !isSameType(tp1, tp2) &&
-      fullyInstantiated(tp1) && // We can only trust a "no" from `isSameType` when
-      fullyInstantiated(tp2)    // both `tp1` and `tp2` are fully instantiated.
+      provablyDisjoint(tp1, tp2, pending)
 
     args1.lazyZip(args2).lazyZip(cls.typeParams).exists {
       (arg1, arg2, tparam) =>