MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pwfseqlem2 Structured version   Visualization version   GIF version

Theorem pwfseqlem2 10346
Description: Lemma for pwfseq 10351. (Contributed by Mario Carneiro, 18-Nov-2014.) (Revised by AV, 18-Sep-2021.)
Hypotheses
Ref Expression
pwfseqlem4.g (𝜑𝐺:𝒫 𝐴1-1 𝑛 ∈ ω (𝐴m 𝑛))
pwfseqlem4.x (𝜑𝑋𝐴)
pwfseqlem4.h (𝜑𝐻:ω–1-1-onto𝑋)
pwfseqlem4.ps (𝜓 ↔ ((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) ∧ ω ≼ 𝑥))
pwfseqlem4.k ((𝜑𝜓) → 𝐾: 𝑛 ∈ ω (𝑥m 𝑛)–1-1𝑥)
pwfseqlem4.d 𝐷 = (𝐺‘{𝑤𝑥 ∣ ((𝐾𝑤) ∈ ran 𝐺 ∧ ¬ 𝑤 ∈ (𝐺‘(𝐾𝑤)))})
pwfseqlem4.f 𝐹 = (𝑥 ∈ V, 𝑟 ∈ V ↦ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷 {𝑧 ∈ ω ∣ ¬ (𝐷𝑧) ∈ 𝑥})))
Assertion
Ref Expression
pwfseqlem2 ((𝑌 ∈ Fin ∧ 𝑅𝑉) → (𝑌𝐹𝑅) = (𝐻‘(card‘𝑌)))
Distinct variable groups:   𝑛,𝑟,𝑤,𝑥,𝑧   𝐷,𝑛,𝑧   𝑤,𝐺   𝑤,𝐾   𝐻,𝑟,𝑥,𝑧   𝜑,𝑛,𝑟,𝑥,𝑧   𝜓,𝑛,𝑧   𝐴,𝑛,𝑟,𝑥,𝑧   𝑉,𝑟,𝑥
Allowed substitution hints:   𝜑(𝑤)   𝜓(𝑥,𝑤,𝑟)   𝐴(𝑤)   𝐷(𝑥,𝑤,𝑟)   𝑅(𝑥,𝑧,𝑤,𝑛,𝑟)   𝐹(𝑥,𝑧,𝑤,𝑛,𝑟)   𝐺(𝑥,𝑧,𝑛,𝑟)   𝐻(𝑤,𝑛)   𝐾(𝑥,𝑧,𝑛,𝑟)   𝑉(𝑧,𝑤,𝑛)   𝑋(𝑥,𝑧,𝑤,𝑛,𝑟)   𝑌(𝑥,𝑧,𝑤,𝑛,𝑟)

