Theorem smflimlem1 47986

Description: Lemma for the proof that the limit of a sequence of sigma-measurable functions is sigma-measurable, Proposition 121F (a) of [Fremlin1] p. 38 . This lemma proves that (𝐷 ∩ 𝐼) is in the subspace sigma-algebra induced by 𝐷. (Contributed by Glauco Siliprandi, 26-Jun-2021.)

Hypotheses

Ref	Expression
smflimlem1.1	⊢ 𝑍 = (ℤ≥‘𝑀)
smflimlem1.2	⊢ (𝜑 → 𝑆 ∈ SAlg)
smflimlem1.3	⊢ 𝐷 = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) ∈ dom ⇝ }
smflimlem1.4	⊢ 𝑃 = (𝑚 ∈ 𝑍, 𝑘 ∈ ℕ ↦ {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))})
smflimlem1.5	⊢ 𝐻 = (𝑚 ∈ 𝑍, 𝑘 ∈ ℕ ↦ (𝐶‘(𝑚𝑃𝑘)))
smflimlem1.6	⊢ 𝐼 = ∩ 𝑘 ∈ ℕ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)(𝑚𝐻𝑘)
smflimlem1.7	⊢ ((𝜑 ∧ 𝑟 ∈ ran 𝑃) → (𝐶‘𝑟) ∈ 𝑟)

Assertion

Ref	Expression
smflimlem1	⊢ (𝜑 → (𝐷 ∩ 𝐼) ∈ (𝑆 ↾t 𝐷))

Distinct variable groups:   𝐶,𝑟   𝑥,𝐹   𝑃,𝑟   𝑆,𝑘,𝑚,𝑛   𝑆,𝑠   𝑛,𝑍,𝑘,𝑚   𝑥,𝑍,𝑚,𝑛   𝜑,𝑘,𝑚,𝑛   𝑘,𝑟,𝑚,𝜑

Allowed substitution hints:   𝜑(𝑥, 𝑠)   𝐴(𝑥, 𝑘, 𝑚, 𝑛, 𝑠, 𝑟)   𝐶(𝑥, 𝑘, 𝑚, 𝑛, 𝑠)   𝐷(𝑥, 𝑘, 𝑚, 𝑛, 𝑠, 𝑟)   𝑃(𝑥, 𝑘, 𝑚, 𝑛, 𝑠)   𝑆(𝑥, 𝑟)   𝐹(𝑘, 𝑚, 𝑛, 𝑠, 𝑟)   𝐻(𝑥, 𝑘, 𝑚, 𝑛, 𝑠, 𝑟)   𝐼(𝑥, 𝑘, 𝑚, 𝑛, 𝑠, 𝑟)   𝑀(𝑥, 𝑘, 𝑚, 𝑛, 𝑠, 𝑟)   𝑍(𝑠, 𝑟)

