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

Theorem tfrlem6 8311
Description: Lemma for transfinite recursion. The union of all acceptable functions is a relation. (Contributed by NM, 8-Aug-1994.) (Revised by Mario Carneiro, 9-May-2015.)
Hypothesis
Ref Expression
tfrlem.1 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
Assertion
Ref Expression
tfrlem6 Rel recs(𝐹)
Distinct variable group:   𝑥,𝑓,𝑦,𝐹
Allowed substitution hints:   𝐴(𝑥,𝑦,𝑓)

Proof of Theorem tfrlem6
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 reluni 5765 . . 3 (Rel 𝐴 ↔ ∀𝑔𝐴 Rel 𝑔)
2 tfrlem.1 . . . . 5 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
32tfrlem4 8308 . . . 4 (𝑔𝐴 → Fun 𝑔)
4 funrel 6507 . . . 4 (Fun 𝑔 → Rel 𝑔)
53, 4syl 17 . . 3 (𝑔𝐴 → Rel 𝑔)
61, 5mprgbir 3056 . 2 Rel 𝐴
72recsfval 8310 . . 3 recs(𝐹) = 𝐴
87releqi 5725 . 2 (Rel recs(𝐹) ↔ Rel 𝐴)
96, 8mpbir 231 1 Rel recs(𝐹)
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1541  wcel 2113  {cab 2712  wral 3049  wrex 3058   cuni 4861  cres 5624  Rel wrel 5627  Oncon0 6315  Fun wfun 6484   Fn wfn 6485  cfv 6490  recscrecs 8300
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-fo 6496  df-fv 6498  df-ov 7359  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301
This theorem is referenced by:  tfrlem7  8312  tfrlem11  8317  tfrlem15  8321  tfrlem16  8322
  Copyright terms: Public domain W3C validator