Theorem nfttrcld 9631

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 9629	. 2 ⊢ t++𝑅 = {⟨𝑦, 𝑧⟩ ∣ ∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘𝑛) = 𝑧) ∧ ∀𝑎 ∈ 𝑛 (𝑓‘𝑎)𝑅(𝑓‘suc 𝑎))}
2		nfv 1916	. . 3 ⊢ Ⅎ𝑦𝜑
3		nfv 1916	. . 3 ⊢ Ⅎ𝑧𝜑
4		nfv 1916	. . . 4 ⊢ Ⅎ𝑛𝜑
5		nfcvd 2900	. . . 4 ⊢ (𝜑 → Ⅎ𝑥(ω ∖ 1o))
6		nfv 1916	. . . . 5 ⊢ Ⅎ𝑓𝜑
7		nfvd 1917	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑥 𝑓 Fn suc 𝑛)
8		nfvd 1917	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑥((𝑓‘∅) = 𝑦 ∧ (𝑓‘𝑛) = 𝑧))
9		nfv 1916	. . . . . . 7 ⊢ Ⅎ𝑎𝜑
10		nfcvd 2900	. . . . . . 7 ⊢ (𝜑 → Ⅎ𝑥𝑛)
11		nfcvd 2900	. . . . . . . 8 ⊢ (𝜑 → Ⅎ𝑥(𝑓‘𝑎))
12		nfttrcld.1	. . . . . . . 8 ⊢ (𝜑 → Ⅎ𝑥𝑅)
13		nfcvd 2900	. . . . . . . 8 ⊢ (𝜑 → Ⅎ𝑥(𝑓‘suc 𝑎))
14	11, 12, 13	nfbrd 5146	. . . . . . 7 ⊢ (𝜑 → Ⅎ𝑥(𝑓‘𝑎)𝑅(𝑓‘suc 𝑎))
15	9, 10, 14	nfraldw 3283	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑥∀𝑎 ∈ 𝑛 (𝑓‘𝑎)𝑅(𝑓‘suc 𝑎))
16	7, 8, 15	nf3and 1900	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘𝑛) = 𝑧) ∧ ∀𝑎 ∈ 𝑛 (𝑓‘𝑎)𝑅(𝑓‘suc 𝑎)))
17	6, 16	nfexd 2335	. . . 4 ⊢ (𝜑 → Ⅎ𝑥∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘𝑛) = 𝑧) ∧ ∀𝑎 ∈ 𝑛 (𝑓‘𝑎)𝑅(𝑓‘suc 𝑎)))
18	4, 5, 17	nfrexdw 3284	. . 3 ⊢ (𝜑 → Ⅎ𝑥∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘𝑛) = 𝑧) ∧ ∀𝑎 ∈ 𝑛 (𝑓‘𝑎)𝑅(𝑓‘suc 𝑎)))
19	2, 3, 18	nfopabd 5168	. 2 ⊢ (𝜑 → Ⅎ𝑥{⟨𝑦, 𝑧⟩ ∣ ∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘𝑛) = 𝑧) ∧ ∀𝑎 ∈ 𝑛 (𝑓‘𝑎)𝑅(𝑓‘suc 𝑎))})
20	1, 19	nfcxfrd 2898	1 ⊢ (𝜑 → Ⅎ𝑥t++𝑅)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542  ∃wex 1781  Ⅎwnfc 2884  ∀wral 3052  ∃wrex 3062   ∖ cdif 3900  ∅c0 4287   class class class wbr 5100  {copab 5162  suc csuc 6327   Fn wfn 6495  ‘cfv 6500  ωcom 7818  1_oc1o 8400  t++cttrcl 9628

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-ttrcl 9629

This theorem is referenced by:  nfttrcl  9632