Metamath Proof Explorer


Theorem onintunirab

Description: The intersection of a non-empty class of ordinals is the union of every ordinal less-than-or-equal to every element of that class. (Contributed by RP, 29-Jan-2025)

Ref Expression
Assertion onintunirab ⊢ A ⊆ On ∧ A ≠ ∅ → ⋂ A = ⋃ x ∈ On | ∀ y ∈ A x ⊆ y

Proof

Step Hyp Ref Expression
1 simp3 ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ On ∧ ∀ y ∈ A x ⊆ y → ∀ y ∈ A x ⊆ y
2 ssint ⊢ x ⊆ ⋂ A ↔ ∀ y ∈ A x ⊆ y
3 1 2 sylibr ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ On ∧ ∀ y ∈ A x ⊆ y → x ⊆ ⋂ A
4 simp2 ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ On ∧ ∀ y ∈ A x ⊆ y → x ∈ On
5 oninton ⊢ A ⊆ On ∧ A ≠ ∅ → ⋂ A ∈ On
6 5 3ad2ant1 ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ On ∧ ∀ y ∈ A x ⊆ y → ⋂ A ∈ On
7 onsssuc ⊢ x ∈ On ∧ ⋂ A ∈ On → x ⊆ ⋂ A ↔ x ∈ suc ⁡ ⋂ A
8 4 6 7 syl2anc ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ On ∧ ∀ y ∈ A x ⊆ y → x ⊆ ⋂ A ↔ x ∈ suc ⁡ ⋂ A
9 3 8 mpbid ⊢ A ⊆ On ∧ A ≠ ∅ ∧ x ∈ On ∧ ∀ y ∈ A x ⊆ y → x ∈ suc ⁡ ⋂ A
10 9 rabssdv ⊢ A ⊆ On ∧ A ≠ ∅ → x ∈ On | ∀ y ∈ A x ⊆ y ⊆ suc ⁡ ⋂ A
11 ssrab2 ⊢ x ∈ On | ∀ y ∈ A x ⊆ y ⊆ On
12 11 a1i ⊢ A ⊆ On ∧ A ≠ ∅ → x ∈ On | ∀ y ∈ A x ⊆ y ⊆ On
13 eloni ⊢ ⋂ A ∈ On → Ord ⁡ ⋂ A
14 5 13 syl ⊢ A ⊆ On ∧ A ≠ ∅ → Ord ⁡ ⋂ A
15 ordunisssuc ⊢ x ∈ On | ∀ y ∈ A x ⊆ y ⊆ On ∧ Ord ⁡ ⋂ A → ⋃ x ∈ On | ∀ y ∈ A x ⊆ y ⊆ ⋂ A ↔ x ∈ On | ∀ y ∈ A x ⊆ y ⊆ suc ⁡ ⋂ A
16 12 14 15 syl2anc ⊢ A ⊆ On ∧ A ≠ ∅ → ⋃ x ∈ On | ∀ y ∈ A x ⊆ y ⊆ ⋂ A ↔ x ∈ On | ∀ y ∈ A x ⊆ y ⊆ suc ⁡ ⋂ A
17 10 16 mpbird ⊢ A ⊆ On ∧ A ≠ ∅ → ⋃ x ∈ On | ∀ y ∈ A x ⊆ y ⊆ ⋂ A
18 sseq1 ⊢ x = ⋂ A → x ⊆ y ↔ ⋂ A ⊆ y
19 18 ralbidv ⊢ x = ⋂ A → ∀ y ∈ A x ⊆ y ↔ ∀ y ∈ A ⋂ A ⊆ y
20 intss1 ⊢ y ∈ A → ⋂ A ⊆ y
21 20 rgen ⊢ ∀ y ∈ A ⋂ A ⊆ y
22 21 a1i ⊢ A ⊆ On ∧ A ≠ ∅ → ∀ y ∈ A ⋂ A ⊆ y
23 19 5 22 elrabd ⊢ A ⊆ On ∧ A ≠ ∅ → ⋂ A ∈ x ∈ On | ∀ y ∈ A x ⊆ y
24 unissel ⊢ ⋃ x ∈ On | ∀ y ∈ A x ⊆ y ⊆ ⋂ A ∧ ⋂ A ∈ x ∈ On | ∀ y ∈ A x ⊆ y → ⋃ x ∈ On | ∀ y ∈ A x ⊆ y = ⋂ A
25 17 23 24 syl2anc ⊢ A ⊆ On ∧ A ≠ ∅ → ⋃ x ∈ On | ∀ y ∈ A x ⊆ y = ⋂ A
26 25 eqcomd ⊢ A ⊆ On ∧ A ≠ ∅ → ⋂ A = ⋃ x ∈ On | ∀ y ∈ A x ⊆ y