set f = m |-> H2(n);
let x be object ; :: according to NUMBER06:def 8 :: thesis: (m |-> (Triangle n)) . x is triangular
per cases ( x in dom (m |-> H2(n)) or not x in dom (m |-> H2(n)) ) ;
end;