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 48129

Description: The domain of the inf function is defined in Proposition 121F (c) of [Fremlin1], p. 39. See smfinf 48101. 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 2926	. . . . 5 ⊢ Ⅎ𝑥ℕ
4		nfcv 2926	. . . . . 6 ⊢ Ⅎ𝑥𝑍
5		finfdm.7	. . . . . . . . 9 ⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}))
6		nfrab1 3435	. . . . . . . . . . 11 ⊢ Ⅎ𝑥{𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}
7	3, 6	nfmpt 5209	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)})
8	4, 7	nfmpt 5209	. . . . . . . . 9 ⊢ Ⅎ𝑥(𝑛 ∈ 𝑍 ↦ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}))
9	5, 8	nfcxfr 2924	. . . . . . . 8 ⊢ Ⅎ𝑥𝐻
10		nfcv 2926	. . . . . . . 8 ⊢ Ⅎ𝑥𝑛
11	9, 10	nffv 6926	. . . . . . 7 ⊢ Ⅎ𝑥(𝐻‘𝑛)
12		nfcv 2926	. . . . . . 7 ⊢ Ⅎ𝑥𝑚
13	11, 12	nffv 6926	. . . . . 6 ⊢ Ⅎ𝑥((𝐻‘𝑛)‘𝑚)
14	4, 13	nfiin 4988	. . . . 5 ⊢ Ⅎ𝑥∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)
15	3, 14	nfiun 4987	. . . 4 ⊢ Ⅎ𝑥∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)
16		finfdm.3	. . . . . . . . . . 11 ⊢ Ⅎ𝑚𝜑
17		nfv 1949	. . . . . . . . . . 11 ⊢ Ⅎ𝑚 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)
18	16, 17	nfan 1934	. . . . . . . . . 10 ⊢ Ⅎ𝑚(𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
19		nfv 1949	. . . . . . . . . 10 ⊢ Ⅎ𝑚 𝑦 ∈ ℝ
20	18, 19	nfan 1934	. . . . . . . . 9 ⊢ Ⅎ𝑚((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ)
21		nfv 1949	. . . . . . . . 9 ⊢ Ⅎ𝑚∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)
22	20, 21	nfan 1934	. . . . . . . 8 ⊢ Ⅎ𝑚(((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
23		finfdm.1	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛𝜑
24		nfii1 4992	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)
25	24	nfel2 2944	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)
26	23, 25	nfan 1934	. . . . . . . . . . . 12 ⊢ Ⅎ𝑛(𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
27		nfv 1949	. . . . . . . . . . . 12 ⊢ Ⅎ𝑛 𝑦 ∈ ℝ
28	26, 27	nfan 1934	. . . . . . . . . . 11 ⊢ Ⅎ𝑛((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ)
29		nfra1 3290	. . . . . . . . . . 11 ⊢ Ⅎ𝑛∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)
30	28, 29	nfan 1934	. . . . . . . . . 10 ⊢ Ⅎ𝑛(((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
31		nfv 1949	. . . . . . . . . 10 ⊢ Ⅎ𝑛 𝑚 ∈ ℕ
32		nfv 1949	. . . . . . . . . 10 ⊢ Ⅎ𝑛 -𝑦 < 𝑚
33	30, 31, 32	nf3an 1936	. . . . . . . . 9 ⊢ Ⅎ𝑛((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚)
34		vex 3458	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
35	34	a1i 11	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) → 𝑥 ∈ V)
36		simp-4r 796	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
37	36	3ad2antl1 1204	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
38		simpr 490	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍)
39		eliinid 46399	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom (𝐹‘𝑛))
40	37, 38, 39	syl2anc 596	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom (𝐹‘𝑛))
41		simpl2 1211	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑚 ∈ ℕ)
42		nnre 12382	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ ℕ → 𝑚 ∈ ℝ)
43	42	renegcld 11782	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ ℕ → -𝑚 ∈ ℝ)
44	43	rexrd 11398	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ ℕ → -𝑚 ∈ ℝ^*)
45	41, 44	syl 18	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → -𝑚 ∈ ℝ^*)
46		simpllr 788	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → 𝑦 ∈ ℝ)
47		rexr 11394	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℝ^*)
48	46, 47	syl 18	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → 𝑦 ∈ ℝ^*)
49	48	3ad2antl1 1204	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑦 ∈ ℝ^*)
50		simp-4l 795	. . . . . . . . . . . . . 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 7117	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ dom (𝐹‘𝑛)) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ^*)
56	51, 38, 40, 55	syl3anc 1399	. . . . . . . . . . . 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 11936	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ ℝ ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) → -𝑚 < 𝑦)
63	57, 41, 58, 62	syl3anc 1399	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → -𝑚 < 𝑦)
64		simpl1r 1244	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
65		rspa 3255	. . . . . . . . . . . . 13 ⊢ ((∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ∧ 𝑛 ∈ 𝑍) → 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
66	64, 38, 65	syl2anc 596	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
67	45, 49, 56, 63, 66	xrltletrd 13330	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → -𝑚 < ((𝐹‘𝑛)‘𝑥))
68	40, 67	rabidd 46443	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)})
69		id 23	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ 𝑍 → 𝑛 ∈ 𝑍)
70		nnex 12381	. . . . . . . . . . . . . . . 16 ⊢ ℕ ∈ V
71	70	mptex 7260	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}) ∈ V
72	71	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ 𝑍 → (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}) ∈ V)
73	5	fvmpt2 7036	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ 𝑍 ∧ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}) ∈ V) → (𝐻‘𝑛) = (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}))
74	69, 72, 73	syl2anc 596	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ 𝑍 → (𝐻‘𝑛) = (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)}))
75		finfdm.4	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑥𝐹
76	75, 10	nffv 6926	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑥(𝐹‘𝑛)
77	76	nfdm 5945	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥dom (𝐹‘𝑛)
78		fvex 6929	. . . . . . . . . . . . . . . 16 ⊢ (𝐹‘𝑛) ∈ V
79	78	dmex 7955	. . . . . . . . . . . . . . 15 ⊢ dom (𝐹‘𝑛) ∈ V
80	77, 79	rabexf 46422	. . . . . . . . . . . . . 14 ⊢ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)} ∈ V
81	80	a1i 11	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ 𝑍 ∧ 𝑚 ∈ ℕ) → {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)} ∈ V)
82	74, 81	fvmpt2d 7038	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ 𝑍 ∧ 𝑚 ∈ ℕ) → ((𝐻‘𝑛)‘𝑚) = {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)})
83	82	eqcomd 2769	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ 𝑍 ∧ 𝑚 ∈ ℕ) → {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)} = ((𝐻‘𝑛)‘𝑚))
84	38, 41, 83	syl2anc 596	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)} = ((𝐻‘𝑛)‘𝑚))
85	68, 84	eleqtrd 2866	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ ((𝐻‘𝑛)‘𝑚))
86	33, 35, 85	eliind2 46418	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑚 ∈ ℕ ∧ -𝑦 < 𝑚) → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
87		renegcl 11660	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℝ → -𝑦 ∈ ℝ)
88	87	archd 46450	. . . . . . . . 9 ⊢ (𝑦 ∈ ℝ → ∃𝑚 ∈ ℕ -𝑦 < 𝑚)
89	88	ad2antlr 740	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → ∃𝑚 ∈ ℕ -𝑦 < 𝑚)
90	22, 86, 89	reximdd 46436	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → ∃𝑚 ∈ ℕ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
91	90	rexlimdva2 3169	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) → (∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) → ∃𝑚 ∈ ℕ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)))
92	91	3impia 1135	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → ∃𝑚 ∈ ℕ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
93		eliun 4960	. . . . 5 ⊢ (𝑥 ∈ ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚) ↔ ∃𝑚 ∈ ℕ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
94	92, 93	sylibr 237	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → 𝑥 ∈ ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
95	2, 15, 94	rabssd 46430	. . 3 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)} ⊆ ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
96	1, 95	eqsstrid 3951	. 2 ⊢ (𝜑 → 𝐷 ⊆ ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
97		nfcv 2926	. . 3 ⊢ Ⅎ𝑚𝐷
98		nfv 1949	. . . . 5 ⊢ Ⅎ𝑥 𝑚 ∈ ℕ
99	2, 98	nfan 1934	. . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑚 ∈ ℕ)
100		nfrab1 3435	. . . . 5 ⊢ Ⅎ𝑥{𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)}
101	1, 100	nfcxfr 2924	. . . 4 ⊢ Ⅎ𝑥𝐷
102	23, 31	nfan 1934	. . . . . . . 8 ⊢ Ⅎ𝑛(𝜑 ∧ 𝑚 ∈ ℕ)
103		nfii1 4992	. . . . . . . . 9 ⊢ Ⅎ𝑛∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)
104	103	nfel2 2944	. . . . . . . 8 ⊢ Ⅎ𝑛 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)
105	102, 104	nfan 1934	. . . . . . 7 ⊢ Ⅎ𝑛((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
106		simpr 490	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
107		eliinid 46399	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ ((𝐻‘𝑛)‘𝑚))
108	107	adantll 727	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ ((𝐻‘𝑛)‘𝑚))
109	69	adantl 487	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍)
110		simpllr 788	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → 𝑚 ∈ ℕ)
111	109, 110, 82	syl2anc 596	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → ((𝐻‘𝑛)‘𝑚) = {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)})
112	108, 111	eleqtrd 2866	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)})
113		rabidim1 3437	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)} → 𝑥 ∈ dom (𝐹‘𝑛))
114	112, 113	syl 18	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom (𝐹‘𝑛))
115	105, 106, 114	eliind2 46418	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
116	43	ad2antlr 740	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) → -𝑚 ∈ ℝ)
117		breq1 5111	. . . . . . . . 9 ⊢ (𝑦 = -𝑚 → (𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ -𝑚 ≤ ((𝐹‘𝑛)‘𝑥)))
118	117	ralbidv 3189	. . . . . . . 8 ⊢ (𝑦 = -𝑚 → (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∀𝑛 ∈ 𝑍 -𝑚 ≤ ((𝐹‘𝑛)‘𝑥)))
119	118	adantl 487	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑦 = -𝑚) → (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∀𝑛 ∈ 𝑍 -𝑚 ≤ ((𝐹‘𝑛)‘𝑥)))
120	110, 44	syl 18	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → -𝑚 ∈ ℝ^*)
121		simplll 787	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → 𝜑)
122	121, 109, 114, 55	syl3anc 1399	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ^*)
123		rabidim2 46390	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝑥 ∈ dom (𝐹‘𝑛) ∣ -𝑚 < ((𝐹‘𝑛)‘𝑥)} → -𝑚 < ((𝐹‘𝑛)‘𝑥))
124	112, 123	syl 18	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → -𝑚 < ((𝐹‘𝑛)‘𝑥))
125	120, 122, 124	xrltled 13319	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) ∧ 𝑛 ∈ 𝑍) → -𝑚 ≤ ((𝐹‘𝑛)‘𝑥))
126	105, 125	ralrimia 3265	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) → ∀𝑛 ∈ 𝑍 -𝑚 ≤ ((𝐹‘𝑛)‘𝑥))
127	116, 119, 126	rspcedvd 3582	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
128	115, 127	rabidd 46443	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) → 𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)})
129	128, 1	eleqtrrdi 2875	. . . 4 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) → 𝑥 ∈ 𝐷)
130	99, 14, 101, 129	ssdf2 46429	. . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚) ⊆ 𝐷)
131	16, 97, 130	iunssdf 46444	. 2 ⊢ (𝜑 → ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚) ⊆ 𝐷)
132	96, 131	eqssd 3930	1 ⊢ (𝜑 → 𝐷 = ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2147 Ⅎwnfc 2911 ∀wral 3080 ∃wrex 3090 {crab 3416 Vcvv 3454 ∪ ciun 4956 ∩ ciin 4957 class class class wbr 5108 ↦ cmpt 5192 dom cdm 5658 ⟶wf 6562 ‘cfv 6566 ℝcr 11238 ℝ^*cxr 11381 < clt 11382 ≤ cle 11383 -cneg 11581 ℕcn 12375

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 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317

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-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 4841 df-uni 4873 df-iun 4958 df-iin 4959 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376

This theorem is used by: finfdm2 48130

W3C validator