Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  smfpimcc Structured version   Visualization version   GIF version

Theorem smfpimcc 43880
Description: Given a countable set of sigma-measurable functions, and a Borel set 𝐴 there exists a choice function that, for each measurable function, chooses a measurable set that, when intersected with the function's domain, gives the preimage of 𝐴. This is a generalization of the observation at the beginning of the proof of Proposition 121F of [Fremlin1] p. 39 . The statement would also be provable for uncountable sets, but in most cases it will suffice to consider the countable case, and only the axiom of countable choice will be needed. (Contributed by Glauco Siliprandi, 23-Oct-2021.)
Hypotheses
Ref Expression
smfpimcc.1 𝑛𝐹
smfpimcc.z 𝑍 = (ℤ𝑀)
smfpimcc.s (𝜑𝑆 ∈ SAlg)
smfpimcc.f (𝜑𝐹:𝑍⟶(SMblFn‘𝑆))
smfpimcc.j 𝐽 = (topGen‘ran (,))
smfpimcc.b 𝐵 = (SalGen‘𝐽)
smfpimcc.a (𝜑𝐴𝐵)
Assertion
Ref Expression
smfpimcc (𝜑 → ∃(:𝑍𝑆 ∧ ∀𝑛𝑍 ((𝐹𝑛) “ 𝐴) = ((𝑛) ∩ dom (𝐹𝑛))))
Distinct variable groups:   𝐴,,𝑛   ,𝐹   𝑆,   ,𝑍,𝑛
Allowed substitution hints:   𝜑(,𝑛)   𝐵(,𝑛)   𝑆(𝑛)   𝐹(𝑛)   𝐽(,𝑛)   𝑀(,𝑛)