Proof of Theorem smflimlem1

Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		smflimlem1.2	. 2 ⊢ (𝜑 → 𝑆 ∈ SAlg)
2		smflimlem1.3	. . . 4 ⊢ 𝐷 = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) ∈ dom ⇝ }
3		smflimlem1.1	. . . . . . 7 ⊢ 𝑍 = (ℤ≥‘𝑀)
4		fvex 6921	. . . . . . 7 ⊢ (ℤ≥‘𝑀) ∈ V
5	3, 4	eqeltri 2860	. . . . . 6 ⊢ 𝑍 ∈ V
6		uzssz 13013	. . . . . . . . . . 11 ⊢ (ℤ≥‘𝑀) ⊆ ℤ
7	3	eleq2i 2856	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ 𝑍 ↔ 𝑛 ∈ (ℤ≥‘𝑀))
8	7	biimpi 219	. . . . . . . . . . 11 ⊢ (𝑛 ∈ 𝑍 → 𝑛 ∈ (ℤ≥‘𝑀))
9	6, 8	sselid 3911	. . . . . . . . . 10 ⊢ (𝑛 ∈ 𝑍 → 𝑛 ∈ ℤ)
10		uzid 13007	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ (ℤ≥‘𝑛))
11	9, 10	syl 18	. . . . . . . . 9 ⊢ (𝑛 ∈ 𝑍 → 𝑛 ∈ (ℤ≥‘𝑛))
12	11	ne0d 4291	. . . . . . . 8 ⊢ (𝑛 ∈ 𝑍 → (ℤ≥‘𝑛) ≠ ∅)
13		fvex 6921	. . . . . . . . . . 11 ⊢ (𝐹‘𝑚) ∈ V
14	13	dmex 7945	. . . . . . . . . 10 ⊢ dom (𝐹‘𝑚) ∈ V
15	14	rgenw 3084	. . . . . . . . 9 ⊢ ∀𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∈ V
16	15	a1i 11	. . . . . . . 8 ⊢ (𝑛 ∈ 𝑍 → ∀𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∈ V)
17		iinexg 5313	. . . . . . . 8 ⊢ (((ℤ≥‘𝑛) ≠ ∅ ∧ ∀𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∈ V) → ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∈ V)
18	12, 16, 17	syl2anc 596	. . . . . . 7 ⊢ (𝑛 ∈ 𝑍 → ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∈ V)
19	18	rgen 3082	. . . . . 6 ⊢ ∀𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∈ V
20		iunexg 7999	. . . . . 6 ⊢ ((𝑍 ∈ V ∧ ∀𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∈ V) → ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∈ V)
21	5, 19, 20	mp2an 705	. . . . 5 ⊢ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∈ V
22	21	rabex 5304	. . . 4 ⊢ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) ∈ dom ⇝ } ∈ V
23	2, 22	eqeltri 2860	. . 3 ⊢ 𝐷 ∈ V
24	23	a1i 11	. 2 ⊢ (𝜑 → 𝐷 ∈ V)
25		smflimlem1.6	. . 3 ⊢ 𝐼 = ∩ 𝑘 ∈ ℕ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)(𝑚𝐻𝑘)
26		nnct 14151	. . . . 5 ⊢ ℕ ≼ ω
27	26	a1i 11	. . . 4 ⊢ (𝜑 → ℕ ≼ ω)
28		nnn0 46594	. . . . 5 ⊢ ℕ ≠ ∅
29	28	a1i 11	. . . 4 ⊢ (𝜑 → ℕ ≠ ∅)
30	1	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑆 ∈ SAlg)
31	3	uzct 46285	. . . . . 6 ⊢ 𝑍 ≼ ω
32	31	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑍 ≼ ω)
33	30	adantr 486	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) → 𝑆 ∈ SAlg)
34		eqid 2763	. . . . . . . 8 ⊢ (ℤ≥‘𝑛) = (ℤ≥‘𝑛)
35	34	uzct 46285	. . . . . . 7 ⊢ (ℤ≥‘𝑛) ≼ ω
36	35	a1i 11	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) → (ℤ≥‘𝑛) ≼ ω)
37	12	adantl 487	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) → (ℤ≥‘𝑛) ≠ ∅)
38		simpll 779	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ≥‘𝑛)) → 𝜑)
39	38	adantllr 732	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ≥‘𝑛)) → 𝜑)
40		simpll 779	. . . . . . . 8 ⊢ (((𝑘 ∈ ℕ ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ≥‘𝑛)) → 𝑘 ∈ ℕ)
41	40	adantlll 731	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ≥‘𝑛)) → 𝑘 ∈ ℕ)
42	3	uztrn2 13011	. . . . . . . . . 10 ⊢ ((𝑛 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑛)) → 𝑗 ∈ 𝑍)
43	42	ssd 46302	. . . . . . . . 9 ⊢ (𝑛 ∈ 𝑍 → (ℤ≥‘𝑛) ⊆ 𝑍)
44	43	sselda 3913	. . . . . . . 8 ⊢ ((𝑛 ∈ 𝑍 ∧ 𝑚 ∈ (ℤ≥‘𝑛)) → 𝑚 ∈ 𝑍)
45	44	adantll 727	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ≥‘𝑛)) → 𝑚 ∈ 𝑍)
46		simp3 1156	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ ∧ 𝑚 ∈ 𝑍) → 𝑚 ∈ 𝑍)
47		simp2 1155	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ ∧ 𝑚 ∈ 𝑍) → 𝑘 ∈ ℕ)
48		fvex 6921	. . . . . . . . . 10 ⊢ (𝐶‘(𝑚𝑃𝑘)) ∈ V
49	48	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ ∧ 𝑚 ∈ 𝑍) → (𝐶‘(𝑚𝑃𝑘)) ∈ V)
50		smflimlem1.5	. . . . . . . . . 10 ⊢ 𝐻 = (𝑚 ∈ 𝑍, 𝑘 ∈ ℕ ↦ (𝐶‘(𝑚𝑃𝑘)))
51	50	ovmpt4g 7591	. . . . . . . . 9 ⊢ ((𝑚 ∈ 𝑍 ∧ 𝑘 ∈ ℕ ∧ (𝐶‘(𝑚𝑃𝑘)) ∈ V) → (𝑚𝐻𝑘) = (𝐶‘(𝑚𝑃𝑘)))
52	46, 47, 49, 51	syl3anc 1399	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ ∧ 𝑚 ∈ 𝑍) → (𝑚𝐻𝑘) = (𝐶‘(𝑚𝑃𝑘)))
53		simp1 1154	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ ∧ 𝑚 ∈ 𝑍) → 𝜑)
54		eqid 2763	. . . . . . . . . . . . 13 ⊢ {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} = {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))}
55	54, 1	rabexd 5305	. . . . . . . . . . . 12 ⊢ (𝜑 → {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} ∈ V)
56	53, 55	syl 18	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ ∧ 𝑚 ∈ 𝑍) → {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} ∈ V)
57		smflimlem1.4	. . . . . . . . . . . 12 ⊢ 𝑃 = (𝑚 ∈ 𝑍, 𝑘 ∈ ℕ ↦ {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))})
58	57	ovmpt4g 7591	. . . . . . . . . . 11 ⊢ ((𝑚 ∈ 𝑍 ∧ 𝑘 ∈ ℕ ∧ {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} ∈ V) → (𝑚𝑃𝑘) = {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))})
59	46, 47, 56, 58	syl3anc 1399	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ ∧ 𝑚 ∈ 𝑍) → (𝑚𝑃𝑘) = {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))})
60		ssrab2 4008	. . . . . . . . . 10 ⊢ {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} ⊆ 𝑆
61	59, 60	eqsstrdi 3957	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ ∧ 𝑚 ∈ 𝑍) → (𝑚𝑃𝑘) ⊆ 𝑆)
62	55	ralrimivw 3162	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∀𝑘 ∈ ℕ {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} ∈ V)
63	62	ralrimivw 3162	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑚 ∈ 𝑍 ∀𝑘 ∈ ℕ {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} ∈ V)
64	63	3ad2ant1 1151	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ ∧ 𝑚 ∈ 𝑍) → ∀𝑚 ∈ 𝑍 ∀𝑘 ∈ ℕ {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} ∈ V)
65	57	elrnmpoid 46445	. . . . . . . . . . 11 ⊢ ((𝑚 ∈ 𝑍 ∧ 𝑘 ∈ ℕ ∧ ∀𝑚 ∈ 𝑍 ∀𝑘 ∈ ℕ {𝑠 ∈ 𝑆 ∣ {𝑥 ∈ dom (𝐹‘𝑚) ∣ ((𝐹‘𝑚)‘𝑥) < (𝐴 + (1 / 𝑘))} = (𝑠 ∩ dom (𝐹‘𝑚))} ∈ V) → (𝑚𝑃𝑘) ∈ ran 𝑃)
66	46, 47, 64, 65	syl3anc 1399	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ ∧ 𝑚 ∈ 𝑍) → (𝑚𝑃𝑘) ∈ ran 𝑃)
67		ovex 7476	. . . . . . . . . . 11 ⊢ (𝑚𝑃𝑘) ∈ V
68		eleq1 2852	. . . . . . . . . . . . 13 ⊢ (𝑟 = (𝑚𝑃𝑘) → (𝑟 ∈ ran 𝑃 ↔ (𝑚𝑃𝑘) ∈ ran 𝑃))
69	68	anbi2d 642	. . . . . . . . . . . 12 ⊢ (𝑟 = (𝑚𝑃𝑘) → ((𝜑 ∧ 𝑟 ∈ ran 𝑃) ↔ (𝜑 ∧ (𝑚𝑃𝑘) ∈ ran 𝑃)))
70		fveq2 6908	. . . . . . . . . . . . 13 ⊢ (𝑟 = (𝑚𝑃𝑘) → (𝐶‘𝑟) = (𝐶‘(𝑚𝑃𝑘)))
71		id 23	. . . . . . . . . . . . 13 ⊢ (𝑟 = (𝑚𝑃𝑘) → 𝑟 = (𝑚𝑃𝑘))
72	70, 71	eleq12d 2858	. . . . . . . . . . . 12 ⊢ (𝑟 = (𝑚𝑃𝑘) → ((𝐶‘𝑟) ∈ 𝑟 ↔ (𝐶‘(𝑚𝑃𝑘)) ∈ (𝑚𝑃𝑘)))
73	69, 72	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑟 = (𝑚𝑃𝑘) → (((𝜑 ∧ 𝑟 ∈ ran 𝑃) → (𝐶‘𝑟) ∈ 𝑟) ↔ ((𝜑 ∧ (𝑚𝑃𝑘) ∈ ran 𝑃) → (𝐶‘(𝑚𝑃𝑘)) ∈ (𝑚𝑃𝑘))))
74		smflimlem1.7	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑟 ∈ ran 𝑃) → (𝐶‘𝑟) ∈ 𝑟)
75	67, 73, 74	vtocl 3524	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑚𝑃𝑘) ∈ ran 𝑃) → (𝐶‘(𝑚𝑃𝑘)) ∈ (𝑚𝑃𝑘))
76	53, 66, 75	syl2anc 596	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ ∧ 𝑚 ∈ 𝑍) → (𝐶‘(𝑚𝑃𝑘)) ∈ (𝑚𝑃𝑘))
77	61, 76	sseldd 3914	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ ∧ 𝑚 ∈ 𝑍) → (𝐶‘(𝑚𝑃𝑘)) ∈ 𝑆)
78	52, 77	eqeltrd 2864	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ ∧ 𝑚 ∈ 𝑍) → (𝑚𝐻𝑘) ∈ 𝑆)
79	39, 41, 45, 78	syl3anc 1399	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ≥‘𝑛)) → (𝑚𝐻𝑘) ∈ 𝑆)
80	33, 36, 37, 79	saliincl 47542	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) → ∩ 𝑚 ∈ (ℤ≥‘𝑛)(𝑚𝐻𝑘) ∈ 𝑆)
81	30, 32, 80	saliuncl 47538	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)(𝑚𝐻𝑘) ∈ 𝑆)
82	1, 27, 29, 81	saliincl 47542	. . 3 ⊢ (𝜑 → ∩ 𝑘 ∈ ℕ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)(𝑚𝐻𝑘) ∈ 𝑆)
83	25, 82	eqeltrid 2868	. 2 ⊢ (𝜑 → 𝐼 ∈ 𝑆)
84		incom 4109	. 2 ⊢ (𝐷 ∩ 𝐼) = (𝐼 ∩ 𝐷)
85	1, 24, 83, 84	elrestd 46328	1 ⊢ (𝜑 → (𝐷 ∩ 𝐼) ∈ (𝑆 ↾t 𝐷))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  {crab 3416  Vcvv 3454   ∩ cin 4092  ∅c0 4281  ∪ ciun 4954  ∩ ciin 4955   class class class wbr 5106   ↦ cmpt 5189  dom cdm 5655  ran crn 5656  ‘cfv 6558  (class class class)co 7443   ∈ cmpo 7445  ωcom 7901   ≼ cdom 8999  1c1 11228   + caddc 11230   < clt 11370   / cdiv 12000  ℕcn 12362  ℤcz 12720  ℤ_≥cuz 12992   ⇝ cli 15680   ↾_t crest 17620  SAlgcsalg 47523

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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-inf2 9669  ax-cnex 11283  ax-resscn 11284  ax-1cn 11285  ax-icn 11286  ax-addcl 11287  ax-addrcl 11288  ax-mulcl 11289  ax-mulrcl 11290  ax-mulcom 11291  ax-addass 11292  ax-mulass 11293  ax-distr 11294  ax-i2m1 11295  ax-1ne0 11296  ax-1rid 11297  ax-rnegex 11298  ax-rrecex 11299  ax-cnre 11300  ax-pre-lttri 11301  ax-pre-lttrn 11302  ax-pre-ltadd 11303  ax-pre-mulgt0 11304

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-isom 6567  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-1o 8504  df-oadd 8508  df-omul 8509  df-er 8745  df-map 8877  df-en 9002  df-dom 9003  df-sdom 9004  df-fin 9005  df-oi 9531  df-card 10047  df-acn 10050  df-pnf 11372  df-mnf 11373  df-xr 11374  df-ltxr 11375  df-le 11376  df-sub 11570  df-neg 11571  df-nn 12363  df-n0 12634  df-z 12721  df-uz 12993  df-rest 17622  df-salg 47524

This theorem is used by:  smflimlem5  47990