Theorem dfsalgen2 43880

Description: Alternate characterization of the sigma-algebra generated by a set. It is the smallest sigma-algebra, on the same base set, that includes the set. (Contributed by Glauco Siliprandi, 3-Jan-2021.)

Hypothesis

Ref	Expression
dfsalgen2.1	⊢ (𝜑 → 𝑋 ∈ 𝑉)

Assertion

Ref	Expression
dfsalgen2	⊢ (𝜑 → ((SalGen‘𝑋) = 𝑆 ↔ ((𝑆 ∈ SAlg ∧ ∪ 𝑆 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑆) ∧ ∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦))))

Distinct variable groups:   𝑦,𝑆   𝑦,𝑋   𝜑,𝑦

Allowed substitution hint:   𝑉(𝑦)

Proof of Theorem dfsalgen2

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 22	. . . . . . . 8 ⊢ ((SalGen‘𝑋) = 𝑆 → (SalGen‘𝑋) = 𝑆)
2	1	eqcomd 2744	. . . . . . 7 ⊢ ((SalGen‘𝑋) = 𝑆 → 𝑆 = (SalGen‘𝑋))
3	2	adantl 482	. . . . . 6 ⊢ ((𝜑 ∧ (SalGen‘𝑋) = 𝑆) → 𝑆 = (SalGen‘𝑋))
4		dfsalgen2.1	. . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
5		salgencl 43871	. . . . . . . 8 ⊢ (𝑋 ∈ 𝑉 → (SalGen‘𝑋) ∈ SAlg)
6	4, 5	syl 17	. . . . . . 7 ⊢ (𝜑 → (SalGen‘𝑋) ∈ SAlg)
7	6	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ (SalGen‘𝑋) = 𝑆) → (SalGen‘𝑋) ∈ SAlg)
8	3, 7	eqeltrd 2839	. . . . 5 ⊢ ((𝜑 ∧ (SalGen‘𝑋) = 𝑆) → 𝑆 ∈ SAlg)
9		unieq 4850	. . . . . . 7 ⊢ ((SalGen‘𝑋) = 𝑆 → ∪ (SalGen‘𝑋) = ∪ 𝑆)
10	9	adantl 482	. . . . . 6 ⊢ ((𝜑 ∧ (SalGen‘𝑋) = 𝑆) → ∪ (SalGen‘𝑋) = ∪ 𝑆)
11	4	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (SalGen‘𝑋) = 𝑆) → 𝑋 ∈ 𝑉)
12		eqid 2738	. . . . . . 7 ⊢ (SalGen‘𝑋) = (SalGen‘𝑋)
13		eqid 2738	. . . . . . 7 ⊢ ∪ 𝑋 = ∪ 𝑋
14	11, 12, 13	salgenuni 43876	. . . . . 6 ⊢ ((𝜑 ∧ (SalGen‘𝑋) = 𝑆) → ∪ (SalGen‘𝑋) = ∪ 𝑋)
15	10, 14	eqtr3d 2780	. . . . 5 ⊢ ((𝜑 ∧ (SalGen‘𝑋) = 𝑆) → ∪ 𝑆 = ∪ 𝑋)
16	12	sssalgen 43874	. . . . . . 7 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ⊆ (SalGen‘𝑋))
17	11, 16	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ (SalGen‘𝑋) = 𝑆) → 𝑋 ⊆ (SalGen‘𝑋))
18		simpr 485	. . . . . 6 ⊢ ((𝜑 ∧ (SalGen‘𝑋) = 𝑆) → (SalGen‘𝑋) = 𝑆)
19	17, 18	sseqtrd 3961	. . . . 5 ⊢ ((𝜑 ∧ (SalGen‘𝑋) = 𝑆) → 𝑋 ⊆ 𝑆)
20	8, 15, 19	3jca 1127	. . . 4 ⊢ ((𝜑 ∧ (SalGen‘𝑋) = 𝑆) → (𝑆 ∈ SAlg ∧ ∪ 𝑆 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑆))
21	3	ad2antrr 723	. . . . . . . 8 ⊢ ((((𝜑 ∧ (SalGen‘𝑋) = 𝑆) ∧ 𝑦 ∈ SAlg) ∧ 𝑋 ⊆ 𝑦) → 𝑆 = (SalGen‘𝑋))
22	21	adantrl 713	. . . . . . 7 ⊢ ((((𝜑 ∧ (SalGen‘𝑋) = 𝑆) ∧ 𝑦 ∈ SAlg) ∧ (∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦)) → 𝑆 = (SalGen‘𝑋))
23	11	ad2antrr 723	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (SalGen‘𝑋) = 𝑆) ∧ 𝑦 ∈ SAlg) ∧ 𝑋 ⊆ 𝑦) → 𝑋 ∈ 𝑉)
24	23	adantrl 713	. . . . . . . 8 ⊢ ((((𝜑 ∧ (SalGen‘𝑋) = 𝑆) ∧ 𝑦 ∈ SAlg) ∧ (∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦)) → 𝑋 ∈ 𝑉)
25		simplr 766	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (SalGen‘𝑋) = 𝑆) ∧ 𝑦 ∈ SAlg) ∧ 𝑋 ⊆ 𝑦) → 𝑦 ∈ SAlg)
26	25	adantrl 713	. . . . . . . 8 ⊢ ((((𝜑 ∧ (SalGen‘𝑋) = 𝑆) ∧ 𝑦 ∈ SAlg) ∧ (∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦)) → 𝑦 ∈ SAlg)
27		simpr 485	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (SalGen‘𝑋) = 𝑆) ∧ 𝑦 ∈ SAlg) ∧ 𝑋 ⊆ 𝑦) → 𝑋 ⊆ 𝑦)
28	27	adantrl 713	. . . . . . . 8 ⊢ ((((𝜑 ∧ (SalGen‘𝑋) = 𝑆) ∧ 𝑦 ∈ SAlg) ∧ (∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦)) → 𝑋 ⊆ 𝑦)
29		simprl 768	. . . . . . . 8 ⊢ ((((𝜑 ∧ (SalGen‘𝑋) = 𝑆) ∧ 𝑦 ∈ SAlg) ∧ (∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦)) → ∪ 𝑦 = ∪ 𝑋)
30	24, 12, 26, 28, 29	salgenss 43875	. . . . . . 7 ⊢ ((((𝜑 ∧ (SalGen‘𝑋) = 𝑆) ∧ 𝑦 ∈ SAlg) ∧ (∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦)) → (SalGen‘𝑋) ⊆ 𝑦)
31	22, 30	eqsstrd 3959	. . . . . 6 ⊢ ((((𝜑 ∧ (SalGen‘𝑋) = 𝑆) ∧ 𝑦 ∈ SAlg) ∧ (∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦)) → 𝑆 ⊆ 𝑦)
32	31	ex 413	. . . . 5 ⊢ (((𝜑 ∧ (SalGen‘𝑋) = 𝑆) ∧ 𝑦 ∈ SAlg) → ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦))
33	32	ralrimiva 3103	. . . 4 ⊢ ((𝜑 ∧ (SalGen‘𝑋) = 𝑆) → ∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦))
34	20, 33	jca 512	. . 3 ⊢ ((𝜑 ∧ (SalGen‘𝑋) = 𝑆) → ((𝑆 ∈ SAlg ∧ ∪ 𝑆 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑆) ∧ ∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦)))
35	34	ex 413	. 2 ⊢ (𝜑 → ((SalGen‘𝑋) = 𝑆 → ((𝑆 ∈ SAlg ∧ ∪ 𝑆 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑆) ∧ ∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦))))
36	4	adantr 481	. . . 4 ⊢ ((𝜑 ∧ ((𝑆 ∈ SAlg ∧ ∪ 𝑆 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑆) ∧ ∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦))) → 𝑋 ∈ 𝑉)
37		simprl1 1217	. . . 4 ⊢ ((𝜑 ∧ ((𝑆 ∈ SAlg ∧ ∪ 𝑆 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑆) ∧ ∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦))) → 𝑆 ∈ SAlg)
38		simprl2 1218	. . . 4 ⊢ ((𝜑 ∧ ((𝑆 ∈ SAlg ∧ ∪ 𝑆 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑆) ∧ ∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦))) → ∪ 𝑆 = ∪ 𝑋)
39		simprl3 1219	. . . 4 ⊢ ((𝜑 ∧ ((𝑆 ∈ SAlg ∧ ∪ 𝑆 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑆) ∧ ∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦))) → 𝑋 ⊆ 𝑆)
40		unieq 4850	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑤 → ∪ 𝑦 = ∪ 𝑤)
41	40	eqeq1d 2740	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑤 → (∪ 𝑦 = ∪ 𝑋 ↔ ∪ 𝑤 = ∪ 𝑋))
42		sseq2 3947	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑤 → (𝑋 ⊆ 𝑦 ↔ 𝑋 ⊆ 𝑤))
43	41, 42	anbi12d 631	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑤 → ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) ↔ (∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤)))
44		sseq2 3947	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑤 → (𝑆 ⊆ 𝑦 ↔ 𝑆 ⊆ 𝑤))
45	43, 44	imbi12d 345	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑤 → (((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦) ↔ ((∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤) → 𝑆 ⊆ 𝑤)))
46	45	cbvralvw 3383	. . . . . . . . . . 11 ⊢ (∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦) ↔ ∀𝑤 ∈ SAlg ((∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤) → 𝑆 ⊆ 𝑤))
47	46	biimpi 215	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦) → ∀𝑤 ∈ SAlg ((∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤) → 𝑆 ⊆ 𝑤))
48	47	adantr 481	. . . . . . . . 9 ⊢ ((∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦) ∧ 𝑤 ∈ SAlg) → ∀𝑤 ∈ SAlg ((∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤) → 𝑆 ⊆ 𝑤))
49		simpr 485	. . . . . . . . 9 ⊢ ((∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦) ∧ 𝑤 ∈ SAlg) → 𝑤 ∈ SAlg)
50	48, 49	jca 512	. . . . . . . 8 ⊢ ((∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦) ∧ 𝑤 ∈ SAlg) → (∀𝑤 ∈ SAlg ((∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤) → 𝑆 ⊆ 𝑤) ∧ 𝑤 ∈ SAlg))
51	50	3ad2antr1 1187	. . . . . . 7 ⊢ ((∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦) ∧ (𝑤 ∈ SAlg ∧ ∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤)) → (∀𝑤 ∈ SAlg ((∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤) → 𝑆 ⊆ 𝑤) ∧ 𝑤 ∈ SAlg))
52		3simpc 1149	. . . . . . . 8 ⊢ ((𝑤 ∈ SAlg ∧ ∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤) → (∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤))
53	52	adantl 482	. . . . . . 7 ⊢ ((∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦) ∧ (𝑤 ∈ SAlg ∧ ∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤)) → (∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤))
54		rspa 3132	. . . . . . 7 ⊢ ((∀𝑤 ∈ SAlg ((∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤) → 𝑆 ⊆ 𝑤) ∧ 𝑤 ∈ SAlg) → ((∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤) → 𝑆 ⊆ 𝑤))
55	51, 53, 54	sylc 65	. . . . . 6 ⊢ ((∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦) ∧ (𝑤 ∈ SAlg ∧ ∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤)) → 𝑆 ⊆ 𝑤)
56	55	adantll 711	. . . . 5 ⊢ ((((𝑆 ∈ SAlg ∧ ∪ 𝑆 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑆) ∧ ∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦)) ∧ (𝑤 ∈ SAlg ∧ ∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤)) → 𝑆 ⊆ 𝑤)
57	56	adantll 711	. . . 4 ⊢ (((𝜑 ∧ ((𝑆 ∈ SAlg ∧ ∪ 𝑆 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑆) ∧ ∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦))) ∧ (𝑤 ∈ SAlg ∧ ∪ 𝑤 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑤)) → 𝑆 ⊆ 𝑤)
58	36, 37, 38, 39, 57	issalgend 43877	. . 3 ⊢ ((𝜑 ∧ ((𝑆 ∈ SAlg ∧ ∪ 𝑆 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑆) ∧ ∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦))) → (SalGen‘𝑋) = 𝑆)
59	58	ex 413	. 2 ⊢ (𝜑 → (((𝑆 ∈ SAlg ∧ ∪ 𝑆 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑆) ∧ ∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦)) → (SalGen‘𝑋) = 𝑆))
60	35, 59	impbid 211	1 ⊢ (𝜑 → ((SalGen‘𝑋) = 𝑆 ↔ ((𝑆 ∈ SAlg ∧ ∪ 𝑆 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑆) ∧ ∀𝑦 ∈ SAlg ((∪ 𝑦 = ∪ 𝑋 ∧ 𝑋 ⊆ 𝑦) → 𝑆 ⊆ 𝑦))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106  ∀wral 3064   ⊆ wss 3887  ∪ cuni 4839  ‘cfv 6433  SAlgcsalg 43849  SalGencsalgen 43853

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-iota 6391  df-fun 6435  df-fv 6441  df-salg 43850  df-salgen 43854

This theorem is referenced by:  unisalgen2  43893