theory Scratch imports Main begin class a = assumes a: "\(x::'a) y. x \ y" class b = assumes b: "\(x::'a) y. x \ y" instance a \ b sorry lemma assumes "SORT_CONSTRAINT('a::a)" "SORT_CONSTRAINT('b::b)" shows 1: "False \ False" apply (rule conjI) subgoal using a [where 'a = 'a] by auto subgoal using b [where 'a = 'b] by auto done thm_deps 1 \ \uses @{thm classrel_a_b}\ thm_oracles 1 \ \uses \<^ML>\\<^oracle_name>\skip_proof\\\ lemma assumes "SORT_CONSTRAINT('a::{a,b})" \ \normalized to \<^typ>\'a::a\ in abstract syntax!\ shows 2: "False" using a [where 'a = 'a] by auto thm_deps 2 \ \no @{thm classrel_a_b}\ thm_oracles 2 \ \no \<^ML>\\<^oracle_name>\skip_proof\\\ end