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

Theorem nfttrcld 9626
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 9624 . 2 t++𝑅 = {⟨𝑦, 𝑧⟩ ∣ ∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓𝑛) = 𝑧) ∧ ∀𝑎𝑛 (𝑓𝑎)𝑅(𝑓‘suc 𝑎))}
2 nfv 1922 . . 3 𝑦𝜑
3 nfv 1922 . . 3 𝑧𝜑
4 nfv 1922 . . . 4 𝑛𝜑
5 nfcvd 2904 . . . 4 (𝜑𝑥(ω ∖ 1o))
6 nfv 1922 . . . . 5 𝑓𝜑
7 nfvd 1923 . . . . . 6 (𝜑 → Ⅎ𝑥 𝑓 Fn suc 𝑛)
8 nfvd 1923 . . . . . 6 (𝜑 → Ⅎ𝑥((𝑓‘∅) = 𝑦 ∧ (𝑓𝑛) = 𝑧))
9 nfv 1922 . . . . . . 7 𝑎𝜑
10 nfcvd 2904 . . . . . . 7 (𝜑𝑥𝑛)
11 nfcvd 2904 . . . . . . . 8 (𝜑𝑥(𝑓𝑎))
12 nfttrcld.1 . . . . . . . 8 (𝜑𝑥𝑅)
13 nfcvd 2904 . . . . . . . 8 (𝜑𝑥(𝑓‘suc 𝑎))
1411, 12, 13nfbrd 5121 . . . . . . 7 (𝜑 → Ⅎ𝑥(𝑓𝑎)𝑅(𝑓‘suc 𝑎))
159, 10, 14nfraldw 3286 . . . . . 6 (𝜑 → Ⅎ𝑥𝑎𝑛 (𝑓𝑎)𝑅(𝑓‘suc 𝑎))
167, 8, 15nf3and 1906 . . . . 5 (𝜑 → Ⅎ𝑥(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓𝑛) = 𝑧) ∧ ∀𝑎𝑛 (𝑓𝑎)𝑅(𝑓‘suc 𝑎)))
176, 16nfexd 2340 . . . 4 (𝜑 → Ⅎ𝑥𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓𝑛) = 𝑧) ∧ ∀𝑎𝑛 (𝑓𝑎)𝑅(𝑓‘suc 𝑎)))
184, 5, 17nfrexdw 3287 . . 3 (𝜑 → Ⅎ𝑥𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓𝑛) = 𝑧) ∧ ∀𝑎𝑛 (𝑓𝑎)𝑅(𝑓‘suc 𝑎)))
192, 3, 18nfopabd 5143 . 2 (𝜑𝑥{⟨𝑦, 𝑧⟩ ∣ ∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓𝑛) = 𝑧) ∧ ∀𝑎𝑛 (𝑓𝑎)𝑅(𝑓‘suc 𝑎))})
201, 19nfcxfrd 2902 1 (𝜑𝑥t++𝑅)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397  w3a 1093   = wceq 1548  wex 1787  wnfc 2888  wral 3055  wrex 3065  cdif 3882  c0 4264   class class class wbr 5075  {copab 5137  suc csuc 6316   Fn wfn 6484  cfv 6489  ωcom 7810  1oc1o 8392  t++cttrcl 9623
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-ss 3902  df-nul 4265  df-if 4458  df-sn 4559  df-pr 4561  df-op 4565  df-br 5076  df-opab 5138  df-ttrcl 9624
This theorem is referenced by:  nfttrcl  9627
  Copyright terms: Public domain W3C validator