Theorem nfttrcld 9735

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.

Step	Hyp	Ref	Expression
1		df-ttrcl 9733	. 2 ⊢ t++𝑅 = {⟨𝑦, 𝑧⟩ ∣ ∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘𝑛) = 𝑧) ∧ ∀𝑎 ∈ 𝑛 (𝑓‘𝑎)𝑅(𝑓‘suc 𝑎))}
2		nfv 1949	. . 3 ⊢ Ⅎ𝑦𝜑
3		nfv 1949	. . 3 ⊢ Ⅎ𝑧𝜑
4		nfv 1949	. . . 4 ⊢ Ⅎ𝑛𝜑
5		nfcvd 2927	. . . 4 ⊢ (𝜑 → Ⅎ𝑥(ω ∖ 1o))
6		nfv 1949	. . . . 5 ⊢ Ⅎ𝑓𝜑
7		nfvd 1950	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑥 𝑓 Fn suc 𝑛)
8		nfvd 1950	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑥((𝑓‘∅) = 𝑦 ∧ (𝑓‘𝑛) = 𝑧))
9		nfv 1949	. . . . . . 7 ⊢ Ⅎ𝑎𝜑
10		nfcvd 2927	. . . . . . 7 ⊢ (𝜑 → Ⅎ𝑥𝑛)
11		nfcvd 2927	. . . . . . . 8 ⊢ (𝜑 → Ⅎ𝑥(𝑓‘𝑎))
12		nfttrcld.1	. . . . . . . 8 ⊢ (𝜑 → Ⅎ𝑥𝑅)
13		nfcvd 2927	. . . . . . . 8 ⊢ (𝜑 → Ⅎ𝑥(𝑓‘suc 𝑎))
14	11, 12, 13	nfbrd 5154	. . . . . . 7 ⊢ (𝜑 → Ⅎ𝑥(𝑓‘𝑎)𝑅(𝑓‘suc 𝑎))
15	9, 10, 14	nfraldw 3311	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑥∀𝑎 ∈ 𝑛 (𝑓‘𝑎)𝑅(𝑓‘suc 𝑎))
16	7, 8, 15	nf3and 1933	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘𝑛) = 𝑧) ∧ ∀𝑎 ∈ 𝑛 (𝑓‘𝑎)𝑅(𝑓‘suc 𝑎)))
17	6, 16	nfexd 2363	. . . 4 ⊢ (𝜑 → Ⅎ𝑥∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘𝑛) = 𝑧) ∧ ∀𝑎 ∈ 𝑛 (𝑓‘𝑎)𝑅(𝑓‘suc 𝑎)))
18	4, 5, 17	nfrexdw 3312	. . 3 ⊢ (𝜑 → Ⅎ𝑥∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘𝑛) = 𝑧) ∧ ∀𝑎 ∈ 𝑛 (𝑓‘𝑎)𝑅(𝑓‘suc 𝑎)))
19	2, 3, 18	nfopabd 5176	. 2 ⊢ (𝜑 → Ⅎ𝑥{⟨𝑦, 𝑧⟩ ∣ ∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘𝑛) = 𝑧) ∧ ∀𝑎 ∈ 𝑛 (𝑓‘𝑎)𝑅(𝑓‘suc 𝑎))})
20	1, 19	nfcxfrd 2925	1 ⊢ (𝜑 → Ⅎ𝑥t++𝑅)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812  Ⅎwnfc 2911  ∀wral 3080  ∃wrex 3090   ∖ cdif 4048  ∅c0 4281   class class class wbr 5106  {copab 5170  suc csuc 6379   Fn wfn 6550  ‘cfv 6555  ωcom 7898  1_oc1o 8494  t++cttrcl 9732

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-ttrcl 9733

This theorem is used by:  nfttrcl  9736