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

Theorem nfrecs 5945
Description: Bound-variable hypothesis builder for recs. (Contributed by Stefan O'Rear, 18-Jan-2015.)
Hypothesis
Ref Expression
nfrecs.f 𝑥𝐹
Assertion
Ref Expression
nfrecs 𝑥recs(𝐹)

Proof of Theorem nfrecs
Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-recs 5943 . 2 recs(𝐹) = {𝑎 ∣ ∃𝑏 ∈ On (𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐)))}
2 nfcv 2219 . . . . 5 𝑥On
3 nfv 1461 . . . . . 6 𝑥 𝑎 Fn 𝑏
4 nfcv 2219 . . . . . . 7 𝑥𝑏
5 nfrecs.f . . . . . . . . 9 𝑥𝐹
6 nfcv 2219 . . . . . . . . 9 𝑥(𝑎𝑐)
75, 6nffv 5205 . . . . . . . 8 𝑥(𝐹‘(𝑎𝑐))
87nfeq2 2230 . . . . . . 7 𝑥(𝑎𝑐) = (𝐹‘(𝑎𝑐))
94, 8nfralxy 2402 . . . . . 6 𝑥𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐))
103, 9nfan 1497 . . . . 5 𝑥(𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐)))
112, 10nfrexxy 2403 . . . 4 𝑥𝑏 ∈ On (𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐)))
1211nfab 2223 . . 3 𝑥{𝑎 ∣ ∃𝑏 ∈ On (𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐)))}
1312nfuni 3607 . 2 𝑥 {𝑎 ∣ ∃𝑏 ∈ On (𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐)))}
141, 13nfcxfr 2216 1 𝑥recs(𝐹)
Colors of variables: wff set class
Syntax hints:  wa 102   = wceq 1284  {cab 2067  wnfc 2206  wral 2348  wrex 2349   cuni 3601  Oncon0 4118  cres 4365   Fn wfn 4917  cfv 4922  recscrecs 5942
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-iota 4887  df-fv 4930  df-recs 5943
This theorem is referenced by:  nffrec  6005
  Copyright terms: Public domain W3C validator