Proof of Theorem pwfseqlem2
Dummy variables 𝑎 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq1 7262 . . 3 (𝑎 = 𝑌 → (𝑎𝐹𝑠) = (𝑌𝐹𝑠))
2 2fveq3 6761 . . 3 (𝑎 = 𝑌 → (𝐻‘(card‘𝑎)) = (𝐻‘(card‘𝑌)))
31, 2eqeq12d 2754 . 2 (𝑎 = 𝑌 → ((𝑎𝐹𝑠) = (𝐻‘(card‘𝑎)) ↔ (𝑌𝐹𝑠) = (𝐻‘(card‘𝑌))))
4 oveq2 7263 . . 3 (𝑠 = 𝑅 → (𝑌𝐹𝑠) = (𝑌𝐹𝑅))
54eqeq1d 2740 . 2 (𝑠 = 𝑅 → ((𝑌𝐹𝑠) = (𝐻‘(card‘𝑌)) ↔ (𝑌𝐹𝑅) = (𝐻‘(card‘𝑌))))
6 nfcv 2906 . . 3 𝑥𝑎
7 nfcv 2906 . . 3 𝑟𝑎
8 nfcv 2906 . . 3 𝑟𝑠
9 pwfseqlem4.f . . . . . 6 𝐹 = (𝑥 ∈ V, 𝑟 ∈ V ↦ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷 {𝑧 ∈ ω ∣ ¬ (𝐷𝑧) ∈ 𝑥})))
10 nfmpo1 7333 . . . . . 6 𝑥(𝑥 ∈ V, 𝑟 ∈ V ↦ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷 {𝑧 ∈ ω ∣ ¬ (𝐷𝑧) ∈ 𝑥})))
119, 10nfcxfr 2904 . . . . 5 𝑥𝐹
12 nfcv 2906 . . . . 5 𝑥𝑟
136, 11, 12nfov 7285 . . . 4 𝑥(𝑎𝐹𝑟)
1413nfeq1 2921 . . 3 𝑥(𝑎𝐹𝑟) = (𝐻‘(card‘𝑎))
15 nfmpo2 7334 . . . . . 6 𝑟(𝑥 ∈ V, 𝑟 ∈ V ↦ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷 {𝑧 ∈ ω ∣ ¬ (𝐷𝑧) ∈ 𝑥})))
169, 15nfcxfr 2904 . . . . 5 𝑟𝐹
177, 16, 8nfov 7285 . . . 4 𝑟(𝑎𝐹𝑠)
1817nfeq1 2921 . . 3 𝑟(𝑎𝐹𝑠) = (𝐻‘(card‘𝑎))
19 oveq1 7262 . . . 4 (𝑥 = 𝑎 → (𝑥𝐹𝑟) = (𝑎𝐹𝑟))
20 2fveq3 6761 . . . 4 (𝑥 = 𝑎 → (𝐻‘(card‘𝑥)) = (𝐻‘(card‘𝑎)))
2119, 20eqeq12d 2754 . . 3 (𝑥 = 𝑎 → ((𝑥𝐹𝑟) = (𝐻‘(card‘𝑥)) ↔ (𝑎𝐹𝑟) = (𝐻‘(card‘𝑎))))
22 oveq2 7263 . . . 4 (𝑟 = 𝑠 → (𝑎𝐹𝑟) = (𝑎𝐹𝑠))
2322eqeq1d 2740 . . 3 (𝑟 = 𝑠 → ((𝑎𝐹𝑟) = (𝐻‘(card‘𝑎)) ↔ (𝑎𝐹𝑠) = (𝐻‘(card‘𝑎))))
24 vex 3426 . . . . . 6 𝑥 ∈ V
25 vex 3426 . . . . . 6 𝑟 ∈ V
26 fvex 6769 . . . . . . 7 (𝐻‘(card‘𝑥)) ∈ V
27 fvex 6769 . . . . . . 7 (𝐷 {𝑧 ∈ ω ∣ ¬ (𝐷𝑧) ∈ 𝑥}) ∈ V
2826, 27ifex 4506 . . . . . 6 if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷 {𝑧 ∈ ω ∣ ¬ (𝐷𝑧) ∈ 𝑥})) ∈ V
299ovmpt4g 7398 . . . . . 6 ((𝑥 ∈ V ∧ 𝑟 ∈ V ∧ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷 {𝑧 ∈ ω ∣ ¬ (𝐷𝑧) ∈ 𝑥})) ∈ V) → (𝑥𝐹𝑟) = if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷 {𝑧 ∈ ω ∣ ¬ (𝐷𝑧) ∈ 𝑥})))
3024, 25, 28, 29mp3an 1459 . . . . 5 (𝑥𝐹𝑟) = if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷 {𝑧 ∈ ω ∣ ¬ (𝐷𝑧) ∈ 𝑥}))
31 iftrue 4462 . . . . 5 (𝑥 ∈ Fin → if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷 {𝑧 ∈ ω ∣ ¬ (𝐷𝑧) ∈ 𝑥})) = (𝐻‘(card‘𝑥)))
3230, 31eqtrid 2790 . . . 4 (𝑥 ∈ Fin → (𝑥𝐹𝑟) = (𝐻‘(card‘𝑥)))
3332adantr 480 . . 3 ((𝑥 ∈ Fin ∧ 𝑟𝑉) → (𝑥𝐹𝑟) = (𝐻‘(card‘𝑥)))
346, 7, 8, 14, 18, 21, 23, 33vtocl2gaf 3505 . 2 ((𝑎 ∈ Fin ∧ 𝑠𝑉) → (𝑎𝐹𝑠) = (𝐻‘(card‘𝑎)))
353, 5, 34vtocl2ga 3504 1 ((𝑌 ∈ Fin ∧ 𝑅𝑉) → (𝑌𝐹𝑅) = (𝐻‘(card‘𝑌)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395  w3a 1085   = wceq 1539  wcel 2108  {crab 3067  Vcvv 3422  wss 3883  ifcif 4456  𝒫 cpw 4530   cint 4876   ciun 4921   class class class wbr 5070   We wwe 5534   × cxp 5578  ccnv 5579  ran crn 5581  1-1wf1 6415  1-1-ontowf1o 6417  cfv 6418  (class class class)co 7255  cmpo 7257  ωcom 7687  m cmap 8573  cdom 8689  Fincfn 8691  cardccrd 9624
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-iota 6376  df-fun 6420  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260
This theorem is referenced by:  pwfseqlem4a  10348  pwfseqlem4  10349
  Copyright terms: Public domain W3C validator