Metamath Proof Explorer


Theorem fnejoin1

Description: Join of equivalence classes under the fineness relation-part one. (Contributed by Jeff Hankins, 8-Oct-2009) (Proof shortened by Mario Carneiro, 12-Sep-2015)

Ref Expression
Assertion fnejoin1 ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → A Fne if S = ∅ X ⋃ S

Proof

Step Hyp Ref Expression
1 elssuni ⊢ A ∈ S → A ⊆ ⋃ S
2 1 3ad2ant3 ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → A ⊆ ⋃ S
3 2 unissd ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → ⋃ A ⊆ ⋃ ⋃ S
4 eqimss2 ⊢ X = ⋃ y → ⋃ y ⊆ X
5 sspwuni ⊢ y ⊆ 𝒫 X ↔ ⋃ y ⊆ X
6 4 5 sylibr ⊢ X = ⋃ y → y ⊆ 𝒫 X
7 6 ralimi ⊢ ∀ y ∈ S X = ⋃ y → ∀ y ∈ S y ⊆ 𝒫 X
8 7 3ad2ant2 ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → ∀ y ∈ S y ⊆ 𝒫 X
9 unissb ⊢ ⋃ S ⊆ 𝒫 X ↔ ∀ y ∈ S y ⊆ 𝒫 X
10 8 9 sylibr ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → ⋃ S ⊆ 𝒫 X
11 sspwuni ⊢ ⋃ S ⊆ 𝒫 X ↔ ⋃ ⋃ S ⊆ X
12 10 11 sylib ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → ⋃ ⋃ S ⊆ X
13 unieq ⊢ y = A → ⋃ y = ⋃ A
14 13 eqeq2d ⊢ y = A → X = ⋃ y ↔ X = ⋃ A
15 14 rspccva ⊢ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → X = ⋃ A
16 15 3adant1 ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → X = ⋃ A
17 12 16 sseqtrd ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → ⋃ ⋃ S ⊆ ⋃ A
18 3 17 eqssd ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → ⋃ A = ⋃ ⋃ S
19 pwexg ⊢ X ∈ V → 𝒫 X ∈ V
20 19 3ad2ant1 ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → 𝒫 X ∈ V
21 20 10 ssexd ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → ⋃ S ∈ V
22 bastg ⊢ ⋃ S ∈ V → ⋃ S ⊆ topGen ⁡ ⋃ S
23 21 22 syl ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → ⋃ S ⊆ topGen ⁡ ⋃ S
24 2 23 sstrd ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → A ⊆ topGen ⁡ ⋃ S
25 eqid ⊢ ⋃ A = ⋃ A
26 eqid ⊢ ⋃ ⋃ S = ⋃ ⋃ S
27 25 26 isfne4 ⊢ A Fne ⋃ S ↔ ⋃ A = ⋃ ⋃ S ∧ A ⊆ topGen ⁡ ⋃ S
28 18 24 27 sylanbrc ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → A Fne ⋃ S
29 ne0i ⊢ A ∈ S → S ≠ ∅
30 29 3ad2ant3 ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → S ≠ ∅
31 ifnefalse ⊢ S ≠ ∅ → if S = ∅ X ⋃ S = ⋃ S
32 30 31 syl ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → if S = ∅ X ⋃ S = ⋃ S
33 28 32 breqtrrd ⊢ X ∈ V ∧ ∀ y ∈ S X = ⋃ y ∧ A ∈ S → A Fne if S = ∅ X ⋃ S