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

Theorem nfrecs 6478
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 6476 . 2 recs(𝐹) = {𝑎 ∣ ∃𝑏 ∈ On (𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐)))}
2 nfcv 2373 . . . . 5 𝑥On
3 nfv 1576 . . . . . 6 𝑥 𝑎 Fn 𝑏
4 nfcv 2373 . . . . . . 7 𝑥𝑏
5 nfrecs.f . . . . . . . . 9 𝑥𝐹
6 nfcv 2373 . . . . . . . . 9 𝑥(𝑎𝑐)
75, 6nffv 5652 . . . . . . . 8 𝑥(𝐹‘(𝑎𝑐))
87nfeq2 2385 . . . . . . 7 𝑥(𝑎𝑐) = (𝐹‘(𝑎𝑐))
94, 8nfralxy 2569 . . . . . 6 𝑥𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐))
103, 9nfan 1613 . . . . 5 𝑥(𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐)))
112, 10nfrexw 2570 . . . 4 𝑥𝑏 ∈ On (𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐)))
1211nfab 2378 . . 3 𝑥{𝑎 ∣ ∃𝑏 ∈ On (𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐)))}
1312nfuni 3900 . 2 𝑥 {𝑎 ∣ ∃𝑏 ∈ On (𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐹‘(𝑎𝑐)))}
141, 13nfcxfr 2370 1 𝑥recs(𝐹)
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1397  {cab 2216  wnfc 2360  wral 2509  wrex 2510   cuni 3894  Oncon0 4462  cres 4729   Fn wfn 5323  cfv 5328  recscrecs 6475
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 2212
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1810  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ral 2514  df-rex 2515  df-v 2803  df-un 3203  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-br 4090  df-iota 5288  df-fv 5336  df-recs 6476
This theorem is referenced by:  nffrec  6567
  Copyright terms: Public domain W3C validator