Proof of Theorem smfpimcc
Dummy variables 𝑓 𝑚 𝑠 𝑤 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 smfpimcc.z . . . . . . 7 𝑍 = (ℤ𝑀)
21uzct 42149 . . . . . 6 𝑍 ≼ ω
32a1i 11 . . . . 5 (𝜑𝑍 ≼ ω)
4 mptct 10038 . . . . 5 (𝑍 ≼ ω → (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))}) ≼ ω)
5 rnct 10025 . . . . 5 ((𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))}) ≼ ω → ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))}) ≼ ω)
63, 4, 53syl 18 . . . 4 (𝜑 → ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))}) ≼ ω)
7 vex 3402 . . . . . . . 8 𝑦 ∈ V
8 eqid 2738 . . . . . . . . 9 (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))}) = (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})
98elrnmpt 5799 . . . . . . . 8 (𝑦 ∈ V → (𝑦 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))}) ↔ ∃𝑚𝑍 𝑦 = {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))}))
107, 9ax-mp 5 . . . . . . 7 (𝑦 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))}) ↔ ∃𝑚𝑍 𝑦 = {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})
1110biimpi 219 . . . . . 6 (𝑦 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))}) → ∃𝑚𝑍 𝑦 = {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})
1211adantl 485 . . . . 5 ((𝜑𝑦 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})) → ∃𝑚𝑍 𝑦 = {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})
13 simp3 1139 . . . . . . . . 9 ((𝜑𝑚𝑍𝑦 = {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))}) → 𝑦 = {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})
14 smfpimcc.s . . . . . . . . . . . . . 14 (𝜑𝑆 ∈ SAlg)
1514adantr 484 . . . . . . . . . . . . 13 ((𝜑𝑚𝑍) → 𝑆 ∈ SAlg)
16 smfpimcc.f . . . . . . . . . . . . . 14 (𝜑𝐹:𝑍⟶(SMblFn‘𝑆))
1716ffvelrnda 6861 . . . . . . . . . . . . 13 ((𝜑𝑚𝑍) → (𝐹𝑚) ∈ (SMblFn‘𝑆))
18 eqid 2738 . . . . . . . . . . . . 13 dom (𝐹𝑚) = dom (𝐹𝑚)
19 smfpimcc.j . . . . . . . . . . . . 13 𝐽 = (topGen‘ran (,))
20 smfpimcc.b . . . . . . . . . . . . 13 𝐵 = (SalGen‘𝐽)
21 smfpimcc.a . . . . . . . . . . . . . 14 (𝜑𝐴𝐵)
2221adantr 484 . . . . . . . . . . . . 13 ((𝜑𝑚𝑍) → 𝐴𝐵)
23 eqid 2738 . . . . . . . . . . . . 13 ((𝐹𝑚) “ 𝐴) = ((𝐹𝑚) “ 𝐴)
2415, 17, 18, 19, 20, 22, 23smfpimbor1 43873 . . . . . . . . . . . 12 ((𝜑𝑚𝑍) → ((𝐹𝑚) “ 𝐴) ∈ (𝑆t dom (𝐹𝑚)))
25 fvex 6687 . . . . . . . . . . . . . . . 16 (𝐹𝑚) ∈ V
2625dmex 7642 . . . . . . . . . . . . . . 15 dom (𝐹𝑚) ∈ V
2726a1i 11 . . . . . . . . . . . . . 14 (𝜑 → dom (𝐹𝑚) ∈ V)
28 elrest 16804 . . . . . . . . . . . . . 14 ((𝑆 ∈ SAlg ∧ dom (𝐹𝑚) ∈ V) → (((𝐹𝑚) “ 𝐴) ∈ (𝑆t dom (𝐹𝑚)) ↔ ∃𝑠𝑆 ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))))
2914, 27, 28syl2anc 587 . . . . . . . . . . . . 13 (𝜑 → (((𝐹𝑚) “ 𝐴) ∈ (𝑆t dom (𝐹𝑚)) ↔ ∃𝑠𝑆 ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))))
3029adantr 484 . . . . . . . . . . . 12 ((𝜑𝑚𝑍) → (((𝐹𝑚) “ 𝐴) ∈ (𝑆t dom (𝐹𝑚)) ↔ ∃𝑠𝑆 ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))))
3124, 30mpbid 235 . . . . . . . . . . 11 ((𝜑𝑚𝑍) → ∃𝑠𝑆 ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚)))
32 rabn0 4274 . . . . . . . . . . 11 ({𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))} ≠ ∅ ↔ ∃𝑠𝑆 ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚)))
3331, 32sylibr 237 . . . . . . . . . 10 ((𝜑𝑚𝑍) → {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))} ≠ ∅)
34333adant3 1133 . . . . . . . . 9 ((𝜑𝑚𝑍𝑦 = {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))}) → {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))} ≠ ∅)
3513, 34eqnetrd 3001 . . . . . . . 8 ((𝜑𝑚𝑍𝑦 = {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))}) → 𝑦 ≠ ∅)
36353exp 1120 . . . . . . 7 (𝜑 → (𝑚𝑍 → (𝑦 = {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))} → 𝑦 ≠ ∅)))
3736rexlimdv 3193 . . . . . 6 (𝜑 → (∃𝑚𝑍 𝑦 = {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))} → 𝑦 ≠ ∅))
3837adantr 484 . . . . 5 ((𝜑𝑦 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})) → (∃𝑚𝑍 𝑦 = {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))} → 𝑦 ≠ ∅))
3912, 38mpd 15 . . . 4 ((𝜑𝑦 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})) → 𝑦 ≠ ∅)
406, 39axccd2 42307 . . 3 (𝜑 → ∃𝑓𝑦 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})(𝑓𝑦) ∈ 𝑦)
41 nfv 1921 . . . . . . 7 𝑚𝜑
42 nfmpt1 5128 . . . . . . . . 9 𝑚(𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})
4342nfrn 5795 . . . . . . . 8 𝑚ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})
44 nfv 1921 . . . . . . . 8 𝑚(𝑓𝑦) ∈ 𝑦
4543, 44nfralw 3138 . . . . . . 7 𝑚𝑦 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})(𝑓𝑦) ∈ 𝑦
4641, 45nfan 1906 . . . . . 6 𝑚(𝜑 ∧ ∀𝑦 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})(𝑓𝑦) ∈ 𝑦)
471fvexi 6688 . . . . . 6 𝑍 ∈ V
4814adantr 484 . . . . . 6 ((𝜑 ∧ ∀𝑦 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})(𝑓𝑦) ∈ 𝑦) → 𝑆 ∈ SAlg)
49 fveq2 6674 . . . . . . . . 9 (𝑦 = 𝑤 → (𝑓𝑦) = (𝑓𝑤))
50 id 22 . . . . . . . . 9 (𝑦 = 𝑤𝑦 = 𝑤)
5149, 50eleq12d 2827 . . . . . . . 8 (𝑦 = 𝑤 → ((𝑓𝑦) ∈ 𝑦 ↔ (𝑓𝑤) ∈ 𝑤))
5251rspccva 3525 . . . . . . 7 ((∀𝑦 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})(𝑓𝑦) ∈ 𝑦𝑤 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})) → (𝑓𝑤) ∈ 𝑤)
5352adantll 714 . . . . . 6 (((𝜑 ∧ ∀𝑦 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})(𝑓𝑦) ∈ 𝑦) ∧ 𝑤 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})) → (𝑓𝑤) ∈ 𝑤)
54 eqid 2738 . . . . . 6 (𝑚𝑍 ↦ (𝑓‘{𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})) = (𝑚𝑍 ↦ (𝑓‘{𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))}))
5546, 47, 48, 53, 54smfpimcclem 43879 . . . . 5 ((𝜑 ∧ ∀𝑦 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})(𝑓𝑦) ∈ 𝑦) → ∃(:𝑍𝑆 ∧ ∀𝑚𝑍 ((𝐹𝑚) “ 𝐴) = ((𝑚) ∩ dom (𝐹𝑚))))
5655ex 416 . . . 4 (𝜑 → (∀𝑦 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})(𝑓𝑦) ∈ 𝑦 → ∃(:𝑍𝑆 ∧ ∀𝑚𝑍 ((𝐹𝑚) “ 𝐴) = ((𝑚) ∩ dom (𝐹𝑚)))))
5756exlimdv 1940 . . 3 (𝜑 → (∃𝑓𝑦 ∈ ran (𝑚𝑍 ↦ {𝑠𝑆 ∣ ((𝐹𝑚) “ 𝐴) = (𝑠 ∩ dom (𝐹𝑚))})(𝑓𝑦) ∈ 𝑦 → ∃(:𝑍𝑆 ∧ ∀𝑚𝑍 ((𝐹𝑚) “ 𝐴) = ((𝑚) ∩ dom (𝐹𝑚)))))
5840, 57mpd 15 . 2 (𝜑 → ∃(:𝑍𝑆 ∧ ∀𝑚𝑍 ((𝐹𝑚) “ 𝐴) = ((𝑚) ∩ dom (𝐹𝑚))))
59 smfpimcc.1 . . . . . . . . 9 𝑛𝐹
60 nfcv 2899 . . . . . . . . 9 𝑛𝑚
6159, 60nffv 6684 . . . . . . . 8 𝑛(𝐹𝑚)
6261nfcnv 5721 . . . . . . 7 𝑛(𝐹𝑚)
63 nfcv 2899 . . . . . . 7 𝑛𝐴
6462, 63nfima 5911 . . . . . 6 𝑛((𝐹𝑚) “ 𝐴)
65 nfcv 2899 . . . . . . 7 𝑛(𝑚)
6661nfdm 5794 . . . . . . 7 𝑛dom (𝐹𝑚)
6765, 66nfin 4107 . . . . . 6 𝑛((𝑚) ∩ dom (𝐹𝑚))
6864, 67nfeq 2912 . . . . 5 𝑛((𝐹𝑚) “ 𝐴) = ((𝑚) ∩ dom (𝐹𝑚))
69 nfv 1921 . . . . 5 𝑚((𝐹𝑛) “ 𝐴) = ((𝑛) ∩ dom (𝐹𝑛))
70 fveq2 6674 . . . . . . . 8 (𝑚 = 𝑛 → (𝐹𝑚) = (𝐹𝑛))
7170cnveqd 5718 . . . . . . 7 (𝑚 = 𝑛(𝐹𝑚) = (𝐹𝑛))
7271imaeq1d 5902 . . . . . 6 (𝑚 = 𝑛 → ((𝐹𝑚) “ 𝐴) = ((𝐹𝑛) “ 𝐴))
73 fveq2 6674 . . . . . . 7 (𝑚 = 𝑛 → (𝑚) = (𝑛))
7470dmeqd 5748 . . . . . . 7 (𝑚 = 𝑛 → dom (𝐹𝑚) = dom (𝐹𝑛))
7573, 74ineq12d 4104 . . . . . 6 (𝑚 = 𝑛 → ((𝑚) ∩ dom (𝐹𝑚)) = ((𝑛) ∩ dom (𝐹𝑛)))
7672, 75eqeq12d 2754 . . . . 5 (𝑚 = 𝑛 → (((𝐹𝑚) “ 𝐴) = ((𝑚) ∩ dom (𝐹𝑚)) ↔ ((𝐹𝑛) “ 𝐴) = ((𝑛) ∩ dom (𝐹𝑛))))
7768, 69, 76cbvralw 3340 . . . 4 (∀𝑚𝑍 ((𝐹𝑚) “ 𝐴) = ((𝑚) ∩ dom (𝐹𝑚)) ↔ ∀𝑛𝑍 ((𝐹𝑛) “ 𝐴) = ((𝑛) ∩ dom (𝐹𝑛)))
7877anbi2i 626 . . 3 ((:𝑍𝑆 ∧ ∀𝑚𝑍 ((𝐹𝑚) “ 𝐴) = ((𝑚) ∩ dom (𝐹𝑚))) ↔ (:𝑍𝑆 ∧ ∀𝑛𝑍 ((𝐹𝑛) “ 𝐴) = ((𝑛) ∩ dom (𝐹𝑛))))
7978exbii 1854 . 2 (∃(:𝑍𝑆 ∧ ∀𝑚𝑍 ((𝐹𝑚) “ 𝐴) = ((𝑚) ∩ dom (𝐹𝑚))) ↔ ∃(:𝑍𝑆 ∧ ∀𝑛𝑍 ((𝐹𝑛) “ 𝐴) = ((𝑛) ∩ dom (𝐹𝑛))))
8058, 79sylib 221 1 (𝜑 → ∃(:𝑍𝑆 ∧ ∀𝑛𝑍 ((𝐹𝑛) “ 𝐴) = ((𝑛) ∩ dom (𝐹𝑛))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399  w3a 1088   = wceq 1542  wex 1786  wcel 2114  wnfc 2879  wne 2934  wral 3053  wrex 3054  {crab 3057  Vcvv 3398  cin 3842  c0 4211   class class class wbr 5030  cmpt 5110  ccnv 5524  dom cdm 5525  ran crn 5526  cima 5528  wf 6335  cfv 6339  (class class class)co 7170  ωcom 7599  cdom 8553  cuz 12324  (,)cioo 12821  t crest 16797  topGenctg 16814  SAlgcsalg 43391  SalGencsalgen 43395  SMblFncsmblfn 43775
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2020  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2162  ax-12 2179  ax-ext 2710  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5232  ax-pr 5296  ax-un 7479  ax-inf2 9177  ax-cc 9935  ax-ac2 9963  ax-cnex 10671  ax-resscn 10672  ax-1cn 10673  ax-icn 10674  ax-addcl 10675  ax-addrcl 10676  ax-mulcl 10677  ax-mulrcl 10678  ax-mulcom 10679  ax-addass 10680  ax-mulass 10681  ax-distr 10682  ax-i2m1 10683  ax-1ne0 10684  ax-1rid 10685  ax-rnegex 10686  ax-rrecex 10687  ax-cnre 10688  ax-pre-lttri 10689  ax-pre-lttrn 10690  ax-pre-ltadd 10691  ax-pre-mulgt0 10692  ax-pre-sup 10693
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2075  df-mo 2540  df-eu 2570  df-clab 2717  df-cleq 2730  df-clel 2811  df-nfc 2881  df-ne 2935  df-nel 3039  df-ral 3058  df-rex 3059  df-reu 3060  df-rmo 3061  df-rab 3062  df-v 3400  df-sbc 3681  df-csb 3791  df-dif 3846  df-un 3848  df-in 3850  df-ss 3860  df-pss 3862  df-nul 4212  df-if 4415  df-pw 4490  df-sn 4517  df-pr 4519  df-tp 4521  df-op 4523  df-uni 4797  df-int 4837  df-iun 4883  df-iin 4884  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5429  df-eprel 5434  df-po 5442  df-so 5443  df-fr 5483  df-se 5484  df-we 5485  df-xp 5531  df-rel 5532  df-cnv 5533  df-co 5534  df-dm 5535  df-rn 5536  df-res 5537  df-ima 5538  df-pred 6129  df-ord 6175  df-on 6176  df-lim 6177  df-suc 6178  df-iota 6297  df-fun 6341  df-fn 6342  df-f 6343  df-f1 6344  df-fo 6345  df-f1o 6346  df-fv 6347  df-isom 6348  df-riota 7127  df-ov 7173  df-oprab 7174  df-mpo 7175  df-om 7600  df-1st 7714  df-2nd 7715  df-wrecs 7976  df-recs 8037  df-rdg 8075  df-1o 8131  df-oadd 8135  df-omul 8136  df-er 8320  df-map 8439  df-pm 8440  df-en 8556  df-dom 8557  df-sdom 8558  df-fin 8559  df-sup 8979  df-inf 8980  df-oi 9047  df-card 9441  df-acn 9444  df-ac 9616  df-pnf 10755  df-mnf 10756  df-xr 10757  df-ltxr 10758  df-le 10759  df-sub 10950  df-neg 10951  df-div 11376  df-nn 11717  df-n0 11977  df-z 12063  df-uz 12325  df-q 12431  df-rp 12473  df-ioo 12825  df-ico 12827  df-fl 13253  df-rest 16799  df-topgen 16820  df-top 21645  df-bases 21697  df-salg 43392  df-salgen 43396  df-smblfn 43776
This theorem is referenced by:  smfsuplem2  43884
  Copyright terms: Public domain W3C validator