finfdm - Mathbox for Glauco Siliprandi

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

Theorem finfdm 47560

Description: The domain of the inf function is defined in Proposition 121F (c) of [Fremlin1], p. 39. See smfinf 47532. Note that this definition of the inf function is quite general, as it does not require the original functions to be sigma-measurable, and it could be applied to uncountable sets of functions. The equality proved here is part of the proof of the fifth statement of Proposition 121H in [Fremlin1], p. 39. (Contributed by Glauco Siliprandi, 1-Feb-2025.)

**Hypotheses**
Ref	Expression
finfdm.1	⊢ Ⅎ𝑛𝜑
finfdm.2	⊢ Ⅎ𝑥𝜑
finfdm.3	⊢ Ⅎ𝑚𝜑
finfdm.4	⊢ Ⅎ𝑥𝐹
finfdm.5	⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛):dom (𝐹‘𝑛)⟶ℝ^*)
finfdm.6	⊢ 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)}
finfdm.7	⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}))

**Assertion**
Ref	Expression
finfdm	⊢ (𝜑 → 𝐷 = ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))

Distinct variable groups: 𝐷,𝑚 𝑚,𝐹,𝑦 𝑦,𝐻 𝑚,𝑍,𝑛,𝑥,𝑦 𝜑,𝑦 Allowed substitution hints: 𝜑(𝑥,𝑚,𝑛) 𝐷(𝑥,𝑦,𝑛) 𝐹(𝑥,𝑛) 𝐻(𝑥,𝑚,𝑛)

