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

Theorem tfrex 6577
Description: The transfinite recursion function is set-like if the input is. (Contributed by Mario Carneiro, 3-Jul-2019.)
Hypotheses
Ref Expression
tfrex.1 𝐹 = recs(𝐺)
tfrex.2 (𝜑 → ∀𝑥(Fun 𝐺 ∧ (𝐺𝑥) ∈ V))
Assertion
Ref Expression
tfrex ((𝜑𝐴𝑉) → (𝐹𝐴) ∈ V)
Distinct variable group:   𝑥,𝐺
Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥)   𝐹(𝑥)   𝑉(𝑥)

Proof of Theorem tfrex
Dummy variables 𝑓 𝑔 𝑢 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tfrex.1 . . 3 𝐹 = recs(𝐺)
21fveq1i 5649 . 2 (𝐹𝐴) = (recs(𝐺)‘𝐴)
3 eqid 2231 . . . 4 {𝑔 ∣ ∃𝑧 ∈ On (𝑔 Fn 𝑧 ∧ ∀𝑢𝑧 (𝑔𝑢) = (𝐺‘(𝑔𝑢)))} = {𝑔 ∣ ∃𝑧 ∈ On (𝑔 Fn 𝑧 ∧ ∀𝑢𝑧 (𝑔𝑢) = (𝐺‘(𝑔𝑢)))}
43tfrlem3 6520 . . 3 {𝑔 ∣ ∃𝑧 ∈ On (𝑔 Fn 𝑧 ∧ ∀𝑢𝑧 (𝑔𝑢) = (𝐺‘(𝑔𝑢)))} = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))}
5 tfrex.2 . . 3 (𝜑 → ∀𝑥(Fun 𝐺 ∧ (𝐺𝑥) ∈ V))
64, 5tfrexlem 6543 . 2 ((𝜑𝐴𝑉) → (recs(𝐺)‘𝐴) ∈ V)
72, 6eqeltrid 2318 1 ((𝜑𝐴𝑉) → (𝐹𝐴) ∈ V)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wal 1396   = wceq 1398  wcel 2202  {cab 2217  wral 2511  wrex 2512  Vcvv 2803  Oncon0 4466  cres 4733  Fun wfun 5327   Fn wfn 5328  cfv 5333  recscrecs 6513
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-recs 6514
This theorem is referenced by:  rdgexggg  6586
  Copyright terms: Public domain W3C validator