Metamath Proof Explorer


Theorem wfelirr

Description: A well-founded set is not a member of itself. This proof does not require the axiom of regularity, unlike elirr . (Contributed by Mario Carneiro, 2-Jan-2017)

Ref Expression
Assertion wfelirr ⊢ A ∈ ⋃ R1 On → ¬ A ∈ A

Proof

Step Hyp Ref Expression
1 rankon ⊢ rank ⁡ A ∈ On
2 1 onirri ⊢ ¬ rank ⁡ A ∈ rank ⁡ A
3 rankelb ⊢ A ∈ ⋃ R1 On → A ∈ A → rank ⁡ A ∈ rank ⁡ A
4 2 3 mtoi ⊢ A ∈ ⋃ R1 On → ¬ A ∈ A