Theorem sigaclci 34500

Description: A sigma-algebra is closed under countable intersections. Deduction version. (Contributed by Thierry Arnoux, 19-Sep-2016.)

Assertion

Ref	Expression
sigaclci	⊢ (((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) ∧ (𝐴 ≼ ω ∧ 𝐴 ≠ ∅)) → ∩ 𝐴 ∈ 𝑆)

Proof of Theorem sigaclci

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isrnsigau 34495	. . . . . . . 8 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → (𝑆 ⊆ 𝒫 ∪ 𝑆 ∧ (∪ 𝑆 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∪ 𝑆 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))))
2	1	simprd 500	. . . . . . 7 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → (∪ 𝑆 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∪ 𝑆 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆)))
3	2	simp2d 1161	. . . . . 6 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → ∀𝑥 ∈ 𝑆 (∪ 𝑆 ∖ 𝑥) ∈ 𝑆)
4	3	adantr 485	. . . . 5 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → ∀𝑥 ∈ 𝑆 (∪ 𝑆 ∖ 𝑥) ∈ 𝑆)
5		elpwi 4570	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝒫 𝑆 → 𝐴 ⊆ 𝑆)
6		ssrexv 4008	. . . . . . . . . . . 12 ⊢ (𝐴 ⊆ 𝑆 → (∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧) → ∃𝑧 ∈ 𝑆 𝑦 = (∪ 𝑆 ∖ 𝑧)))
7	5, 6	syl 18	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝒫 𝑆 → (∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧) → ∃𝑧 ∈ 𝑆 𝑦 = (∪ 𝑆 ∖ 𝑧)))
8	7	ss2abdv 4020	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝒫 𝑆 → {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ⊆ {𝑦 ∣ ∃𝑧 ∈ 𝑆 𝑦 = (∪ 𝑆 ∖ 𝑧)})
9		isrnsigau 34495	. . . . . . . . . . . . 13 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → (𝑆 ⊆ 𝒫 ∪ 𝑆 ∧ (∪ 𝑆 ∈ 𝑆 ∧ ∀𝑧 ∈ 𝑆 (∪ 𝑆 ∖ 𝑧) ∈ 𝑆 ∧ ∀𝑧 ∈ 𝒫 𝑆(𝑧 ≼ ω → ∪ 𝑧 ∈ 𝑆))))
10	9	simprd 500	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → (∪ 𝑆 ∈ 𝑆 ∧ ∀𝑧 ∈ 𝑆 (∪ 𝑆 ∖ 𝑧) ∈ 𝑆 ∧ ∀𝑧 ∈ 𝒫 𝑆(𝑧 ≼ ω → ∪ 𝑧 ∈ 𝑆)))
11	10	simp2d 1161	. . . . . . . . . . 11 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → ∀𝑧 ∈ 𝑆 (∪ 𝑆 ∖ 𝑧) ∈ 𝑆)
12		uniiunlem 4042	. . . . . . . . . . . 12 ⊢ (∀𝑧 ∈ 𝑆 (∪ 𝑆 ∖ 𝑧) ∈ 𝑆 → (∀𝑧 ∈ 𝑆 (∪ 𝑆 ∖ 𝑧) ∈ 𝑆 ↔ {𝑦 ∣ ∃𝑧 ∈ 𝑆 𝑦 = (∪ 𝑆 ∖ 𝑧)} ⊆ 𝑆))
13	11, 12	syl 18	. . . . . . . . . . 11 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → (∀𝑧 ∈ 𝑆 (∪ 𝑆 ∖ 𝑧) ∈ 𝑆 ↔ {𝑦 ∣ ∃𝑧 ∈ 𝑆 𝑦 = (∪ 𝑆 ∖ 𝑧)} ⊆ 𝑆))
14	11, 13	mpbid 235	. . . . . . . . . 10 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → {𝑦 ∣ ∃𝑧 ∈ 𝑆 𝑦 = (∪ 𝑆 ∖ 𝑧)} ⊆ 𝑆)
15	8, 14	sylan9ssr 3952	. . . . . . . . 9 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ⊆ 𝑆)
16		abrexexg 7959	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝒫 𝑆 → {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ∈ V)
17		elpwg 4566	. . . . . . . . . . 11 ⊢ ({𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ∈ V → ({𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ∈ 𝒫 𝑆 ↔ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ⊆ 𝑆))
18	16, 17	syl 18	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝒫 𝑆 → ({𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ∈ 𝒫 𝑆 ↔ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ⊆ 𝑆))
19	18	adantl 486	. . . . . . . . 9 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → ({𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ∈ 𝒫 𝑆 ↔ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ⊆ 𝑆))
20	15, 19	mpbird 260	. . . . . . . 8 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ∈ 𝒫 𝑆)
21	2	simp3d 1162	. . . . . . . . 9 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))
22	21	adantr 485	. . . . . . . 8 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))
23	20, 22	jca 520	. . . . . . 7 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → ({𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ∈ 𝒫 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆)))
24		abrexdom2jm 32832	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝒫 𝑆 → {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ≼ 𝐴)
25		domtr 9005	. . . . . . . . . 10 ⊢ (({𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ≼ 𝐴 ∧ 𝐴 ≼ ω) → {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ≼ ω)
26	24, 25	sylan 591	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝒫 𝑆 ∧ 𝐴 ≼ ω) → {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ≼ ω)
27	26	ex 417	. . . . . . . 8 ⊢ (𝐴 ∈ 𝒫 𝑆 → (𝐴 ≼ ω → {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ≼ ω))
28	27	adantl 486	. . . . . . 7 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → (𝐴 ≼ ω → {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ≼ ω))
29		breq1 5113	. . . . . . . . 9 ⊢ (𝑥 = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} → (𝑥 ≼ ω ↔ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ≼ ω))
30		unieq 4884	. . . . . . . . . 10 ⊢ (𝑥 = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} → ∪ 𝑥 = ∪ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)})
31	30	eleq1d 2848	. . . . . . . . 9 ⊢ (𝑥 = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} → (∪ 𝑥 ∈ 𝑆 ↔ ∪ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ∈ 𝑆))
32	29, 31	imbi12d 347	. . . . . . . 8 ⊢ (𝑥 = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} → ((𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆) ↔ ({𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ≼ ω → ∪ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ∈ 𝑆)))
33	32	rspcva 3580	. . . . . . 7 ⊢ (({𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ∈ 𝒫 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆)) → ({𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ≼ ω → ∪ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ∈ 𝑆))
34	23, 28, 33	sylsyld 62	. . . . . 6 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → (𝐴 ≼ ω → ∪ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ∈ 𝑆))
35	5	adantl 486	. . . . . . . 8 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → 𝐴 ⊆ 𝑆)
36	11	adantr 485	. . . . . . . 8 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → ∀𝑧 ∈ 𝑆 (∪ 𝑆 ∖ 𝑧) ∈ 𝑆)
37		ssralv 4007	. . . . . . . 8 ⊢ (𝐴 ⊆ 𝑆 → (∀𝑧 ∈ 𝑆 (∪ 𝑆 ∖ 𝑧) ∈ 𝑆 → ∀𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧) ∈ 𝑆))
38	35, 36, 37	sylc 66	. . . . . . 7 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → ∀𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧) ∈ 𝑆)
39		dfiun2g 4995	. . . . . . 7 ⊢ (∀𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧) ∈ 𝑆 → ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧) = ∪ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)})
40		eleq1 2851	. . . . . . 7 ⊢ (∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧) = ∪ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} → (∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧) ∈ 𝑆 ↔ ∪ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ∈ 𝑆))
41	38, 39, 40	3syl 19	. . . . . 6 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → (∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧) ∈ 𝑆 ↔ ∪ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (∪ 𝑆 ∖ 𝑧)} ∈ 𝑆))
42	34, 41	sylibrd 262	. . . . 5 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → (𝐴 ≼ ω → ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧) ∈ 𝑆))
43		difeq2 4076	. . . . . . 7 ⊢ (𝑥 = ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧) → (∪ 𝑆 ∖ 𝑥) = (∪ 𝑆 ∖ ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧)))
44	43	eleq1d 2848	. . . . . 6 ⊢ (𝑥 = ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧) → ((∪ 𝑆 ∖ 𝑥) ∈ 𝑆 ↔ (∪ 𝑆 ∖ ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧)) ∈ 𝑆))
45	44	rspccv 3579	. . . . 5 ⊢ (∀𝑥 ∈ 𝑆 (∪ 𝑆 ∖ 𝑥) ∈ 𝑆 → (∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧) ∈ 𝑆 → (∪ 𝑆 ∖ ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧)) ∈ 𝑆))
46	4, 42, 45	sylsyld 62	. . . 4 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → (𝐴 ≼ ω → (∪ 𝑆 ∖ ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧)) ∈ 𝑆))
47	46	adantrd 496	. . 3 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → ((𝐴 ≼ ω ∧ 𝐴 ≠ ∅) → (∪ 𝑆 ∖ ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧)) ∈ 𝑆))
48	47	imp 411	. 2 ⊢ (((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) ∧ (𝐴 ≼ ω ∧ 𝐴 ≠ ∅)) → (∪ 𝑆 ∖ ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧)) ∈ 𝑆)
49		simpr 489	. . . . . 6 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → 𝐴 ∈ 𝒫 𝑆)
50		pwuni 4912	. . . . . . 7 ⊢ 𝑆 ⊆ 𝒫 ∪ 𝑆
51	5, 50	sstrdi 3950	. . . . . 6 ⊢ (𝐴 ∈ 𝒫 𝑆 → 𝐴 ⊆ 𝒫 ∪ 𝑆)
52		iundifdifd 32884	. . . . . 6 ⊢ (𝐴 ⊆ 𝒫 ∪ 𝑆 → (𝐴 ≠ ∅ → ∩ 𝐴 = (∪ 𝑆 ∖ ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧))))
53	49, 51, 52	3syl 19	. . . . 5 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → (𝐴 ≠ ∅ → ∩ 𝐴 = (∪ 𝑆 ∖ ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧))))
54	53	adantld 495	. . . 4 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → ((𝐴 ≼ ω ∧ 𝐴 ≠ ∅) → ∩ 𝐴 = (∪ 𝑆 ∖ ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧))))
55		eleq1 2851	. . . 4 ⊢ (∩ 𝐴 = (∪ 𝑆 ∖ ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧)) → (∩ 𝐴 ∈ 𝑆 ↔ (∪ 𝑆 ∖ ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧)) ∈ 𝑆))
56	54, 55	syl6 36	. . 3 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) → ((𝐴 ≼ ω ∧ 𝐴 ≠ ∅) → (∩ 𝐴 ∈ 𝑆 ↔ (∪ 𝑆 ∖ ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧)) ∈ 𝑆)))
57	56	imp 411	. 2 ⊢ (((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) ∧ (𝐴 ≼ ω ∧ 𝐴 ≠ ∅)) → (∩ 𝐴 ∈ 𝑆 ↔ (∪ 𝑆 ∖ ∪ 𝑧 ∈ 𝐴 (∪ 𝑆 ∖ 𝑧)) ∈ 𝑆))
58	48, 57	mpbird 260	1 ⊢ (((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆) ∧ (𝐴 ≼ ω ∧ 𝐴 ≠ ∅)) → ∩ 𝐴 ∈ 𝑆)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  {cab 2741   ≠ wne 2958  ∀wral 3079  ∃wrex 3089  Vcvv 3455   ∖ cdif 3903   ⊆ wss 3906  ∅c0 4287  𝒫 cpw 4563  ∪ cuni 4873  ∩ cint 4913  ∪ ciun 4957   class class class wbr 5110  ran crn 5664  ωcom 7863   ≼ cdom 8942  sigAlgebracsiga 34476

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734  ax-ac2 10448

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-int 4914  df-iun 4959  df-iin 4960  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6304  df-ord 6365  df-on 6366  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7987  df-2nd 7988  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-er 8695  df-map 8827  df-en 8945  df-dom 8946  df-card 9926  df-acn 9929  df-ac 10101  df-siga 34477

This theorem is referenced by:  difelsiga  34501  sigapisys  34523