MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfttrcld Structured version   Visualization version   GIF version

Theorem nfttrcld 9779
Description: Bound variable hypothesis builder for transitive closure. Deduction form. (Contributed by Scott Fenton, 26-Oct-2024.)
Hypothesis
Ref Expression
nfttrcld.1 (𝜑𝑥𝑅)
Assertion
Ref Expression
nfttrcld (𝜑𝑥t++𝑅)

Proof of Theorem nfttrcld
Dummy variables 𝑦 𝑧 𝑛 𝑓 𝑎 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ttrcl 9777 . 2 t++𝑅 = {⟨𝑦, 𝑧⟩ ∣ ∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓𝑛) = 𝑧) ∧ ∀𝑎𝑛 (𝑓𝑎)𝑅(𝑓‘suc 𝑎))}
2 nfv 1913 . . 3 𝑦𝜑
3 nfv 1913 . . 3 𝑧𝜑
4 nfv 1913 . . . 4 𝑛𝜑
5 nfcvd 2909 . . . 4 (𝜑𝑥(ω ∖ 1o))
6 nfv 1913 . . . . 5 𝑓𝜑
7 nfvd 1914 . . . . . 6 (𝜑 → Ⅎ𝑥 𝑓 Fn suc 𝑛)
8 nfvd 1914 . . . . . 6 (𝜑 → Ⅎ𝑥((𝑓‘∅) = 𝑦 ∧ (𝑓𝑛) = 𝑧))
9 nfv 1913 . . . . . . 7 𝑎𝜑
10 nfcvd 2909 . . . . . . 7 (𝜑𝑥𝑛)
11 nfcvd 2909 . . . . . . . 8 (𝜑𝑥(𝑓𝑎))
12 nfttrcld.1 . . . . . . . 8 (𝜑𝑥𝑅)
13 nfcvd 2909 . . . . . . . 8 (𝜑𝑥(𝑓‘suc 𝑎))
1411, 12, 13nfbrd 5212 . . . . . . 7 (𝜑 → Ⅎ𝑥(𝑓𝑎)𝑅(𝑓‘suc 𝑎))
159, 10, 14nfraldw 3315 . . . . . 6 (𝜑 → Ⅎ𝑥𝑎𝑛 (𝑓𝑎)𝑅(𝑓‘suc 𝑎))
167, 8, 15nf3and 1897 . . . . 5 (𝜑 → Ⅎ𝑥(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓𝑛) = 𝑧) ∧ ∀𝑎𝑛 (𝑓𝑎)𝑅(𝑓‘suc 𝑎)))
176, 16nfexd 2333 . . . 4 (𝜑 → Ⅎ𝑥𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓𝑛) = 𝑧) ∧ ∀𝑎𝑛 (𝑓𝑎)𝑅(𝑓‘suc 𝑎)))
184, 5, 17nfrexdw 3316 . . 3 (𝜑 → Ⅎ𝑥𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓𝑛) = 𝑧) ∧ ∀𝑎𝑛 (𝑓𝑎)𝑅(𝑓‘suc 𝑎)))
192, 3, 18nfopabd 5234 . 2 (𝜑𝑥{⟨𝑦, 𝑧⟩ ∣ ∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓𝑛) = 𝑧) ∧ ∀𝑎𝑛 (𝑓𝑎)𝑅(𝑓‘suc 𝑎))})
201, 19nfcxfrd 2907 1 (𝜑𝑥t++𝑅)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1537  wex 1777  wnfc 2893  wral 3067  wrex 3076  cdif 3973  c0 4352   class class class wbr 5166  {copab 5228  suc csuc 6397   Fn wfn 6568  cfv 6573  ωcom 7903  1oc1o 8515  t++cttrcl 9776
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-br 5167  df-opab 5229  df-ttrcl 9777
This theorem is referenced by:  nfttrcl  9780
  Copyright terms: Public domain W3C validator