Theorem csbfinxpg 38062

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 38058	. . 3 ⊢ (𝑈↑↑𝑁) = {𝑦 ∣ (𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁))}
2	1	csbeq2i 3861	. 2 ⊢ ⦋𝐴 / 𝑥⦌(𝑈↑↑𝑁) = ⦋𝐴 / 𝑥⦌{𝑦 ∣ (𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁))}
3		sbcan 3793	. . . . 5 ⊢ ([𝐴 / 𝑥](𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁)) ↔ ([𝐴 / 𝑥]𝑁 ∈ ω ∧ [𝐴 / 𝑥]∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁)))
4		sbcel1g 4381	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑁 ∈ ω ↔ ⦋𝐴 / 𝑥⦌𝑁 ∈ ω))
5		sbceq2g 4384	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁) ↔ ∅ = ⦋𝐴 / 𝑥⦌(rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁)))
6		csbfv12 6926	. . . . . . . . 9 ⊢ ⦋𝐴 / 𝑥⦌(rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁) = (⦋𝐴 / 𝑥⦌rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁)
7		csbrdgg 38003	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩) = rec(⦋𝐴 / 𝑥⦌(𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⦋𝐴 / 𝑥⦌⟨𝑁, 𝑦⟩))
8		csbmpo123 38005	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))) = (𝑛 ∈ ⦋𝐴 / 𝑥⦌ω, 𝑧 ∈ ⦋𝐴 / 𝑥⦌V ↦ ⦋𝐴 / 𝑥⦌if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))))
9		csbconstg 3872	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌ω = ω)
10		csbconstg 3872	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌V = V)
11		csbif 4545	. . . . . . . . . . . . . . 15 ⊢ ⦋𝐴 / 𝑥⦌if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩)) = if([𝐴 / 𝑥](𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ⦋𝐴 / 𝑥⦌∅, ⦋𝐴 / 𝑥⦌if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))
12		sbcan 3793	. . . . . . . . . . . . . . . . 17 ⊢ ([𝐴 / 𝑥](𝑛 = 1o ∧ 𝑧 ∈ 𝑈) ↔ ([𝐴 / 𝑥]𝑛 = 1o ∧ [𝐴 / 𝑥]𝑧 ∈ 𝑈))
13		sbcg 3816	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑛 = 1o ↔ 𝑛 = 1o))
14		sbcel12 4376	. . . . . . . . . . . . . . . . . . 19 ⊢ ([𝐴 / 𝑥]𝑧 ∈ 𝑈 ↔ ⦋𝐴 / 𝑥⦌𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈)
15		csbconstg 3872	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝑧 = 𝑧)
16	15	eleq1d 2848	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈 ↔ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈))
17	14, 16	bitrid 286	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑧 ∈ 𝑈 ↔ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈))
18	13, 17	anbi12d 643	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ 𝑉 → (([𝐴 / 𝑥]𝑛 = 1o ∧ [𝐴 / 𝑥]𝑧 ∈ 𝑈) ↔ (𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈)))
19	12, 18	bitrid 286	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑛 = 1o ∧ 𝑧 ∈ 𝑈) ↔ (𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈)))
20		csbconstg 3872	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌∅ = ∅)
21		csbif 4545	. . . . . . . . . . . . . . . . 17 ⊢ ⦋𝐴 / 𝑥⦌if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩) = if([𝐴 / 𝑥]𝑧 ∈ (V × 𝑈), ⦋𝐴 / 𝑥⦌⟨∪ 𝑛, (1st ‘𝑧)⟩, ⦋𝐴 / 𝑥⦌⟨𝑛, 𝑧⟩)
22		sbcel12 4376	. . . . . . . . . . . . . . . . . . 19 ⊢ ([𝐴 / 𝑥]𝑧 ∈ (V × 𝑈) ↔ ⦋𝐴 / 𝑥⦌𝑧 ∈ ⦋𝐴 / 𝑥⦌(V × 𝑈))
23		csbxp 5762	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ⦋𝐴 / 𝑥⦌(V × 𝑈) = (⦋𝐴 / 𝑥⦌V × ⦋𝐴 / 𝑥⦌𝑈)
24	10	xpeq1d 5690	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌V × ⦋𝐴 / 𝑥⦌𝑈) = (V × ⦋𝐴 / 𝑥⦌𝑈))
25	23, 24	eqtrid 2810	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(V × 𝑈) = (V × ⦋𝐴 / 𝑥⦌𝑈))
26	15, 25	eleq12d 2857	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝑧 ∈ ⦋𝐴 / 𝑥⦌(V × 𝑈) ↔ 𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈)))
27	22, 26	bitrid 286	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑧 ∈ (V × 𝑈) ↔ 𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈)))
28		csbconstg 3872	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌⟨∪ 𝑛, (1st ‘𝑧)⟩ = ⟨∪ 𝑛, (1st ‘𝑧)⟩)
29		csbconstg 3872	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌⟨𝑛, 𝑧⟩ = ⟨𝑛, 𝑧⟩)
30	27, 28, 29	ifbieq12d 4516	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ 𝑉 → if([𝐴 / 𝑥]𝑧 ∈ (V × 𝑈), ⦋𝐴 / 𝑥⦌⟨∪ 𝑛, (1st ‘𝑧)⟩, ⦋𝐴 / 𝑥⦌⟨𝑛, 𝑧⟩) = if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))
31	21, 30	eqtrid 2810	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩) = if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))
32	19, 20, 31	ifbieq12d 4516	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ 𝑉 → if([𝐴 / 𝑥](𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ⦋𝐴 / 𝑥⦌∅, ⦋𝐴 / 𝑥⦌if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩)) = if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩)))
33	11, 32	eqtrid 2810	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩)) = if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩)))
34	9, 10, 33	mpoeq123dv 7485	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → (𝑛 ∈ ⦋𝐴 / 𝑥⦌ω, 𝑧 ∈ ⦋𝐴 / 𝑥⦌V ↦ ⦋𝐴 / 𝑥⦌if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))) = (𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))))
35	8, 34	eqtrd 2798	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))) = (𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))))
36		csbopg 4856	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌⟨𝑁, 𝑦⟩ = ⟨⦋𝐴 / 𝑥⦌𝑁, ⦋𝐴 / 𝑥⦌𝑦⟩)
37		csbconstg 3872	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝑦 = 𝑦)
38	37	opeq2d 4845	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → ⟨⦋𝐴 / 𝑥⦌𝑁, ⦋𝐴 / 𝑥⦌𝑦⟩ = ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)
39	36, 38	eqtrd 2798	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌⟨𝑁, 𝑦⟩ = ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)
40		rdgeq12 8396	. . . . . . . . . . . 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 595	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → rec(⦋𝐴 / 𝑥⦌(𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⦋𝐴 / 𝑥⦌⟨𝑁, 𝑦⟩) = rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩))
42	7, 41	eqtrd 2798	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩) = rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩))
43	42	fveq1d 6883	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁) = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁))
44	6, 43	eqtrid 2810	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁) = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁))
45	44	eqeq2d 2774	. . . . . . 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 643	. . . . 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 2829	. . 3 ⊢ (𝐴 ∈ 𝑉 → {𝑦 ∣ [𝐴 / 𝑥](𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁))} = {𝑦 ∣ (⦋𝐴 / 𝑥⦌𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁))})
50		csbab 4405	. . 3 ⊢ ⦋𝐴 / 𝑥⦌{𝑦 ∣ (𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁))} = {𝑦 ∣ [𝐴 / 𝑥](𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁))}
51		df-finxp 38058	. . 3 ⊢ (⦋𝐴 / 𝑥⦌𝑈↑↑⦋𝐴 / 𝑥⦌𝑁) = {𝑦 ∣ (⦋𝐴 / 𝑥⦌𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ ⦋𝐴 / 𝑥⦌𝑈), ∅, if(𝑧 ∈ (V × ⦋𝐴 / 𝑥⦌𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨⦋𝐴 / 𝑥⦌𝑁, 𝑦⟩)‘⦋𝐴 / 𝑥⦌𝑁))}
52	49, 50, 51	3eqtr4g 2823	. 2 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌{𝑦 ∣ (𝑁 ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑧 ∈ V ↦ if((𝑛 = 1o ∧ 𝑧 ∈ 𝑈), ∅, if(𝑧 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑧)⟩, ⟨𝑛, 𝑧⟩))), ⟨𝑁, 𝑦⟩)‘𝑁))} = (⦋𝐴 / 𝑥⦌𝑈↑↑⦋𝐴 / 𝑥⦌𝑁))
53	2, 52	eqtrid 2810	1 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝑈↑↑𝑁) = (⦋𝐴 / 𝑥⦌𝑈↑↑⦋𝐴 / 𝑥⦌𝑁))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1570   ∈ wcel 2143  {cab 2741  Vcvv 3455  [wsbc 3744  ⦋csb 3853  ∅c0 4286  ifcif 4487  ⟨cop 4595  ∪ cuni 4872   × cxp 5659  ‘cfv 6536   ∈ cmpo 7412  ωcom 7858  1^st c1st 7980  reccrdg 8392  1_oc1o 8442  ↑↑cfinxp 38057

This proof depends on 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-sep 5257  ax-nul 5269  ax-pr 5404

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  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-ral 3080  df-rex 3090  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-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-xp 5667  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-iota 6492  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-finxp 38058

This theorem is used by: (None)