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

Theorem nfrecs 6473
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 6471 . 2 recs(𝐹) = {𝑎 ∣ ∃𝑏 ∈ On (𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐)))}
2 nfcv 2374 . . . . 5 𝑥On
3 nfv 1576 . . . . . 6 𝑥 𝑎 Fn 𝑏
4 nfcv 2374 . . . . . . 7 𝑥𝑏
5 nfrecs.f . . . . . . . . 9 𝑥𝐹
6 nfcv 2374 . . . . . . . . 9 𝑥(𝑎𝑐)
75, 6nffv 5649 . . . . . . . 8 𝑥(𝐹‘(𝑎𝑐))
87nfeq2 2386 . . . . . . 7 𝑥(𝑎𝑐) = (𝐹‘(𝑎𝑐))
94, 8nfralxy 2570 . . . . . 6 𝑥𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐))
103, 9nfan 1613 . . . . 5 𝑥(𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐)))
112, 10nfrexw 2571 . . . 4 𝑥𝑏 ∈ On (𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐)))
1211nfab 2379 . . 3 𝑥{𝑎 ∣ ∃𝑏 ∈ On (𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐)))}
1312nfuni 3899 . 2 𝑥 {𝑎 ∣ ∃𝑏 ∈ On (𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐)))}
141, 13nfcxfr 2371 1 𝑥recs(𝐹)
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1397  {cab 2217  wnfc 2361  wral 2510  wrex 2511   cuni 3893  Oncon0 4460  cres 4727   Fn wfn 5321  cfv 5326  recscrecs 6470
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-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-iota 5286  df-fv 5334  df-recs 6471
This theorem is referenced by:  nffrec  6562
  Copyright terms: Public domain W3C validator