Users' Mathboxes Mathbox for Matthew House < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ttctr Structured version   Visualization version   GIF version

Theorem ttctr 36681
Description: The transitive closure of a class is transitive. (Contributed by Matthew House, 6-Apr-2026.)
Assertion
Ref Expression
ttctr Tr TC+ 𝐴

Proof of Theorem ttctr
Dummy variables 𝑣 𝑢 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rdgfun 8346 . . . . . . . . 9 Fun rec((𝑦 ∈ V ↦ 𝑦), {𝑥})
2 eluniima 7196 . . . . . . . . 9 (Fun rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) → (𝑣 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ↔ ∃𝑧 ∈ ω 𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧)))
31, 2ax-mp 5 . . . . . . . 8 (𝑣 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ↔ ∃𝑧 ∈ ω 𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))
4 peano2 7832 . . . . . . . . . . . 12 (𝑧 ∈ ω → suc 𝑧 ∈ ω)
5 elunii 4856 . . . . . . . . . . . . 13 ((𝑢𝑣𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧)) → 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))
6 nnon 7814 . . . . . . . . . . . . . . . 16 (𝑧 ∈ ω → 𝑧 ∈ On)
7 fvex 6845 . . . . . . . . . . . . . . . . 17 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ∈ V
87uniex 7686 . . . . . . . . . . . . . . . 16 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ∈ V
9 eqid 2737 . . . . . . . . . . . . . . . . 17 rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) = rec((𝑦 ∈ V ↦ 𝑦), {𝑥})
10 unieq 4862 . . . . . . . . . . . . . . . . 17 (𝑤 = 𝑦 𝑤 = 𝑦)
11 unieq 4862 . . . . . . . . . . . . . . . . 17 (𝑤 = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) → 𝑤 = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))
129, 10, 11rdgsucmpt2 8360 . . . . . . . . . . . . . . . 16 ((𝑧 ∈ On ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ∈ V) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))
136, 8, 12sylancl 587 . . . . . . . . . . . . . . 15 (𝑧 ∈ ω → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))
1413eleq2d 2823 . . . . . . . . . . . . . 14 (𝑧 ∈ ω → (𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧) ↔ 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧)))
1514biimpar 477 . . . . . . . . . . . . 13 ((𝑧 ∈ ω ∧ 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧)) → 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧))
165, 15sylan2 594 . . . . . . . . . . . 12 ((𝑧 ∈ ω ∧ (𝑢𝑣𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))) → 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧))
17 fveq2 6832 . . . . . . . . . . . . . 14 (𝑤 = suc 𝑧 → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧))
1817eleq2d 2823 . . . . . . . . . . . . 13 (𝑤 = suc 𝑧 → (𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ↔ 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧)))
1918rspcev 3565 . . . . . . . . . . . 12 ((suc 𝑧 ∈ ω ∧ 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧)) → ∃𝑤 ∈ ω 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
204, 16, 19syl2an2r 686 . . . . . . . . . . 11 ((𝑧 ∈ ω ∧ (𝑢𝑣𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))) → ∃𝑤 ∈ ω 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
21 eluniima 7196 . . . . . . . . . . . 12 (Fun rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) → (𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ↔ ∃𝑤 ∈ ω 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤)))
221, 21ax-mp 5 . . . . . . . . . . 11 (𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ↔ ∃𝑤 ∈ ω 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
2320, 22sylibr 234 . . . . . . . . . 10 ((𝑧 ∈ ω ∧ (𝑢𝑣𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))) → 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω))
2423an12s 650 . . . . . . . . 9 ((𝑢𝑣 ∧ (𝑧 ∈ ω ∧ 𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))) → 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω))
2524rexlimdvaa 3140 . . . . . . . 8 (𝑢𝑣 → (∃𝑧 ∈ ω 𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) → 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)))
263, 25biimtrid 242 . . . . . . 7 (𝑢𝑣 → (𝑣 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) → 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)))
2726reximdv 3153 . . . . . 6 (𝑢𝑣 → (∃𝑥𝐴 𝑣 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) → ∃𝑥𝐴 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)))
28 eliun 4938 . . . . . 6 (𝑣 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ↔ ∃𝑥𝐴 𝑣 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω))
29 eliun 4938 . . . . . 6 (𝑢 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ↔ ∃𝑥𝐴 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω))
3027, 28, 293imtr4g 296 . . . . 5 (𝑢𝑣 → (𝑣 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) → 𝑢 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)))
31 df-ttc 36675 . . . . . 6 TC+ 𝐴 = 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)
3231eleq2i 2829 . . . . 5 (𝑣 ∈ TC+ 𝐴𝑣 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω))
3331eleq2i 2829 . . . . 5 (𝑢 ∈ TC+ 𝐴𝑢 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω))
3430, 32, 333imtr4g 296 . . . 4 (𝑢𝑣 → (𝑣 ∈ TC+ 𝐴𝑢 ∈ TC+ 𝐴))
3534imp 406 . . 3 ((𝑢𝑣𝑣 ∈ TC+ 𝐴) → 𝑢 ∈ TC+ 𝐴)
3635gen2 1798 . 2 𝑢𝑣((𝑢𝑣𝑣 ∈ TC+ 𝐴) → 𝑢 ∈ TC+ 𝐴)
37 dftr2 5195 . 2 (Tr TC+ 𝐴 ↔ ∀𝑢𝑣((𝑢𝑣𝑣 ∈ TC+ 𝐴) → 𝑢 ∈ TC+ 𝐴))
3836, 37mpbir 231 1 Tr TC+ 𝐴
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wal 1540   = wceq 1542  wcel 2114  wrex 3062  Vcvv 3430  {csn 4568   cuni 4851   ciun 4934  cmpt 5167  Tr wtr 5193  cima 5625  Oncon0 6315  suc csuc 6317  Fun wfun 6484  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:  ttctr2  36682  ttctr3  36683  ttcss  36686  ttcel  36688  ttcidm  36691  ttciunun  36699  ttcpwss  36703  dfttc3gw  36711  ttc0elw  36715  ttc0el  36723
  Copyright terms: Public domain W3C validator