fourierdlem2

Description: Membership in a partition. (Contributed by Glauco Siliprandi, 11-Dec-2019)

		Ref	Expression
	Hypothesis	fourierdlem2.1	$⊢ P = (m \in ℕ ⟼ \{p \in (ℝ^{(0 \dots m)}) \| ((p (0) = A \land p (m) = B) \land \forall i \in (0 ..^m) p (i) < p (i + 1))\})$
	Assertion	fourierdlem2	$⊢ M \in ℕ \to (Q \in P (M) \leftrightarrow (Q \in (ℝ^{(0 \dots M)}) \land ((Q (0) = A \land Q (M) = B) \land \forall i \in (0 ..^M) Q (i) < Q (i + 1))))$

Proof

Step	Hyp	Ref	Expression
1		fourierdlem2.1	$⊢ P = (m \in ℕ ⟼ \{p \in (ℝ^{(0 \dots m)}) \| ((p (0) = A \land p (m) = B) \land \forall i \in (0 ..^m) p (i) < p (i + 1))\})$
2		oveq2	$⊢ m = M \to (0 \dots m) = (0 \dots M)$
3	2	oveq2d	$⊢ m = M \to ℝ^{(0 \dots m)} = ℝ^{(0 \dots M)}$
4		fveqeq2	$⊢ m = M \to (p (m) = B \leftrightarrow p (M) = B)$
5	4	anbi2d	$⊢ m = M \to ((p (0) = A \land p (m) = B) \leftrightarrow (p (0) = A \land p (M) = B))$
6		oveq2	$⊢ m = M \to (0 ..^m) = (0 ..^M)$
7	6	raleqdv	$⊢ m = M \to (\forall i \in (0 ..^m) p (i) < p (i + 1) \leftrightarrow \forall i \in (0 ..^M) p (i) < p (i + 1))$
8	5 7	anbi12d	$⊢ m = M \to (((p (0) = A \land p (m) = B) \land \forall i \in (0 ..^m) p (i) < p (i + 1)) \leftrightarrow ((p (0) = A \land p (M) = B) \land \forall i \in (0 ..^M) p (i) < p (i + 1)))$
9	3 8	rabeqbidv	$⊢ m = M \to \{p \in (ℝ^{(0 \dots m)}) \| ((p (0) = A \land p (m) = B) \land \forall i \in (0 ..^m) p (i) < p (i + 1))\} = \{p \in (ℝ^{(0 \dots M)}) \| ((p (0) = A \land p (M) = B) \land \forall i \in (0 ..^M) p (i) < p (i + 1))\}$
10		ovex	$⊢ ℝ^{(0 \dots M)} \in V$
11	10	rabex	$⊢ \{p \in (ℝ^{(0 \dots M)}) \| ((p (0) = A \land p (M) = B) \land \forall i \in (0 ..^M) p (i) < p (i + 1))\} \in V$
12	9 1 11	fvmpt	$⊢ M \in ℕ \to P (M) = \{p \in (ℝ^{(0 \dots M)}) \| ((p (0) = A \land p (M) = B) \land \forall i \in (0 ..^M) p (i) < p (i + 1))\}$
13	12	eleq2d	$⊢ M \in ℕ \to (Q \in P (M) \leftrightarrow Q \in \{p \in (ℝ^{(0 \dots M)}) \| ((p (0) = A \land p (M) = B) \land \forall i \in (0 ..^M) p (i) < p (i + 1))\})$
14		fveq1	$⊢ p = Q \to p (0) = Q (0)$
15	14	eqeq1d	$⊢ p = Q \to (p (0) = A \leftrightarrow Q (0) = A)$
16		fveq1	$⊢ p = Q \to p (M) = Q (M)$
17	16	eqeq1d	$⊢ p = Q \to (p (M) = B \leftrightarrow Q (M) = B)$
18	15 17	anbi12d	$⊢ p = Q \to ((p (0) = A \land p (M) = B) \leftrightarrow (Q (0) = A \land Q (M) = B))$
19		fveq1	$⊢ p = Q \to p (i) = Q (i)$
20		fveq1	$⊢ p = Q \to p (i + 1) = Q (i + 1)$
21	19 20	breq12d	$⊢ p = Q \to (p (i) < p (i + 1) \leftrightarrow Q (i) < Q (i + 1))$
22	21	ralbidv	$⊢ p = Q \to (\forall i \in (0 ..^M) p (i) < p (i + 1) \leftrightarrow \forall i \in (0 ..^M) Q (i) < Q (i + 1))$
23	18 22	anbi12d	$⊢ p = Q \to (((p (0) = A \land p (M) = B) \land \forall i \in (0 ..^M) p (i) < p (i + 1)) \leftrightarrow ((Q (0) = A \land Q (M) = B) \land \forall i \in (0 ..^M) Q (i) < Q (i + 1)))$
24	23	elrab	$⊢ Q \in \{p \in (ℝ^{(0 \dots M)}) \| ((p (0) = A \land p (M) = B) \land \forall i \in (0 ..^M) p (i) < p (i + 1))\} \leftrightarrow (Q \in (ℝ^{(0 \dots M)}) \land ((Q (0) = A \land Q (M) = B) \land \forall i \in (0 ..^M) Q (i) < Q (i + 1)))$
25	13 24	bitrdi	$⊢ M \in ℕ \to (Q \in P (M) \leftrightarrow (Q \in (ℝ^{(0 \dots M)}) \land ((Q (0) = A \land Q (M) = B) \land \forall i \in (0 ..^M) Q (i) < Q (i + 1))))$

Metamath Proof Explorer

Theorem fourierdlem2

Proof