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

Theorem tfrlem6 8213
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 5728 . . 3 (Rel 𝐴 ↔ ∀𝑔𝐴 Rel 𝑔)
2 tfrlem.1 . . . . 5 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
32tfrlem4 8210 . . . 4 (𝑔𝐴 → Fun 𝑔)
4 funrel 6451 . . . 4 (Fun 𝑔 → Rel 𝑔)
53, 4syl 17 . . 3 (𝑔𝐴 → Rel 𝑔)
61, 5mprgbir 3079 . 2 Rel 𝐴
72recsfval 8212 . . 3 recs(𝐹) = 𝐴
87releqi 5688 . 2 (Rel recs(𝐹) ↔ Rel 𝐴)
96, 8mpbir 230 1 Rel recs(𝐹)
Colors of variables: wff setvar class
Syntax hints:  wa 396   = wceq 1539  wcel 2106  {cab 2715  wral 3064  wrex 3065   cuni 4839  cres 5591  Rel wrel 5594  Oncon0 6266  Fun wfun 6427   Fn wfn 6428  cfv 6433  recscrecs 8201
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-fo 6439  df-fv 6441  df-ov 7278  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202
This theorem is referenced by:  tfrlem7  8214  tfrlem11  8219  tfrlem15  8223  tfrlem16  8224
  Copyright terms: Public domain W3C validator