Metamath Proof Explorer


Theorem oninfint

Description: The infimum of a non-empty class of ordinals is the intersection of that class. (Contributed by RP, 23-Jan-2025)

Ref Expression
Assertion oninfint ⊢ A ⊆ On ∧ A ≠ ∅ → inf A On E = ⋂ A

Proof

Step Hyp Ref Expression
1 epweon ⊢ E We On
2 weso ⊢ E We On → E Or On
3 1 2 mp1i ⊢ A ⊆ On ∧ A ≠ ∅ → E Or On
4 oninton ⊢ A ⊆ On ∧ A ≠ ∅ → ⋂ A ∈ On
5 onint ⊢ A ⊆ On ∧ A ≠ ∅ → ⋂ A ∈ A
6 intss1 ⊢ x ∈ A → ⋂ A ⊆ x
7 6 adantl ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ A → ⋂ A ⊆ x
8 simpl ⊢ A ⊆ On ∧ A ≠ ∅ → A ⊆ On
9 8 sselda ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ A → x ∈ On
10 ontri1 ⊢ ⋂ A ∈ On ∧ x ∈ On → ⋂ A ⊆ x ↔ ¬ x ∈ ⋂ A
11 4 9 10 syl2an2r ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ A → ⋂ A ⊆ x ↔ ¬ x ∈ ⋂ A
12 7 11 mpbid ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ A → ¬ x ∈ ⋂ A
13 epelg ⊢ ⋂ A ∈ On → x E ⋂ A ↔ x ∈ ⋂ A
14 4 13 syl ⊢ A ⊆ On ∧ A ≠ ∅ → x E ⋂ A ↔ x ∈ ⋂ A
15 14 adantr ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ A → x E ⋂ A ↔ x ∈ ⋂ A
16 12 15 mtbird ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ A → ¬ x E ⋂ A
17 3 4 5 16 infmin ⊢ A ⊆ On ∧ A ≠ ∅ → inf A On E = ⋂ A