Theorem sigagenval 29530

Description: Value of the generated sigma-algebra. (Contributed by Thierry Arnoux, 27-Dec-2016.)

Assertion

Ref	Expression
sigagenval	⊢ (𝐴 ∈ 𝑉 → (sigaGen‘𝐴) = ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠})

Distinct variable group:   𝐴,𝑠

Allowed substitution hint:   𝑉(𝑠)

Proof of Theorem sigagenval

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-sigagen 29529	. . 3 ⊢ sigaGen = (𝑥 ∈ V ↦ ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝑥) ∣ 𝑥 ⊆ 𝑠})
2	1	a1i 11	. 2 ⊢ (𝐴 ∈ 𝑉 → sigaGen = (𝑥 ∈ V ↦ ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝑥) ∣ 𝑥 ⊆ 𝑠}))
3		unieq 4380	. . . . . 6 ⊢ (𝑥 = 𝐴 → ∪ 𝑥 = ∪ 𝐴)
4	3	fveq2d 6107	. . . . 5 ⊢ (𝑥 = 𝐴 → (sigAlgebra‘∪ 𝑥) = (sigAlgebra‘∪ 𝐴))
5		sseq1 3589	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ 𝑠 ↔ 𝐴 ⊆ 𝑠))
6	4, 5	rabeqbidv 3168	. . . 4 ⊢ (𝑥 = 𝐴 → {𝑠 ∈ (sigAlgebra‘∪ 𝑥) ∣ 𝑥 ⊆ 𝑠} = {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠})
7	6	inteqd 4415	. . 3 ⊢ (𝑥 = 𝐴 → ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝑥) ∣ 𝑥 ⊆ 𝑠} = ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠})
8	7	adantl 481	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 = 𝐴) → ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝑥) ∣ 𝑥 ⊆ 𝑠} = ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠})
9		elex 3185	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
10		uniexg 6853	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → ∪ 𝐴 ∈ V)
11		pwsiga 29520	. . . . . . 7 ⊢ (∪ 𝐴 ∈ V → 𝒫 ∪ 𝐴 ∈ (sigAlgebra‘∪ 𝐴))
12	10, 11	syl 17	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → 𝒫 ∪ 𝐴 ∈ (sigAlgebra‘∪ 𝐴))
13		pwuni 4825	. . . . . 6 ⊢ 𝐴 ⊆ 𝒫 ∪ 𝐴
14	12, 13	jctir 559	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝒫 ∪ 𝐴 ∈ (sigAlgebra‘∪ 𝐴) ∧ 𝐴 ⊆ 𝒫 ∪ 𝐴))
15		sseq2 3590	. . . . . 6 ⊢ (𝑠 = 𝒫 ∪ 𝐴 → (𝐴 ⊆ 𝑠 ↔ 𝐴 ⊆ 𝒫 ∪ 𝐴))
16	15	elrab 3331	. . . . 5 ⊢ (𝒫 ∪ 𝐴 ∈ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠} ↔ (𝒫 ∪ 𝐴 ∈ (sigAlgebra‘∪ 𝐴) ∧ 𝐴 ⊆ 𝒫 ∪ 𝐴))
17	14, 16	sylibr 223	. . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝒫 ∪ 𝐴 ∈ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠})
18		ne0i 3880	. . . 4 ⊢ (𝒫 ∪ 𝐴 ∈ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠} → {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠} ≠ ∅)
19	17, 18	syl 17	. . 3 ⊢ (𝐴 ∈ 𝑉 → {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠} ≠ ∅)
20		intex 4747	. . 3 ⊢ ({𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠} ≠ ∅ ↔ ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠} ∈ V)
21	19, 20	sylib 207	. 2 ⊢ (𝐴 ∈ 𝑉 → ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠} ∈ V)
22	2, 8, 9, 21	fvmptd 6197	1 ⊢ (𝐴 ∈ 𝑉 → (sigaGen‘𝐴) = ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠})

Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  {crab 2900  Vcvv 3173   ⊆ wss 3540  ∅c0 3874  𝒫 cpw 4108  ∪ cuni 4372  ∩ cint 4410   ↦ cmpt 4643  ‘cfv 5804  sigAlgebracsiga 29497  sigaGencsigagen 29528

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-int 4411  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-iota 5768  df-fun 5806  df-fv 5812  df-siga 29498  df-sigagen 29529

This theorem is referenced by:  sigagensiga  29531  sssigagen  29535  sigagenss  29539