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 36789
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 36785 . 2 TC+ 𝐴 = 𝑦𝐴 (rec((𝑧 ∈ V ↦ 𝑧), {𝑦}) “ ω)
2 nfttc.1 . . 3 𝑥𝐴
3 nfcv 2914 . . 3 𝑥 (rec((𝑧 ∈ V ↦ 𝑧), {𝑦}) “ ω)
42, 3nfiun 4971 . 2 𝑥 𝑦𝐴 (rec((𝑧 ∈ V ↦ 𝑧), {𝑦}) “ ω)
51, 4nfcxfr 2912 1 𝑥TC+ 𝐴
Colors of variables: wff setvar class
Syntax hints:  wnfc 2899  Vcvv 3444  {csn 4572   cuni 4855   ciun 4939  cmpt 5171  cima 5639  ωcom 7831  reccrdg 8364  TC+ cttc 36784
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-tru 1553  df-ex 1790  df-nf 1794  df-sb 2081  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ral 3067  df-rex 3077  df-iun 4941  df-ttc 36785
This theorem is referenced by:  csbttc  36807
  Copyright terms: Public domain W3C validator