Metamath Proof Explorer


Theorem onnmin

Description: No member of a set of ordinal numbers belongs to its minimum. (Contributed by NM, 2-Feb-1997)

Ref Expression
Assertion onnmin ⊢ A ⊆ On ∧ B ∈ A → ¬ B ∈ ⋂ A

Proof

Step Hyp Ref Expression
1 intss1 ⊢ B ∈ A → ⋂ A ⊆ B
2 1 adantl ⊢ A ⊆ On ∧ B ∈ A → ⋂ A ⊆ B
3 ne0i ⊢ B ∈ A → A ≠ ∅
4 oninton ⊢ A ⊆ On ∧ A ≠ ∅ → ⋂ A ∈ On
5 3 4 sylan2 ⊢ A ⊆ On ∧ B ∈ A → ⋂ A ∈ On
6 ssel2 ⊢ A ⊆ On ∧ B ∈ A → B ∈ On
7 ontri1 ⊢ ⋂ A ∈ On ∧ B ∈ On → ⋂ A ⊆ B ↔ ¬ B ∈ ⋂ A
8 5 6 7 syl2anc ⊢ A ⊆ On ∧ B ∈ A → ⋂ A ⊆ B ↔ ¬ B ∈ ⋂ A
9 2 8 mpbid ⊢ A ⊆ On ∧ B ∈ A → ¬ B ∈ ⋂ A