Users' Mathboxes Mathbox for Matthew House < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  nfttc Structured version   Visualization version   GIF version

Theorem nfttc 36799
Description: Bound-variable hypothesis builder for transitive closure. (Contributed by Matthew House, 6-Apr-2026.)
Hypothesis
Ref Expression
nfttc.1 𝑥𝐴
Assertion
Ref Expression
nfttc 𝑥TC+ 𝐴

Proof of Theorem nfttc
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ttc 36795 . 2 TC+ 𝐴 = 𝑦𝐴 (rec((𝑧 ∈ V ↦ 𝑧), {𝑦}) “ ω)
2 nfttc.1 . . 3 𝑥𝐴
3 nfcv 2918 . . 3 𝑥 (rec((𝑧 ∈ V ↦ 𝑧), {𝑦}) “ ω)
42, 3nfiun 4975 . 2 𝑥 𝑦𝐴 (rec((𝑧 ∈ V ↦ 𝑧), {𝑦}) “ ω)
51, 4nfcxfr 2916 1 𝑥TC+ 𝐴
Colors of variables: wff setvar class
Syntax hints:  wnfc 2903  Vcvv 3448  {csn 4576   cuni 4859   ciun 4943  cmpt 5175  cima 5643  ωcom 7835  reccrdg 8368  TC+ cttc 36794
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-10 2169  ax-11 2185  ax-12 2206  ax-ext 2728
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-tru 1557  df-ex 1794  df-nf 1798  df-sb 2085  df-clab 2735  df-cleq 2748  df-clel 2831  df-nfc 2905  df-ral 3071  df-rex 3081  df-iun 4945  df-ttc 36795
This theorem is referenced by:  csbttc  36817
  Copyright terms: Public domain W3C validator