**Proof of Theorem finfdm**
Step	Hyp	Ref	Expression
1		finfdm.6	. . 3 ⊢ 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)}
2		finfdm.2	. . . 4 ⊢ Ⅎ𝑥𝜑
3		nfcv 2925	. . . . 5 ⊢ Ⅎ𝑥ℕ
4		nfcv 2925	. . . . . 6 ⊢ Ⅎ𝑥𝑍
5		finfdm.7	. . . . . . . . 9 ⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}))
6		nfrab1 3436	. . . . . . . . . . 11 ⊢ Ⅎ𝑥{𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}
7	3, 6	nfmpt 5209	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)})
8	4, 7	nfmpt 5209	. . . . . . . . 9 ⊢ Ⅎ𝑥(𝑛 ∈ 𝑍 ↦ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}))
9	5, 8	nfcxfr 2923	. . . . . . . 8 ⊢ Ⅎ𝑥𝐻
10		nfcv 2925	. . . . . . . 8 ⊢ Ⅎ𝑥𝑛
11	9, 10	nffv 6891	. . . . . . 7 ⊢ Ⅎ𝑥(𝐻‘𝑛)
12		nfcv 2925	. . . . . . 7 ⊢ Ⅎ𝑥𝑚
13	11, 12	nffv 6891	. . . . . 6 ⊢ Ⅎ𝑥((𝐻‘𝑛)‘𝑚)
14	4, 13	nfiin 4989	. . . . 5 ⊢ Ⅎ𝑥∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)
15	3, 14	nfiun 4988	. . . 4 ⊢ Ⅎ𝑥∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)
16		finfdm.3	. . . . . . . . . . 11 ⊢ Ⅎ𝑚𝜑
17		nfv 1944	. . . . . . . . . . 11 ⊢ Ⅎ𝑚 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)
18	16, 17	nfan 1929	. . . . . . . . . 10 ⊢ Ⅎ𝑚(𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
19		nfv 1944	. . . . . . . . . 10 ⊢ Ⅎ𝑚 𝑦 ∈ ℝ
20	18, 19	nfan 1929	. . . . . . . . 9 ⊢ Ⅎ𝑚((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ)
21		nfv 1944	. . . . . . . . 9 ⊢ Ⅎ𝑚∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)
22	20, 21	nfan 1929	. . . . . . . 8 ⊢ Ⅎ𝑚(((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
23		finfdm.1	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛𝜑
24		nfii1 4993	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)
25	24	nfel2 2943	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)
26	23, 25	nfan 1929	. . . . . . . . . . . 12 ⊢ Ⅎ𝑛(𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
27		nfv 1944	. . . . . . . . . . . 12 ⊢ Ⅎ𝑛 𝑦 ∈ ℝ
28	26, 27	nfan 1929	. . . . . . . . . . 11 ⊢ Ⅎ𝑛((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ)
29		nfra1 3289	. . . . . . . . . . 11 ⊢ Ⅎ𝑛∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)
30	28, 29	nfan 1929	. . . . . . . . . 10 ⊢ Ⅎ𝑛(((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
31		nfv 1944	. . . . . . . . . 10 ⊢ Ⅎ𝑛 𝑚 ∈ ℕ
32		nfv 1944	. . . . . . . . . 10 ⊢ Ⅎ𝑛-𝑦 < 𝑚
33	30, 31, 32	nf3an 1931	. . . . . . . . 9 ⊢ Ⅎ𝑛((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚)
34		vex 3459	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
35	34	a1i 11	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) → 𝑥 ∈ V)
36		simp-4r 795	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
37	36	3ad2antl1 1204	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
38		simpr 489	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍)
39		eliinid 45829	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom (𝐹‘𝑛))
40	37, 38, 39	syl2anc 595	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom (𝐹‘𝑛))
41		simpl2 1211	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑚 ∈ ℕ)
42		nnre 12235	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ ℕ → 𝑚 ∈ ℝ)
43	42	renegcld 11636	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ ℕ → -𝑚 ∈ ℝ)
44	43	rexrd 11254	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ ℕ → -𝑚 ∈ ℝ^*)
45	41, 44	syl 18	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → -𝑚 ∈ ℝ^*)
46		simpllr 787	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → 𝑦 ∈ ℝ)
47		rexr 11250	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℝ^*)
48	46, 47	syl 18	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → 𝑦 ∈ ℝ^*)
49	48	3ad2antl1 1204	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑦 ∈ ℝ^*)
50		simp-4l 794	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → 𝜑)
51	50	3ad2antl1 1204	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝜑)
52		finfdm.5	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛):dom (𝐹‘𝑛)⟶ℝ^*)
53	52	3adant3 1150	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ dom (𝐹‘𝑛)) → (𝐹‘𝑛):dom (𝐹‘𝑛)⟶ℝ^*)
54		simp3 1156	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ dom (𝐹‘𝑛)) → 𝑥 ∈ dom (𝐹‘𝑛))
55	53, 54	ffvelcdmd 7080	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ dom (𝐹‘𝑛)) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ^*)
56	51, 38, 40, 55	syl3anc 1398	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ^*)
57	46	3ad2antl1 1204	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑦 ∈ ℝ)
58		simpl3 1212	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → -𝑦 < 𝑚)
59		simp1 1154	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ ℝ ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) → 𝑦 ∈ ℝ)
60	42	3ad2ant2 1152	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ ℝ ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) → 𝑚 ∈ ℝ)
61		simp3 1156	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ ℝ ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) → -𝑦 < 𝑚)
62	59, 60, 61	ltnegcon1d 11789	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ ℝ ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) → -𝑚 < 𝑦)
63	57, 41, 58, 62	syl3anc 1398	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → -𝑚 < 𝑦)
64		simpl1r 1244	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
65		rspa 3254	. . . . . . . . . . . . 13 ⊢ ((∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ∧ 𝑛 ∈ 𝑍) → 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
66	64, 38, 65	syl2anc 595	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
67	45, 49, 56, 63, 66	xrltletrd 13181	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → -𝑚 < ((𝐹‘𝑛)‘𝑥))
68	40, 67	rabidd 45873	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)})
69		id 23	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ 𝑍 → 𝑛 ∈ 𝑍)
70		nnex 12234	. . . . . . . . . . . . . . . 16 ⊢ ℕ ∈ V
71	70	mptex 7221	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}) ∈ V
72	71	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ 𝑍 → (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}) ∈ V)
73	5	fvmpt2 7001	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ 𝑍 ∧ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}) ∈ V) → (𝐻‘𝑛) = (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}))
74	69, 72, 73	syl2anc 595	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ 𝑍 → (𝐻‘𝑛) = (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}))
75		finfdm.4	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑥𝐹
76	75, 10	nffv 6891	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑥(𝐹‘𝑛)
77	76	nfdm 5941	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥dom (𝐹‘𝑛)
78		fvex 6894	. . . . . . . . . . . . . . . 16 ⊢ (𝐹‘𝑛) ∈ V
79	78	dmex 7902	. . . . . . . . . . . . . . 15 ⊢ dom (𝐹‘𝑛) ∈ V
80	77, 79	rabexf 45852	. . . . . . . . . . . . . 14 ⊢ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)} ∈ V
81	80	a1i 11	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ 𝑍 ∧ 𝑚 ∈ ℕ) → {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)} ∈ V)
82	74, 81	fvmpt2d 7003	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ 𝑍 ∧ 𝑚 ∈ ℕ) → ((𝐻‘𝑛)‘𝑚) = {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)})
83	82	eqcomd 2769	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ 𝑍 ∧ 𝑚 ∈ ℕ) → {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)} = ((𝐻‘𝑛)‘𝑚))
84	38, 41, 83	syl2anc 595	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)} = ((𝐻‘𝑛)‘𝑚))
85	68, 84	eleqtrd 2865	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ ((𝐻‘𝑛)‘𝑚))
86	33, 35, 85	eliind2 45848	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
87		renegcl 11516	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℝ → -𝑦 ∈ ℝ)
88	87	archd 45880	. . . . . . . . 9 ⊢ (𝑦 ∈ ℝ → ∃𝑚 ∈ ℕ -𝑦 < 𝑚)
89	88	ad2antlr 739	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → ∃𝑚 ∈ ℕ -𝑦 < 𝑚)
90	22, 86, 89	reximdd 45866	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → ∃𝑚 ∈ ℕ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
91	90	rexlimdva2 3168	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) → (∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) → ∃𝑚 ∈ ℕ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)))
92	91	3impia 1135	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → ∃𝑚 ∈ ℕ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
93		eliun 4960	. . . . 5 ⊢ (𝑥 ∈ ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚) ↔ ∃𝑚 ∈ ℕ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
94	92, 93	sylibr 237	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → 𝑥 ∈ ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
95	2, 15, 94	rabssd 45860	. . 3 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)} ⊆ ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
96	1, 95	eqsstrid 3975	. 2 ⊢ (𝜑 → 𝐷 ⊆ ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
97		nfcv 2925	. . 3 ⊢ Ⅎ𝑚𝐷
98		nfv 1944	. . . . 5 ⊢ Ⅎ𝑥 𝑚 ∈ ℕ
99	2, 98	nfan 1929	. . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑚 ∈ ℕ)
100		nfrab1 3436	. . . . 5 ⊢ Ⅎ𝑥{𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)}
101	1, 100	nfcxfr 2923	. . . 4 ⊢ Ⅎ𝑥𝐷
102	23, 31	nfan 1929	. . . . . . . 8 ⊢ Ⅎ𝑛(𝜑 ∧ 𝑚 ∈ ℕ)
103		nfii1 4993	. . . . . . . . 9 ⊢ Ⅎ𝑛∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)
104	103	nfel2 2943	. . . . . . . 8 ⊢ Ⅎ𝑛 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)
105	102, 104	nfan 1929	. . . . . . 7 ⊢ Ⅎ𝑛((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
106		simpr 489	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
107		eliinid 45829	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ ((𝐻‘𝑛)‘𝑚))
108	107	adantll 726	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ ((𝐻‘𝑛)‘𝑚))
109	69	adantl 486	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍)
110		simpllr 787	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → 𝑚 ∈ ℕ)
111	109, 110, 82	syl2anc 595	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → ((𝐻‘𝑛)‘𝑚) = {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)})
112	108, 111	eleqtrd 2865	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)})
113		rabidim1 3438	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)} → 𝑥 ∈ dom (𝐹‘𝑛))
114	112, 113	syl 18	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom (𝐹‘𝑛))
115	105, 106, 114	eliind2 45848	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
116	43	ad2antlr 739	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) → -𝑚 ∈ ℝ)
117		breq1 5112	. . . . . . . . 9 ⊢ (𝑦 = -𝑚 → (𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ -𝑚 ≤ ((𝐹‘𝑛)‘𝑥)))
118	117	ralbidv 3188	. . . . . . . 8 ⊢ (𝑦 = -𝑚 → (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∀𝑛 ∈ 𝑍 -𝑚 ≤ ((𝐹‘𝑛)‘𝑥)))
119	118	adantl 486	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑦 = -𝑚) → (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∀𝑛 ∈ 𝑍 -𝑚 ≤ ((𝐹‘𝑛)‘𝑥)))
120	110, 44	syl 18	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → -𝑚 ∈ ℝ^*)
121		simplll 786	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → 𝜑)
122	121, 109, 114, 55	syl3anc 1398	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ^*)
123		rabidim2 45820	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)} → -𝑚 < ((𝐹‘𝑛)‘𝑥))
124	112, 123	syl 18	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → -𝑚 < ((𝐹‘𝑛)‘𝑥))
125	120, 122, 124	xrltled 13170	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → -𝑚 ≤ ((𝐹‘𝑛)‘𝑥))
126	105, 125	ralrimia 3264	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) → ∀𝑛 ∈ 𝑍 -𝑚 ≤ ((𝐹‘𝑛)‘𝑥))
127	116, 119, 126	rspcedvd 3583	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
128	115, 127	rabidd 45873	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) → 𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)})
129	128, 1	eleqtrrdi 2874	. . . 4 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) → 𝑥 ∈ 𝐷)
130	99, 14, 101, 129	ssdf2 45859	. . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚) ⊆ 𝐷)
131	16, 97, 130	iunssdf 45874	. 2 ⊢ (𝜑 → ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚) ⊆ 𝐷)
132	96, 131	eqssd 3954	1 ⊢ (𝜑 → 𝐷 = ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 Ⅎwnf 1813 ∈ wcel 2143 Ⅎwnfc 2910 ∀wral 3079 ∃wrex 3089 {crab 3416 Vcvv 3455 ∪ ciun 4956 ∩ ciin 4957 class class class wbr 5109 ↦ cmpt 5192 dom cdm 5661 ⟶wf 6532 ‘cfv 6536 ℝcr 11094 ℝ^*cxr 11237 < clt 11238 ≤ cle 11239 -cneg 11437 ℕcn 12228

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 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 ax-pre-sup 11173

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-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-iin 4959 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229

This theorem is referenced by: finfdm2 47561

W3C validator