Metamath Proof Explorer


Theorem difelsiga

Description: A sigma-algebra is closed under class differences. The proof goes through difunielsiga and unelsiga rather than countable intersection, and so does not use ax-ac . (Contributed by Thierry Arnoux, 13-Sep-2016) (Proof shortened by Vincent Gonzalez, 17-Aug-2026)

Ref Expression
Assertion difelsiga ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ A ∈ S ∧ B ∈ S → A ∖ B ∈ S

Proof

Step Hyp Ref Expression
1 difun1 ⊢ ⋃ S ∖ ⋃ S ∖ A ∪ B = ⋃ S ∖ ⋃ S ∖ A ∖ B
2 1 a1i ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ A ∈ S ∧ B ∈ S → ⋃ S ∖ ⋃ S ∖ A ∪ B = ⋃ S ∖ ⋃ S ∖ A ∖ B
3 simp1 ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ A ∈ S ∧ B ∈ S → S ∈ ⋃ ran ⁡ sigAlgebra
4 simp2 ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ A ∈ S ∧ B ∈ S → A ∈ S
5 elsigass ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ A ∈ S → A ⊆ ⋃ S
6 3 4 5 syl2anc ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ A ∈ S ∧ B ∈ S → A ⊆ ⋃ S
7 dfss4 ⊢ A ⊆ ⋃ S ↔ ⋃ S ∖ ⋃ S ∖ A = A
8 6 7 sylib ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ A ∈ S ∧ B ∈ S → ⋃ S ∖ ⋃ S ∖ A = A
9 8 difeq1d ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ A ∈ S ∧ B ∈ S → ⋃ S ∖ ⋃ S ∖ A ∖ B = A ∖ B
10 2 9 eqtrd ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ A ∈ S ∧ B ∈ S → ⋃ S ∖ ⋃ S ∖ A ∪ B = A ∖ B
11 difunielsiga ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ A ∈ S → ⋃ S ∖ A ∈ S
12 3 4 11 syl2anc ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ A ∈ S ∧ B ∈ S → ⋃ S ∖ A ∈ S
13 simp3 ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ A ∈ S ∧ B ∈ S → B ∈ S
14 unelsiga ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ ⋃ S ∖ A ∈ S ∧ B ∈ S → ⋃ S ∖ A ∪ B ∈ S
15 3 12 13 14 syl3anc ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ A ∈ S ∧ B ∈ S → ⋃ S ∖ A ∪ B ∈ S
16 difunielsiga ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ ⋃ S ∖ A ∪ B ∈ S → ⋃ S ∖ ⋃ S ∖ A ∪ B ∈ S
17 3 15 16 syl2anc ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ A ∈ S ∧ B ∈ S → ⋃ S ∖ ⋃ S ∖ A ∪ B ∈ S
18 10 17 eqeltrrd ⊢ S ∈ ⋃ ran ⁡ sigAlgebra ∧ A ∈ S ∧ B ∈ S → A ∖ B ∈ S