Users' Mathboxes Mathbox for ML < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  finxpreclem6 Structured version   Visualization version   GIF version

Theorem finxpreclem6 33544
Description: Lemma for ↑↑ recursion theorems. (Contributed by ML, 24-Oct-2020.)
Hypothesis
Ref Expression
finxpreclem5.1 𝐹 = (𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1𝑜𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)))
Assertion
Ref Expression
finxpreclem6 ((𝑁 ∈ ω ∧ 1𝑜𝑁) → (𝑈↑↑𝑁) ⊆ (V × 𝑈))
Distinct variable groups:   𝑥,𝑛,𝑁   𝑈,𝑛,𝑥
Allowed substitution hints:   𝐹(𝑥,𝑛)

Proof of Theorem finxpreclem6
Dummy variables 𝑚 𝑜 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1 2827 . . . . 5 (𝑛 = 𝑁 → (𝑛 ∈ ω ↔ 𝑁 ∈ ω))
2 eleq2 2828 . . . . 5 (𝑛 = 𝑁 → (1𝑜𝑛 ↔ 1𝑜𝑁))
31, 2anbi12d 749 . . . 4 (𝑛 = 𝑁 → ((𝑛 ∈ ω ∧ 1𝑜𝑛) ↔ (𝑁 ∈ ω ∧ 1𝑜𝑁)))
4 anass 684 . . . . . . . . 9 (((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑦 ∈ (V × 𝑈)) ↔ (𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑦 ∈ (V × 𝑈))))
5 nfv 1992 . . . . . . . . . . . . . . 15 𝑥(𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑦 ∈ (V × 𝑈)))
6 finxpreclem5.1 . . . . . . . . . . . . . . . . . . . 20 𝐹 = (𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1𝑜𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)))
7 nfmpt22 6888 . . . . . . . . . . . . . . . . . . . 20 𝑥(𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1𝑜𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)))
86, 7nfcxfr 2900 . . . . . . . . . . . . . . . . . . 19 𝑥𝐹
9 nfcv 2902 . . . . . . . . . . . . . . . . . . 19 𝑥𝑛, 𝑦
108, 9nfrdg 7679 . . . . . . . . . . . . . . . . . 18 𝑥rec(𝐹, ⟨𝑛, 𝑦⟩)
11 nfcv 2902 . . . . . . . . . . . . . . . . . 18 𝑥𝑛
1210, 11nffv 6359 . . . . . . . . . . . . . . . . 17 𝑥(rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛)
1312nfeq2 2918 . . . . . . . . . . . . . . . 16 𝑥∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛)
1413nfn 1933 . . . . . . . . . . . . . . 15 𝑥 ¬ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛)
155, 14nfim 1974 . . . . . . . . . . . . . 14 𝑥((𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑦 ∈ (V × 𝑈))) → ¬ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛))
16 eleq1 2827 . . . . . . . . . . . . . . . . . 18 (𝑥 = 𝑦 → (𝑥 ∈ (V × 𝑈) ↔ 𝑦 ∈ (V × 𝑈)))
1716notbid 307 . . . . . . . . . . . . . . . . 17 (𝑥 = 𝑦 → (¬ 𝑥 ∈ (V × 𝑈) ↔ ¬ 𝑦 ∈ (V × 𝑈)))
1817anbi2d 742 . . . . . . . . . . . . . . . 16 (𝑥 = 𝑦 → ((1𝑜𝑛 ∧ ¬ 𝑥 ∈ (V × 𝑈)) ↔ (1𝑜𝑛 ∧ ¬ 𝑦 ∈ (V × 𝑈))))
1918anbi2d 742 . . . . . . . . . . . . . . 15 (𝑥 = 𝑦 → ((𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑥 ∈ (V × 𝑈))) ↔ (𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑦 ∈ (V × 𝑈)))))
20 opeq2 4554 . . . . . . . . . . . . . . . . . . 19 (𝑥 = 𝑦 → ⟨𝑛, 𝑥⟩ = ⟨𝑛, 𝑦⟩)
21 rdgeq2 7677 . . . . . . . . . . . . . . . . . . 19 (⟨𝑛, 𝑥⟩ = ⟨𝑛, 𝑦⟩ → rec(𝐹, ⟨𝑛, 𝑥⟩) = rec(𝐹, ⟨𝑛, 𝑦⟩))
2220, 21syl 17 . . . . . . . . . . . . . . . . . 18 (𝑥 = 𝑦 → rec(𝐹, ⟨𝑛, 𝑥⟩) = rec(𝐹, ⟨𝑛, 𝑦⟩))
2322fveq1d 6354 . . . . . . . . . . . . . . . . 17 (𝑥 = 𝑦 → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛) = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛))
2423eqeq2d 2770 . . . . . . . . . . . . . . . 16 (𝑥 = 𝑦 → (∅ = (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛) ↔ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛)))
2524notbid 307 . . . . . . . . . . . . . . 15 (𝑥 = 𝑦 → (¬ ∅ = (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛) ↔ ¬ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛)))
2619, 25imbi12d 333 . . . . . . . . . . . . . 14 (𝑥 = 𝑦 → (((𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑥 ∈ (V × 𝑈))) → ¬ ∅ = (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛)) ↔ ((𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑦 ∈ (V × 𝑈))) → ¬ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛))))
27 anass 684 . . . . . . . . . . . . . . . . . . 19 (((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑥 ∈ (V × 𝑈)) ↔ (𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑥 ∈ (V × 𝑈))))
28 vex 3343 . . . . . . . . . . . . . . . . . . . 20 𝑛 ∈ V
29 fveq2 6352 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑚 = ∅ → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑚) = (rec(𝐹, ⟨𝑛, 𝑥⟩)‘∅))
3029eqeq1d 2762 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑚 = ∅ → ((rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑚) = ⟨𝑛, 𝑥⟩ ↔ (rec(𝐹, ⟨𝑛, 𝑥⟩)‘∅) = ⟨𝑛, 𝑥⟩))
31 fveq2 6352 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑚 = 𝑜 → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑚) = (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑜))
3231eqeq1d 2762 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑚 = 𝑜 → ((rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑚) = ⟨𝑛, 𝑥⟩ ↔ (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑜) = ⟨𝑛, 𝑥⟩))
33 fveq2 6352 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑚 = suc 𝑜 → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑚) = (rec(𝐹, ⟨𝑛, 𝑥⟩)‘suc 𝑜))
3433eqeq1d 2762 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑚 = suc 𝑜 → ((rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑚) = ⟨𝑛, 𝑥⟩ ↔ (rec(𝐹, ⟨𝑛, 𝑥⟩)‘suc 𝑜) = ⟨𝑛, 𝑥⟩))
35 opex 5081 . . . . . . . . . . . . . . . . . . . . . . . . 25 𝑛, 𝑥⟩ ∈ V
3635rdg0 7686 . . . . . . . . . . . . . . . . . . . . . . . 24 (rec(𝐹, ⟨𝑛, 𝑥⟩)‘∅) = ⟨𝑛, 𝑥
3736a1i 11 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑥 ∈ (V × 𝑈)) → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘∅) = ⟨𝑛, 𝑥⟩)
38 nnon 7236 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 (𝑜 ∈ ω → 𝑜 ∈ On)
39 rdgsuc 7689 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 (𝑜 ∈ On → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘suc 𝑜) = (𝐹‘(rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑜)))
4038, 39syl 17 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (𝑜 ∈ ω → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘suc 𝑜) = (𝐹‘(rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑜)))
41 fveq2 6352 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 ((rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑜) = ⟨𝑛, 𝑥⟩ → (𝐹‘(rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑜)) = (𝐹‘⟨𝑛, 𝑥⟩))
4240, 41sylan9eq 2814 . . . . . . . . . . . . . . . . . . . . . . . . . 26 ((𝑜 ∈ ω ∧ (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑜) = ⟨𝑛, 𝑥⟩) → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘suc 𝑜) = (𝐹‘⟨𝑛, 𝑥⟩))
436finxpreclem5 33543 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 ((𝑛 ∈ ω ∧ 1𝑜𝑛) → (¬ 𝑥 ∈ (V × 𝑈) → (𝐹‘⟨𝑛, 𝑥⟩) = ⟨𝑛, 𝑥⟩))
4443imp 444 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑥 ∈ (V × 𝑈)) → (𝐹‘⟨𝑛, 𝑥⟩) = ⟨𝑛, 𝑥⟩)
4542, 44sylan9eq 2814 . . . . . . . . . . . . . . . . . . . . . . . . 25 (((𝑜 ∈ ω ∧ (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑜) = ⟨𝑛, 𝑥⟩) ∧ ((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑥 ∈ (V × 𝑈))) → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘suc 𝑜) = ⟨𝑛, 𝑥⟩)
4645expl 649 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑜 ∈ ω → (((rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑜) = ⟨𝑛, 𝑥⟩ ∧ ((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑥 ∈ (V × 𝑈))) → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘suc 𝑜) = ⟨𝑛, 𝑥⟩))
4746expcomd 453 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑜 ∈ ω → (((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑥 ∈ (V × 𝑈)) → ((rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑜) = ⟨𝑛, 𝑥⟩ → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘suc 𝑜) = ⟨𝑛, 𝑥⟩)))
4830, 32, 34, 37, 47finds2 7259 . . . . . . . . . . . . . . . . . . . . . 22 (𝑚 ∈ ω → (((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑥 ∈ (V × 𝑈)) → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑚) = ⟨𝑛, 𝑥⟩))
49 eleq1 2827 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑛 = 𝑚 → (𝑛 ∈ ω ↔ 𝑚 ∈ ω))
50 fveq2 6352 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝑛 = 𝑚 → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛) = (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑚))
5150eqeq1d 2762 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑛 = 𝑚 → ((rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛) = ⟨𝑛, 𝑥⟩ ↔ (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑚) = ⟨𝑛, 𝑥⟩))
5251imbi2d 329 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑛 = 𝑚 → ((((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑥 ∈ (V × 𝑈)) → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛) = ⟨𝑛, 𝑥⟩) ↔ (((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑥 ∈ (V × 𝑈)) → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑚) = ⟨𝑛, 𝑥⟩)))
5349, 52imbi12d 333 . . . . . . . . . . . . . . . . . . . . . 22 (𝑛 = 𝑚 → ((𝑛 ∈ ω → (((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑥 ∈ (V × 𝑈)) → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛) = ⟨𝑛, 𝑥⟩)) ↔ (𝑚 ∈ ω → (((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑥 ∈ (V × 𝑈)) → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑚) = ⟨𝑛, 𝑥⟩))))
5448, 53mpbiri 248 . . . . . . . . . . . . . . . . . . . . 21 (𝑛 = 𝑚 → (𝑛 ∈ ω → (((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑥 ∈ (V × 𝑈)) → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛) = ⟨𝑛, 𝑥⟩)))
5554equcoms 2102 . . . . . . . . . . . . . . . . . . . 20 (𝑚 = 𝑛 → (𝑛 ∈ ω → (((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑥 ∈ (V × 𝑈)) → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛) = ⟨𝑛, 𝑥⟩)))
5628, 55vtocle 3422 . . . . . . . . . . . . . . . . . . 19 (𝑛 ∈ ω → (((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑥 ∈ (V × 𝑈)) → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛) = ⟨𝑛, 𝑥⟩))
5727, 56syl5bir 233 . . . . . . . . . . . . . . . . . 18 (𝑛 ∈ ω → ((𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑥 ∈ (V × 𝑈))) → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛) = ⟨𝑛, 𝑥⟩))
5857anabsi5 893 . . . . . . . . . . . . . . . . 17 ((𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑥 ∈ (V × 𝑈))) → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛) = ⟨𝑛, 𝑥⟩)
59 vex 3343 . . . . . . . . . . . . . . . . . . 19 𝑥 ∈ V
6028, 59opnzi 5091 . . . . . . . . . . . . . . . . . 18 𝑛, 𝑥⟩ ≠ ∅
6160a1i 11 . . . . . . . . . . . . . . . . 17 ((𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑥 ∈ (V × 𝑈))) → ⟨𝑛, 𝑥⟩ ≠ ∅)
6258, 61eqnetrd 2999 . . . . . . . . . . . . . . . 16 ((𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑥 ∈ (V × 𝑈))) → (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛) ≠ ∅)
6362necomd 2987 . . . . . . . . . . . . . . 15 ((𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑥 ∈ (V × 𝑈))) → ∅ ≠ (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛))
6463neneqd 2937 . . . . . . . . . . . . . 14 ((𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑥 ∈ (V × 𝑈))) → ¬ ∅ = (rec(𝐹, ⟨𝑛, 𝑥⟩)‘𝑛))
6515, 26, 64chvar 2407 . . . . . . . . . . . . 13 ((𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑦 ∈ (V × 𝑈))) → ¬ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛))
6665intnand 1000 . . . . . . . . . . . 12 ((𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑦 ∈ (V × 𝑈))) → ¬ (𝑛 ∈ ω ∧ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛)))
6766adantl 473 . . . . . . . . . . 11 ((𝑛 = 𝑁 ∧ (𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑦 ∈ (V × 𝑈)))) → ¬ (𝑛 ∈ ω ∧ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛)))
68 abid 2748 . . . . . . . . . . . . 13 (𝑦 ∈ {𝑦 ∣ (𝑛 ∈ ω ∧ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛))} ↔ (𝑛 ∈ ω ∧ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛)))
69 opeq1 4553 . . . . . . . . . . . . . . . . . . . 20 (𝑛 = 𝑁 → ⟨𝑛, 𝑦⟩ = ⟨𝑁, 𝑦⟩)
70 rdgeq2 7677 . . . . . . . . . . . . . . . . . . . 20 (⟨𝑛, 𝑦⟩ = ⟨𝑁, 𝑦⟩ → rec(𝐹, ⟨𝑛, 𝑦⟩) = rec(𝐹, ⟨𝑁, 𝑦⟩))
7169, 70syl 17 . . . . . . . . . . . . . . . . . . 19 (𝑛 = 𝑁 → rec(𝐹, ⟨𝑛, 𝑦⟩) = rec(𝐹, ⟨𝑁, 𝑦⟩))
72 id 22 . . . . . . . . . . . . . . . . . . 19 (𝑛 = 𝑁𝑛 = 𝑁)
7371, 72fveq12d 6358 . . . . . . . . . . . . . . . . . 18 (𝑛 = 𝑁 → (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛) = (rec(𝐹, ⟨𝑁, 𝑦⟩)‘𝑁))
7473eqeq2d 2770 . . . . . . . . . . . . . . . . 17 (𝑛 = 𝑁 → (∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛) ↔ ∅ = (rec(𝐹, ⟨𝑁, 𝑦⟩)‘𝑁)))
751, 74anbi12d 749 . . . . . . . . . . . . . . . 16 (𝑛 = 𝑁 → ((𝑛 ∈ ω ∧ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛)) ↔ (𝑁 ∈ ω ∧ ∅ = (rec(𝐹, ⟨𝑁, 𝑦⟩)‘𝑁))))
7675abbidv 2879 . . . . . . . . . . . . . . 15 (𝑛 = 𝑁 → {𝑦 ∣ (𝑛 ∈ ω ∧ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛))} = {𝑦 ∣ (𝑁 ∈ ω ∧ ∅ = (rec(𝐹, ⟨𝑁, 𝑦⟩)‘𝑁))})
776dffinxpf 33533 . . . . . . . . . . . . . . 15 (𝑈↑↑𝑁) = {𝑦 ∣ (𝑁 ∈ ω ∧ ∅ = (rec(𝐹, ⟨𝑁, 𝑦⟩)‘𝑁))}
7876, 77syl6eqr 2812 . . . . . . . . . . . . . 14 (𝑛 = 𝑁 → {𝑦 ∣ (𝑛 ∈ ω ∧ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛))} = (𝑈↑↑𝑁))
7978eleq2d 2825 . . . . . . . . . . . . 13 (𝑛 = 𝑁 → (𝑦 ∈ {𝑦 ∣ (𝑛 ∈ ω ∧ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛))} ↔ 𝑦 ∈ (𝑈↑↑𝑁)))
8068, 79syl5rbbr 275 . . . . . . . . . . . 12 (𝑛 = 𝑁 → (𝑦 ∈ (𝑈↑↑𝑁) ↔ (𝑛 ∈ ω ∧ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛))))
8180adantr 472 . . . . . . . . . . 11 ((𝑛 = 𝑁 ∧ (𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑦 ∈ (V × 𝑈)))) → (𝑦 ∈ (𝑈↑↑𝑁) ↔ (𝑛 ∈ ω ∧ ∅ = (rec(𝐹, ⟨𝑛, 𝑦⟩)‘𝑛))))
8267, 81mtbird 314 . . . . . . . . . 10 ((𝑛 = 𝑁 ∧ (𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑦 ∈ (V × 𝑈)))) → ¬ 𝑦 ∈ (𝑈↑↑𝑁))
8382ex 449 . . . . . . . . 9 (𝑛 = 𝑁 → ((𝑛 ∈ ω ∧ (1𝑜𝑛 ∧ ¬ 𝑦 ∈ (V × 𝑈))) → ¬ 𝑦 ∈ (𝑈↑↑𝑁)))
844, 83syl5bi 232 . . . . . . . 8 (𝑛 = 𝑁 → (((𝑛 ∈ ω ∧ 1𝑜𝑛) ∧ ¬ 𝑦 ∈ (V × 𝑈)) → ¬ 𝑦 ∈ (𝑈↑↑𝑁)))
8584expdimp 452 . . . . . . 7 ((𝑛 = 𝑁 ∧ (𝑛 ∈ ω ∧ 1𝑜𝑛)) → (¬ 𝑦 ∈ (V × 𝑈) → ¬ 𝑦 ∈ (𝑈↑↑𝑁)))
8685con4d 114 . . . . . 6 ((𝑛 = 𝑁 ∧ (𝑛 ∈ ω ∧ 1𝑜𝑛)) → (𝑦 ∈ (𝑈↑↑𝑁) → 𝑦 ∈ (V × 𝑈)))
8786ssrdv 3750 . . . . 5 ((𝑛 = 𝑁 ∧ (𝑛 ∈ ω ∧ 1𝑜𝑛)) → (𝑈↑↑𝑁) ⊆ (V × 𝑈))
8887ex 449 . . . 4 (𝑛 = 𝑁 → ((𝑛 ∈ ω ∧ 1𝑜𝑛) → (𝑈↑↑𝑁) ⊆ (V × 𝑈)))
893, 88sylbird 250 . . 3 (𝑛 = 𝑁 → ((𝑁 ∈ ω ∧ 1𝑜𝑁) → (𝑈↑↑𝑁) ⊆ (V × 𝑈)))
9089vtocleg 3419 . 2 (𝑁 ∈ ω → ((𝑁 ∈ ω ∧ 1𝑜𝑁) → (𝑈↑↑𝑁) ⊆ (V × 𝑈)))
9190anabsi5 893 1 ((𝑁 ∈ ω ∧ 1𝑜𝑁) → (𝑈↑↑𝑁) ⊆ (V × 𝑈))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 383   = wceq 1632  wcel 2139  {cab 2746  wne 2932  Vcvv 3340  wss 3715  c0 4058  ifcif 4230  cop 4327   cuni 4588   × cxp 5264  Oncon0 5884  suc csuc 5886  cfv 6049  cmpt2 6815  ωcom 7230  1st c1st 7331  reccrdg 7674  1𝑜c1o 7722  ↑↑cfinxp 33531
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7114
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-ral 3055  df-rex 3056  df-reu 3057  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-tr 4905  df-id 5174  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-we 5227  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-pred 5841  df-ord 5887  df-on 5888  df-lim 5889  df-suc 5890  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-ov 6816  df-oprab 6817  df-mpt2 6818  df-om 7231  df-wrecs 7576  df-recs 7637  df-rdg 7675  df-1o 7729  df-finxp 33532
This theorem is referenced by:  finxpsuclem  33545
  Copyright terms: Public domain W3C validator