Theorem ttcid 36680

Description: The transitive closure contains its argument as a subclass. (Contributed by Matthew House, 6-Apr-2026.)

Assertion

Ref	Expression
ttcid	⊢ 𝐴 ⊆ TC+ 𝐴

Proof of Theorem ttcid

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vsnid 4608	. . . . 5 ⊢ 𝑧 ∈ {𝑧}
2		vsnex 5370	. . . . . . 7 ⊢ {𝑧} ∈ V
3	2	rdg0 8351	. . . . . 6 ⊢ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧})‘∅) = {𝑧}
4		rdgfnon 8348	. . . . . . 7 ⊢ rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧}) Fn On
5		omsson 7812	. . . . . . 7 ⊢ ω ⊆ On
6		peano1 7831	. . . . . . 7 ⊢ ∅ ∈ ω
7		fnfvima 7179	. . . . . . 7 ⊢ ((rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧}) Fn On ∧ ω ⊆ On ∧ ∅ ∈ ω) → (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧})‘∅) ∈ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧}) “ ω))
8	4, 5, 6, 7	mp3an 1464	. . . . . 6 ⊢ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧})‘∅) ∈ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧}) “ ω)
9	3, 8	eqeltrri 2834	. . . . 5 ⊢ {𝑧} ∈ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧}) “ ω)
10		elunii 4856	. . . . 5 ⊢ ((𝑧 ∈ {𝑧} ∧ {𝑧} ∈ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧}) “ ω)) → 𝑧 ∈ ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧}) “ ω))
11	1, 9, 10	mp2an 693	. . . 4 ⊢ 𝑧 ∈ ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧}) “ ω)
12		sneq 4578	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → {𝑥} = {𝑧})
13		rdgeq2 8342	. . . . . . . 8 ⊢ ({𝑥} = {𝑧} → rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑥}) = rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧}))
14	12, 13	syl 17	. . . . . . 7 ⊢ (𝑥 = 𝑧 → rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑥}) = rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧}))
15	14	imaeq1d 6016	. . . . . 6 ⊢ (𝑥 = 𝑧 → (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑥}) “ ω) = (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧}) “ ω))
16	15	unieqd 4864	. . . . 5 ⊢ (𝑥 = 𝑧 → ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑥}) “ ω) = ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧}) “ ω))
17	16	eliuni 4940	. . . 4 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑧 ∈ ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑧}) “ ω)) → 𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑥}) “ ω))
18	11, 17	mpan2 692	. . 3 ⊢ (𝑧 ∈ 𝐴 → 𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑥}) “ ω))
19		df-ttc 36675	. . 3 ⊢ TC+ 𝐴 = ∪ 𝑥 ∈ 𝐴 ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑥}) “ ω)
20	18, 19	eleqtrrdi 2848	. 2 ⊢ (𝑧 ∈ 𝐴 → 𝑧 ∈ TC+ 𝐴)
21	20	ssriv 3926	1 ⊢ 𝐴 ⊆ TC+ 𝐴

Syntax hints:   = wceq 1542   ∈ wcel 2114  Vcvv 3430   ⊆ wss 3890  ∅c0 4274  {csn 4568  ∪ cuni 4851  ∪ ciun 4934   ↦ cmpt 5167   “ cima 5625  Oncon0 6315   Fn wfn 6485  ‘cfv 6490  ωcom 7808  reccrdg 8339  TC+ cttc 36674

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  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pr 5368  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-ov 7361  df-om 7809  df-2nd 7934  df-frecs 8222  df-wrecs 8253  df-recs 8302  df-rdg 8340  df-ttc 36675

This theorem is referenced by:  ttcexrg  36685  ttcss2  36687  ttcel2  36689  ttctrid  36690  dfttc2g  36694  ttc00  36696  ttcuniun  36698  ttciunun  36699  ttcuni  36701  ttcpwss  36703  ttcsnidg  36705  dfttc3gw  36711  ttcwf  36712  dfttc4  36718