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

Theorem finxpreclem3 36366
Description: Lemma for ↑↑ recursion theorems. (Contributed by ML, 20-Oct-2020.)
Hypothesis
Ref Expression
finxpreclem3.1 𝐹 = (𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)))
Assertion
Ref Expression
finxpreclem3 (((𝑁 ∈ ω ∧ 2o𝑁) ∧ 𝑋 ∈ (V × 𝑈)) → ⟨ 𝑁, (1st𝑋)⟩ = (𝐹‘⟨𝑁, 𝑋⟩))
Distinct variable groups:   𝑛,𝑁,𝑥   𝑈,𝑛,𝑥   𝑛,𝑋,𝑥
Allowed substitution hints:   𝐹(𝑥,𝑛)

Proof of Theorem finxpreclem3
StepHypRef Expression
1 finxpreclem3.1 . . . 4 𝐹 = (𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)))
21a1i 11 . . 3 (((𝑁 ∈ ω ∧ 2o𝑁) ∧ 𝑋 ∈ (V × 𝑈)) → 𝐹 = (𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩))))
3 eqeq1 2736 . . . . . . 7 (𝑛 = 𝑁 → (𝑛 = 1o𝑁 = 1o))
4 eleq1 2821 . . . . . . 7 (𝑥 = 𝑋 → (𝑥𝑈𝑋𝑈))
53, 4bi2anan9 637 . . . . . 6 ((𝑛 = 𝑁𝑥 = 𝑋) → ((𝑛 = 1o𝑥𝑈) ↔ (𝑁 = 1o𝑋𝑈)))
6 eleq1 2821 . . . . . . . 8 (𝑥 = 𝑋 → (𝑥 ∈ (V × 𝑈) ↔ 𝑋 ∈ (V × 𝑈)))
76adantl 482 . . . . . . 7 ((𝑛 = 𝑁𝑥 = 𝑋) → (𝑥 ∈ (V × 𝑈) ↔ 𝑋 ∈ (V × 𝑈)))
8 unieq 4919 . . . . . . . . 9 (𝑛 = 𝑁 𝑛 = 𝑁)
98adantr 481 . . . . . . . 8 ((𝑛 = 𝑁𝑥 = 𝑋) → 𝑛 = 𝑁)
10 fveq2 6891 . . . . . . . . 9 (𝑥 = 𝑋 → (1st𝑥) = (1st𝑋))
1110adantl 482 . . . . . . . 8 ((𝑛 = 𝑁𝑥 = 𝑋) → (1st𝑥) = (1st𝑋))
129, 11opeq12d 4881 . . . . . . 7 ((𝑛 = 𝑁𝑥 = 𝑋) → ⟨ 𝑛, (1st𝑥)⟩ = ⟨ 𝑁, (1st𝑋)⟩)
13 opeq12 4875 . . . . . . 7 ((𝑛 = 𝑁𝑥 = 𝑋) → ⟨𝑛, 𝑥⟩ = ⟨𝑁, 𝑋⟩)
147, 12, 13ifbieq12d 4556 . . . . . 6 ((𝑛 = 𝑁𝑥 = 𝑋) → if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩) = if(𝑋 ∈ (V × 𝑈), ⟨ 𝑁, (1st𝑋)⟩, ⟨𝑁, 𝑋⟩))
155, 14ifbieq2d 4554 . . . . 5 ((𝑛 = 𝑁𝑥 = 𝑋) → if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)) = if((𝑁 = 1o𝑋𝑈), ∅, if(𝑋 ∈ (V × 𝑈), ⟨ 𝑁, (1st𝑋)⟩, ⟨𝑁, 𝑋⟩)))
16 sssucid 6444 . . . . . . . . . . . . 13 1o ⊆ suc 1o
17 df-2o 8469 . . . . . . . . . . . . 13 2o = suc 1o
1816, 17sseqtrri 4019 . . . . . . . . . . . 12 1o ⊆ 2o
19 1on 8480 . . . . . . . . . . . . . 14 1o ∈ On
2017, 19sucneqoni 36339 . . . . . . . . . . . . 13 2o ≠ 1o
2120necomi 2995 . . . . . . . . . . . 12 1o ≠ 2o
22 df-pss 3967 . . . . . . . . . . . 12 (1o ⊊ 2o ↔ (1o ⊆ 2o ∧ 1o ≠ 2o))
2318, 21, 22mpbir2an 709 . . . . . . . . . . 11 1o ⊊ 2o
24 ssnpss 4103 . . . . . . . . . . 11 (2o ⊆ 1o → ¬ 1o ⊊ 2o)
2523, 24mt2 199 . . . . . . . . . 10 ¬ 2o ⊆ 1o
26 sseq2 4008 . . . . . . . . . 10 (𝑁 = 1o → (2o𝑁 ↔ 2o ⊆ 1o))
2725, 26mtbiri 326 . . . . . . . . 9 (𝑁 = 1o → ¬ 2o𝑁)
2827con2i 139 . . . . . . . 8 (2o𝑁 → ¬ 𝑁 = 1o)
2928intnanrd 490 . . . . . . 7 (2o𝑁 → ¬ (𝑁 = 1o𝑋𝑈))
3029iffalsed 4539 . . . . . 6 (2o𝑁 → if((𝑁 = 1o𝑋𝑈), ∅, if(𝑋 ∈ (V × 𝑈), ⟨ 𝑁, (1st𝑋)⟩, ⟨𝑁, 𝑋⟩)) = if(𝑋 ∈ (V × 𝑈), ⟨ 𝑁, (1st𝑋)⟩, ⟨𝑁, 𝑋⟩))
31 iftrue 4534 . . . . . 6 (𝑋 ∈ (V × 𝑈) → if(𝑋 ∈ (V × 𝑈), ⟨ 𝑁, (1st𝑋)⟩, ⟨𝑁, 𝑋⟩) = ⟨ 𝑁, (1st𝑋)⟩)
3230, 31sylan9eq 2792 . . . . 5 ((2o𝑁𝑋 ∈ (V × 𝑈)) → if((𝑁 = 1o𝑋𝑈), ∅, if(𝑋 ∈ (V × 𝑈), ⟨ 𝑁, (1st𝑋)⟩, ⟨𝑁, 𝑋⟩)) = ⟨ 𝑁, (1st𝑋)⟩)
3315, 32sylan9eqr 2794 . . . 4 (((2o𝑁𝑋 ∈ (V × 𝑈)) ∧ (𝑛 = 𝑁𝑥 = 𝑋)) → if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)) = ⟨ 𝑁, (1st𝑋)⟩)
3433adantlll 716 . . 3 ((((𝑁 ∈ ω ∧ 2o𝑁) ∧ 𝑋 ∈ (V × 𝑈)) ∧ (𝑛 = 𝑁𝑥 = 𝑋)) → if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)) = ⟨ 𝑁, (1st𝑋)⟩)
35 simpll 765 . . 3 (((𝑁 ∈ ω ∧ 2o𝑁) ∧ 𝑋 ∈ (V × 𝑈)) → 𝑁 ∈ ω)
36 elex 3492 . . . 4 (𝑋 ∈ (V × 𝑈) → 𝑋 ∈ V)
3736adantl 482 . . 3 (((𝑁 ∈ ω ∧ 2o𝑁) ∧ 𝑋 ∈ (V × 𝑈)) → 𝑋 ∈ V)
38 opex 5464 . . . 4 𝑁, (1st𝑋)⟩ ∈ V
3938a1i 11 . . 3 (((𝑁 ∈ ω ∧ 2o𝑁) ∧ 𝑋 ∈ (V × 𝑈)) → ⟨ 𝑁, (1st𝑋)⟩ ∈ V)
402, 34, 35, 37, 39ovmpod 7562 . 2 (((𝑁 ∈ ω ∧ 2o𝑁) ∧ 𝑋 ∈ (V × 𝑈)) → (𝑁𝐹𝑋) = ⟨ 𝑁, (1st𝑋)⟩)
41 df-ov 7414 . 2 (𝑁𝐹𝑋) = (𝐹‘⟨𝑁, 𝑋⟩)
4240, 41eqtr3di 2787 1 (((𝑁 ∈ ω ∧ 2o𝑁) ∧ 𝑋 ∈ (V × 𝑈)) → ⟨ 𝑁, (1st𝑋)⟩ = (𝐹‘⟨𝑁, 𝑋⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106  wne 2940  Vcvv 3474  wss 3948  wpss 3949  c0 4322  ifcif 4528  cop 4634   cuni 4908   × cxp 5674  suc csuc 6366  cfv 6543  (class class class)co 7411  cmpo 7413  ωcom 7857  1st c1st 7975  1oc1o 8461  2oc2o 8462
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-un 7727
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-sbc 3778  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-ord 6367  df-on 6368  df-suc 6370  df-iota 6495  df-fun 6545  df-fv 6551  df-ov 7414  df-oprab 7415  df-mpo 7416  df-1o 8468  df-2o 8469
This theorem is referenced by:  finxpreclem4  36367
  Copyright terms: Public domain W3C validator