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

Theorem rdgifnon 6358
Description: The recursive definition generator is a function on ordinal numbers. The 𝐹 Fn V condition states that the characteristic function is defined for all sets (being defined for all ordinals might be enough if being used in a manner similar to rdgon 6365; in cases like df-oadd 6399 either presumably could work). (Contributed by Jim Kingdon, 13-Jul-2019.)
Assertion
Ref Expression
rdgifnon ((𝐹 Fn V ∧ 𝐴𝑉) → rec(𝐹, 𝐴) Fn On)

Proof of Theorem rdgifnon
Dummy variables 𝑓 𝑔 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-irdg 6349 . 2 rec(𝐹, 𝐴) = recs((𝑔 ∈ V ↦ (𝐴 𝑥 ∈ dom 𝑔(𝐹‘(𝑔𝑥)))))
2 rdgruledefgg 6354 . . 3 ((𝐹 Fn V ∧ 𝐴𝑉) → (Fun (𝑔 ∈ V ↦ (𝐴 𝑥 ∈ dom 𝑔(𝐹‘(𝑔𝑥)))) ∧ ((𝑔 ∈ V ↦ (𝐴 𝑥 ∈ dom 𝑔(𝐹‘(𝑔𝑥))))‘𝑓) ∈ V))
32alrimiv 1867 . 2 ((𝐹 Fn V ∧ 𝐴𝑉) → ∀𝑓(Fun (𝑔 ∈ V ↦ (𝐴 𝑥 ∈ dom 𝑔(𝐹‘(𝑔𝑥)))) ∧ ((𝑔 ∈ V ↦ (𝐴 𝑥 ∈ dom 𝑔(𝐹‘(𝑔𝑥))))‘𝑓) ∈ V))
41, 3tfri1d 6314 1 ((𝐹 Fn V ∧ 𝐴𝑉) → rec(𝐹, 𝐴) Fn On)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wcel 2141  Vcvv 2730  cun 3119   ciun 3873  cmpt 4050  Oncon0 4348  dom cdm 4611  Fun wfun 5192   Fn wfn 5193  cfv 5198  reccrdg 6348
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-iord 4351  df-on 4353  df-suc 4356  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-recs 6284  df-irdg 6349
This theorem is referenced by:  rdgivallem  6360
  Copyright terms: Public domain W3C validator