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

Theorem finxpreclem1 34657
 Description: Lemma for ↑↑ recursion theorems. (Contributed by ML, 17-Oct-2020.)
Assertion
Ref Expression
finxpreclem1 (𝑋𝑈 → ∅ = ((𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)))‘⟨1o, 𝑋⟩))
Distinct variable groups:   𝑈,𝑛,𝑥   𝑛,𝑋,𝑥

Proof of Theorem finxpreclem1
StepHypRef Expression
1 df-ov 7151 . 2 (1o(𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)))𝑋) = ((𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)))‘⟨1o, 𝑋⟩)
2 eqidd 2820 . . 3 (𝑋𝑈 → (𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩))) = (𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩))))
3 eleq1a 2906 . . . . . 6 (𝑋𝑈 → (𝑥 = 𝑋𝑥𝑈))
43anim2d 613 . . . . 5 (𝑋𝑈 → ((𝑛 = 1o𝑥 = 𝑋) → (𝑛 = 1o𝑥𝑈)))
5 iftrue 4471 . . . . 5 ((𝑛 = 1o𝑥𝑈) → if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)) = ∅)
64, 5syl6 35 . . . 4 (𝑋𝑈 → ((𝑛 = 1o𝑥 = 𝑋) → if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)) = ∅))
76imp 409 . . 3 ((𝑋𝑈 ∧ (𝑛 = 1o𝑥 = 𝑋)) → if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)) = ∅)
8 1onn 8257 . . . 4 1o ∈ ω
98a1i 11 . . 3 (𝑋𝑈 → 1o ∈ ω)
10 elex 3511 . . 3 (𝑋𝑈𝑋 ∈ V)
11 0ex 5202 . . . 4 ∅ ∈ V
1211a1i 11 . . 3 (𝑋𝑈 → ∅ ∈ V)
132, 7, 9, 10, 12ovmpod 7294 . 2 (𝑋𝑈 → (1o(𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)))𝑋) = ∅)
141, 13syl5reqr 2869 1 (𝑋𝑈 → ∅ = ((𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩)))‘⟨1o, 𝑋⟩))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 398   = wceq 1530   ∈ wcel 2107  Vcvv 3493  ∅c0 4289  ifcif 4465  ⟨cop 4565  ∪ cuni 4830   × cxp 5546  ‘cfv 6348  (class class class)co 7148   ∈ cmpo 7150  ωcom 7572  1st c1st 7679  1oc1o 8087 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2791  ax-sep 5194  ax-nul 5201  ax-pr 5320  ax-un 7453 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1082  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-ral 3141  df-rex 3142  df-rab 3145  df-v 3495  df-sbc 3771  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-pss 3952  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-tp 4564  df-op 4566  df-uni 4831  df-br 5058  df-opab 5120  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fv 6356  df-ov 7151  df-oprab 7152  df-mpo 7153  df-om 7573  df-1o 8094 This theorem is referenced by:  finxp1o  34660
 Copyright terms: Public domain W3C validator