Theorem csbfinxpg 38075

Description: Distribute proper substitution through Cartesian exponentiation. (Contributed by ML, 25-Oct-2020.)

Assertion

Ref	Expression
csbfinxpg	⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝑈↑↑𝑁) = (⦋𝐴 / 𝑥⦌𝑈↑↑⦋𝐴 / 𝑥⦌𝑁))

Distinct variable group:   𝑥,𝑁

Allowed substitution hints:   𝐴(𝑥)   𝑈(𝑥)   𝑉(𝑥)

Proof of Theorem csbfinxpg

Dummy variables 𝑛 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-finxp 38071	. . 3 ⊢ (𝑈↑↑𝑁) = {𝑦 ∣ (𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁))}
2	1	csbeq2i 3864	. 2 ⊢ ⦋𝐴 / 𝑥⦌(𝑈↑↑𝑁) = ⦋𝐴 / 𝑥⦌{𝑦 ∣ (𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁))}
3		sbcan 3796	. . . . 5 ⊢ ([𝐴 / 𝑥](𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁)) ↔ ([𝐴 / 𝑥]𝑁 ∈ ω ∧ [𝐴 / 𝑥]∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁)))
4		sbcel1g 4384	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑁 ∈ ω ↔ ⦋𝐴 / 𝑥⦌𝑁 ∈ ω))
5		sbceq2g 4387	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁) ↔ ∅ = ⦋𝐴 / 𝑥⦌(rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁)))
6		csbfv12 6933	. . . . . . . . 9 ⊢ ⦋𝐴 / 𝑥⦌(rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁) = (⦋𝐴 / 𝑥⦌rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁)
7		csbrdgg 38016	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩) = rec(⦋𝐴 / 𝑥⦌(𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⦋𝐴 / 𝑥⦌⟨𝑁, 𝑦⟩))
8		csbmpo123 38018	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))) = (𝑛 ∈ ⦋𝐴 / 𝑥⦌ω, 𝑧 ∈ ⦋𝐴 / 𝑥⦌V ↦ ⦋𝐴 / 𝑥⦌if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))))
9		csbconstg 3875	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌ω = ω)
10		csbconstg 3875	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌V = V)
11		csbif 4550	. . . . . . . . . . . . . . 15 ⊢ ⦋𝐴 / 𝑥⦌if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩)) = if([𝐴 / 𝑥](𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ⦋𝐴 / 𝑥⦌∅, ⦋𝐴 / 𝑥⦌if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))
12		sbcan 3796	. . . . . . . . . . . . . . . . 17 ⊢ ([𝐴 / 𝑥](𝑛 = 1o ∧ 𝑧 ∈ 𝑈) ↔ ([𝐴 / 𝑥]𝑛 = 1o ∧ [𝐴 / 𝑥]𝑧 ∈ 𝑈))
13		sbcg 3819	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑛 = 1o ↔ 𝑛 = 1o))
14		sbcel12 4379	. . . . . . . . . . . . . . . . . . 19 ⊢ ([𝐴 / 𝑥]𝑧 ∈ 𝑈 ↔ ⦋𝐴 / 𝑥⦌𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈)
15		csbconstg 3875	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝑧 = 𝑧)
16	15	eleq1d 2851	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈 ↔ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈))
17	14, 16	bitrid 286	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑧 ∈ 𝑈 ↔ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈))
18	13, 17	anbi12d 644	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ 𝑉 → (([𝐴 / 𝑥]𝑛 = 1o ∧ [𝐴 / 𝑥]𝑧 ∈ 𝑈) ↔ (𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈)))
19	12, 18	bitrid 286	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑛 = 1o ∧ 𝑧 ∈ 𝑈) ↔ (𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈)))
20		csbconstg 3875	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌∅ = ∅)
21		csbif 4550	. . . . . . . . . . . . . . . . 17 ⊢ ⦋𝐴 / 𝑥⦌if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩) = if([𝐴 / 𝑥]𝑧 ∈ (V × 𝑈), ⦋𝐴 / 𝑥⦌⟨∪ 𝑛, (1st ‘𝑧)⟩, ⦋𝐴 / 𝑥⦌⟨𝑛, 𝑧⟩)
22		sbcel12 4379	. . . . . . . . . . . . . . . . . . 19 ⊢ ([𝐴 / 𝑥]𝑧 ∈ (V × 𝑈) ↔ ⦋𝐴 / 𝑥⦌𝑧 ∈ ⦋𝐴 / 𝑥⦌(V × 𝑈))
23		csbxp 5767	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ⦋𝐴 / 𝑥⦌(V × 𝑈) = (⦋𝐴 / 𝑥⦌V × ⦋𝐴 / 𝑥⦌𝑈)
24	10	xpeq1d 5695	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌V × ⦋𝐴 / 𝑥⦌𝑈) = (V × ⦋𝐴 / 𝑥⦌𝑈))
25	23, 24	eqtrid 2813	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(V × 𝑈) = (V × ⦋𝐴 / 𝑥⦌𝑈))
26	15, 25	eleq12d 2860	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝑧 ∈ ⦋𝐴 / 𝑥⦌(V × 𝑈) ↔ 𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈)))
27	22, 26	bitrid 286	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑧 ∈ (V × 𝑈) ↔ 𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈)))
28		csbconstg 3875	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌⟨∪ 𝑛, (1st ‘𝑧)⟩ = ⟨∪ 𝑛, (1st ‘𝑧)⟩)
29		csbconstg 3875	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌⟨𝑛, 𝑧⟩ = ⟨𝑛, 𝑧⟩)
30	27, 28, 29	ifbieq12d 4521	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ 𝑉 → if([𝐴 / 𝑥]𝑧 ∈ (V × 𝑈), ⦋𝐴 / 𝑥⦌⟨∪ 𝑛, (1st ‘𝑧)⟩, ⦋𝐴 / 𝑥⦌⟨𝑛, 𝑧⟩) = if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))
31	21, 30	eqtrid 2813	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩) = if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))
32	19, 20, 31	ifbieq12d 4521	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ 𝑉 → if([𝐴 / 𝑥](𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ⦋𝐴 / 𝑥⦌∅, ⦋𝐴 / 𝑥⦌if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩)) = if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩)))
33	11, 32	eqtrid 2813	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩)) = if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩)))
34	9, 10, 33	mpoeq123dv 7498	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → (𝑛 ∈ ⦋𝐴 / 𝑥⦌ω, 𝑧 ∈ ⦋𝐴 / 𝑥⦌V ↦ ⦋𝐴 / 𝑥⦌if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))) = (𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))))
35	8, 34	eqtrd 2801	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))) = (𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))))
36		csbopg 4861	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌⟨𝑁, 𝑦⟩ = ⟨⦋𝐴 / 𝑥⦌𝑁, ⦋𝐴 / 𝑥⦌𝑦⟩)
37		csbconstg 3875	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝑦 = 𝑦)
38	37	opeq2d 4850	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → ⟨⦋𝐴 / 𝑥⦌𝑁, ⦋𝐴 / 𝑥⦌𝑦⟩ = ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)
39	36, 38	eqtrd 2801	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌⟨𝑁, 𝑦⟩ = ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)
40		rdgeq12 8409	. . . . . . . . . . . 12 ⊢ ((⦋𝐴 / 𝑥⦌(𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))) = (𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))) ∧ ⦋𝐴 / 𝑥⦌⟨𝑁, 𝑦⟩ = ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩) → rec(⦋𝐴 / 𝑥⦌(𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⦋𝐴 / 𝑥⦌⟨𝑁, 𝑦⟩) = rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩))
41	35, 39, 40	syl2anc 596	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → rec(⦋𝐴 / 𝑥⦌(𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⦋𝐴 / 𝑥⦌⟨𝑁, 𝑦⟩) = rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩))
42	7, 41	eqtrd 2801	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩) = rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩))
43	42	fveq1d 6890	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁) = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁))
44	6, 43	eqtrid 2813	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁) = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁))
45	44	eqeq2d 2777	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (∅ = ⦋𝐴 / 𝑥⦌(rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁) ↔ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁)))
46	5, 45	bitrd 282	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁) ↔ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁)))
47	4, 46	anbi12d 644	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (([𝐴 / 𝑥]𝑁 ∈ ω ∧ [𝐴 / 𝑥]∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁)) ↔ (⦋𝐴 / 𝑥⦌𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁))))
48	3, 47	bitrid 286	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁)) ↔ (⦋𝐴 / 𝑥⦌𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁))))
49	48	abbidv 2832	. . 3 ⊢ (𝐴 ∈ 𝑉 → {𝑦 ∣ [𝐴 / 𝑥](𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁))} = {𝑦 ∣ (⦋𝐴 / 𝑥⦌𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁))})
50		csbab 4408	. . 3 ⊢ ⦋𝐴 / 𝑥⦌{𝑦 ∣ (𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁))} = {𝑦 ∣ [𝐴 / 𝑥](𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁))}
51		df-finxp 38071	. . 3 ⊢ (⦋𝐴 / 𝑥⦌𝑈↑↑⦋𝐴 / 𝑥⦌𝑁) = {𝑦 ∣ (⦋𝐴 / 𝑥⦌𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁))}
52	49, 50, 51	3eqtr4g 2826	. 2 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌{𝑦 ∣ (𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁))} = (⦋𝐴 / 𝑥⦌𝑈↑↑⦋𝐴 / 𝑥⦌𝑁))
53	2, 52	eqtrid 2813	1 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝑈↑↑𝑁) = (⦋𝐴 / 𝑥⦌𝑈↑↑⦋𝐴 / 𝑥⦌𝑁))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  {cab 2744  Vcvv 3458  [wsbc 3747  ⦋csb 3856  ∅c0 4289  ifcif 4492  ⟨cop 4600  ∪ cuni 4877   × cxp 5664  ‘cfv 6543   ∈ cmpo 7425  ωcom 7871  1^st c1st 7993  reccrdg 8405  1_oc1o 8455  ↑↑cfinxp 38070

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-xp 5672  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-iota 6499  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-finxp 38071

This theorem is used by: (None)