ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  tfrfun GIF version

Theorem tfrfun 5983
Description: Transfinite recursion produces a function. (Contributed by Jim Kingdon, 20-Aug-2021.)
Assertion
Ref Expression
tfrfun Fun recs(𝐹)

Proof of Theorem tfrfun
Dummy variables 𝑓 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2054 . 2 {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))} = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
21tfrlem7 5961 1 Fun recs(𝐹)
Colors of variables: wff set class
Syntax hints:  wa 101   = wceq 1257  {cab 2040  wral 2321  wrex 2322  Oncon0 4125  cres 4372  Fun wfun 4921   Fn wfn 4922  cfv 4927  recscrecs 5947
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 638  ax-5 1350  ax-7 1351  ax-gen 1352  ax-ie1 1396  ax-ie2 1397  ax-8 1409  ax-10 1410  ax-11 1411  ax-i12 1412  ax-bndl 1413  ax-4 1414  ax-14 1419  ax-17 1433  ax-i9 1437  ax-ial 1441  ax-i5r 1442  ax-ext 2036  ax-sep 3900  ax-pow 3952  ax-pr 3969  ax-setind 4287
This theorem depends on definitions:  df-bi 114  df-3an 896  df-tru 1260  df-nf 1364  df-sb 1660  df-eu 1917  df-mo 1918  df-clab 2041  df-cleq 2047  df-clel 2050  df-nfc 2181  df-ral 2326  df-rex 2327  df-rab 2330  df-v 2574  df-sbc 2785  df-csb 2878  df-un 2947  df-in 2949  df-ss 2956  df-pw 3386  df-sn 3406  df-pr 3407  df-op 3409  df-uni 3606  df-iun 3684  df-br 3790  df-opab 3844  df-mpt 3845  df-tr 3880  df-id 4055  df-iord 4128  df-on 4130  df-xp 4376  df-rel 4377  df-cnv 4378  df-co 4379  df-dm 4380  df-res 4382  df-iota 4892  df-fun 4929  df-fn 4930  df-fv 4935  df-recs 5948
This theorem is referenced by:  frecex  6009
  Copyright terms: Public domain W3C validator