Is it a Self-divisor? Task
Write a function or program that takes n as a parameter and prints the first n self-divisors.
Definition of Self-divisor
A positive integer is called a “self-divisor” if every decimal digit of the number is a divisor of the number, that is, the number is evenly divisible by each and every one of its digits.
Example
For example, the number 128 is a self-divisor because it is evenly divisible by 1, 2, and 8. However, 26 is not a self-divisor because it is not evenly divisible by the digit 6. Note that 0 is not considered to be a divisor of any number, so any number containing a 0 digit is NOT a self-divisor. There are infinitely many self-divisors.
Scoring
This is code-golf, so the shortest answer in bytes wins
05AB1E, 16 bytes

05AB1E probably has some sort of slice, but I failed to find it.

∞ʒDSÖß}ʒ0å_}ηs&lt;è


Try it online!

Explanation

∞                [1, 2, 3, ...]
 ʒ               Filter all that satisfies:
  DS                 its DigitS
    Ö                is divisible
     ß}              ßy the original number.
       ʒ         Filter out ^ that satisfies:
        0å_}         0 is å digit of the output.
            ηs&lt;è Trunctuatè by the input.