Theorem issald 47616

Description: Sufficient condition to prove that 𝑆 is sigma-algebra. (Contributed by Glauco Siliprandi, 3-Jan-2021.)

Hypotheses

Ref	Expression
issald.s	⊢ (𝜑 → 𝑆 ∈ 𝑉)
issald.z	⊢ (𝜑 → ∅ ∈ 𝑆)
issald.x	⊢ 𝑋 = ∪ 𝑆
issald.d	⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (𝑋 ∖ 𝑦) ∈ 𝑆)
issald.u	⊢ ((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) → ∪ 𝑦 ∈ 𝑆)

Assertion

Ref	Expression
issald	⊢ (𝜑 → 𝑆 ∈ SAlg)

Distinct variable groups:   𝑦,𝑆   𝜑,𝑦

Allowed substitution hints:   𝑉(𝑦)   𝑋(𝑦)

Proof of Theorem issald

Step	Hyp	Ref	Expression
1		issald.z	. 2 ⊢ (𝜑 → ∅ ∈ 𝑆)
2		issald.x	. . . . . 6 ⊢ 𝑋 = ∪ 𝑆
3	2	eqcomi 2772	. . . . 5 ⊢ ∪ 𝑆 = 𝑋
4	3	difeq1i 4062	. . . 4 ⊢ (∪ 𝑆 ∖ 𝑦) = (𝑋 ∖ 𝑦)
5		issald.d	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (𝑋 ∖ 𝑦) ∈ 𝑆)
6	4, 5	eqeltrid 2868	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (∪ 𝑆 ∖ 𝑦) ∈ 𝑆)
7	6	ralrimiva 3158	. 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝑆 (∪ 𝑆 ∖ 𝑦) ∈ 𝑆)
8		issald.u	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) → ∪ 𝑦 ∈ 𝑆)
9	8	3expia 1139	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆) → (𝑦 ≼ ω → ∪ 𝑦 ∈ 𝑆))
10	9	ralrimiva 3158	. 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝒫 𝑆(𝑦 ≼ ω → ∪ 𝑦 ∈ 𝑆))
11		issald.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑉)
12		issal 47597	. . 3 ⊢ (𝑆 ∈ 𝑉 → (𝑆 ∈ SAlg ↔ (∅ ∈ 𝑆 ∧ ∀𝑦 ∈ 𝑆 (∪ 𝑆 ∖ 𝑦) ∈ 𝑆 ∧ ∀𝑦 ∈ 𝒫 𝑆(𝑦 ≼ ω → ∪ 𝑦 ∈ 𝑆))))
13	11, 12	syl 18	. 2 ⊢ (𝜑 → (𝑆 ∈ SAlg ↔ (∅ ∈ 𝑆 ∧ ∀𝑦 ∈ 𝑆 (∪ 𝑆 ∖ 𝑦) ∈ 𝑆 ∧ ∀𝑦 ∈ 𝒫 𝑆(𝑦 ≼ ω → ∪ 𝑦 ∈ 𝑆))))
14	1, 7, 10, 13	mpbir3and 1361	1 ⊢ (𝜑 → 𝑆 ∈ SAlg)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ∖ cdif 4048  ∅c0 4281  𝒫 cpw 4560  ∪ cuni 4872   class class class wbr 5108  ωcom 7911   ≼ cdom 9009  SAlgcsalg 47591

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-pw 4562  df-uni 4873  df-salg 47592

This theorem is used by:  salexct  47617  issalnnd  47628