Metamath Proof Explorer


Theorem onmindif2

Description: The minimum of a class of ordinal numbers is less than the minimum of that class with its minimum removed. (Contributed by NM, 20-Nov-2003)

Ref Expression
Assertion onmindif2 ⊢ A ⊆ On ∧ A ≠ ∅ → ⋂ A ∈ ⋂ A ∖ ⋂ A

Proof

Step Hyp Ref Expression
1 eldifsn ⊢ x ∈ A ∖ ⋂ A ↔ x ∈ A ∧ x ≠ ⋂ A
2 onnmin ⊢ A ⊆ On ∧ x ∈ A → ¬ x ∈ ⋂ A
3 2 adantlr ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ A → ¬ x ∈ ⋂ A
4 oninton ⊢ A ⊆ On ∧ A ≠ ∅ → ⋂ A ∈ On
5 ssel2 ⊢ A ⊆ On ∧ x ∈ A → x ∈ On
6 5 adantlr ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ A → x ∈ On
7 ontri1 ⊢ ⋂ A ∈ On ∧ x ∈ On → ⋂ A ⊆ x ↔ ¬ x ∈ ⋂ A
8 onsseleq ⊢ ⋂ A ∈ On ∧ x ∈ On → ⋂ A ⊆ x ↔ ⋂ A ∈ x ∨ ⋂ A = x
9 7 8 bitr3d ⊢ ⋂ A ∈ On ∧ x ∈ On → ¬ x ∈ ⋂ A ↔ ⋂ A ∈ x ∨ ⋂ A = x
10 4 6 9 syl2an2r ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ A → ¬ x ∈ ⋂ A ↔ ⋂ A ∈ x ∨ ⋂ A = x
11 3 10 mpbid ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ A → ⋂ A ∈ x ∨ ⋂ A = x
12 11 ord ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ A → ¬ ⋂ A ∈ x → ⋂ A = x
13 eqcom ⊢ ⋂ A = x ↔ x = ⋂ A
14 12 13 imbitrdi ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ A → ¬ ⋂ A ∈ x → x = ⋂ A
15 14 necon1ad ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ A → x ≠ ⋂ A → ⋂ A ∈ x
16 15 expimpd ⊢ A ⊆ On ∧ A ≠ ∅ → x ∈ A ∧ x ≠ ⋂ A → ⋂ A ∈ x
17 1 16 biimtrid ⊢ A ⊆ On ∧ A ≠ ∅ → x ∈ A ∖ ⋂ A → ⋂ A ∈ x
18 17 ralrimiv ⊢ A ⊆ On ∧ A ≠ ∅ → ∀ x ∈ A ∖ ⋂ A ⋂ A ∈ x
19 intex ⊢ A ≠ ∅ ↔ ⋂ A ∈ V
20 elintg ⊢ ⋂ A ∈ V → ⋂ A ∈ ⋂ A ∖ ⋂ A ↔ ∀ x ∈ A ∖ ⋂ A ⋂ A ∈ x
21 19 20 sylbi ⊢ A ≠ ∅ → ⋂ A ∈ ⋂ A ∖ ⋂ A ↔ ∀ x ∈ A ∖ ⋂ A ⋂ A ∈ x
22 21 adantl ⊢ A ⊆ On ∧ A ≠ ∅ → ⋂ A ∈ ⋂ A ∖ ⋂ A ↔ ∀ x ∈ A ∖ ⋂ A ⋂ A ∈ x
23 18 22 mpbird ⊢ A ⊆ On ∧ A ≠ ∅ → ⋂ A ∈ ⋂ A ∖ ⋂ A