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 37099
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 8408 . . . . . . . . 9 Fun rec((𝑦 ∈ V ↦ 𝑦), {𝑥})
2 eluniima 7250 . . . . . . . . 9 (Fun rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) → (𝑣 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ↔ ∃𝑧 ∈ ω 𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧)))
31, 2ax-mp 5 . . . . . . . 8 (𝑣 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ↔ ∃𝑧 ∈ ω 𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))
4 peano2 7889 . . . . . . . . . . . 12 (𝑧 ∈ ω → suc 𝑧 ∈ ω)
5 elunii 4875 . . . . . . . . . . . . 13 ((𝑢𝑣𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧)) → 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))
6 nnon 7871 . . . . . . . . . . . . . . . 16 (𝑧 ∈ ω → 𝑧 ∈ On)
7 fvex 6895 . . . . . . . . . . . . . . . . 17 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ∈ V
87uniex 7746 . . . . . . . . . . . . . . . 16 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ∈ V
9 eqid 2762 . . . . . . . . . . . . . . . . 17 rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) = rec((𝑦 ∈ V ↦ 𝑦), {𝑥})
10 unieq 4881 . . . . . . . . . . . . . . . . 17 (𝑤 = 𝑦 𝑤 = 𝑦)
11 unieq 4881 . . . . . . . . . . . . . . . . 17 (𝑤 = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) → 𝑤 = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))
129, 10, 11rdgsucmpt2 8422 . . . . . . . . . . . . . . . 16 ((𝑧 ∈ On ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ∈ V) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))
136, 8, 12sylancl 598 . . . . . . . . . . . . . . 15 (𝑧 ∈ ω → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))
1413eleq2d 2848 . . . . . . . . . . . . . 14 (𝑧 ∈ ω → (𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧) ↔ 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧)))
1514biimpar 483 . . . . . . . . . . . . 13 ((𝑧 ∈ ω ∧ 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧)) → 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧))
165, 15sylan2 605 . . . . . . . . . . . 12 ((𝑧 ∈ ω ∧ (𝑢𝑣𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))) → 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧))
17 fveq2 6882 . . . . . . . . . . . . . 14 (𝑤 = suc 𝑧 → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧))
1817eleq2d 2848 . . . . . . . . . . . . 13 (𝑤 = suc 𝑧 → (𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ↔ 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧)))
1918rspcev 3579 . . . . . . . . . . . 12 ((suc 𝑧 ∈ ω ∧ 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑧)) → ∃𝑤 ∈ ω 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
204, 16, 19syl2an2r 698 . . . . . . . . . . 11 ((𝑧 ∈ ω ∧ (𝑢𝑣𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))) → ∃𝑤 ∈ ω 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
21 eluniima 7250 . . . . . . . . . . . 12 (Fun rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) → (𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ↔ ∃𝑤 ∈ ω 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤)))
221, 21ax-mp 5 . . . . . . . . . . 11 (𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ↔ ∃𝑤 ∈ ω 𝑢 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
2320, 22sylibr 237 . . . . . . . . . 10 ((𝑧 ∈ ω ∧ (𝑢𝑣𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))) → 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω))
2423an12s 662 . . . . . . . . 9 ((𝑢𝑣 ∧ (𝑧 ∈ ω ∧ 𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧))) → 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω))
2524rexlimdvaa 3166 . . . . . . . 8 (𝑢𝑣 → (∃𝑧 ∈ ω 𝑣 ∈ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) → 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)))
263, 25biimtrid 245 . . . . . . 7 (𝑢𝑣 → (𝑣 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) → 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)))
2726reximdv 3179 . . . . . 6 (𝑢𝑣 → (∃𝑥𝐴 𝑣 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) → ∃𝑥𝐴 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)))
28 eliun 4958 . . . . . 6 (𝑣 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ↔ ∃𝑥𝐴 𝑣 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω))
29 eliun 4958 . . . . . 6 (𝑢 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ↔ ∃𝑥𝐴 𝑢 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω))
3027, 28, 293imtr4g 299 . . . . 5 (𝑢𝑣 → (𝑣 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) → 𝑢 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)))
31 df-ttc 37093 . . . . . 6 TC+ 𝐴 = 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)
3231eleq2i 2854 . . . . 5 (𝑣 ∈ TC+ 𝐴𝑣 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω))
3331eleq2i 2854 . . . . 5 (𝑢 ∈ TC+ 𝐴𝑢 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω))
3430, 32, 333imtr4g 299 . . . 4 (𝑢𝑣 → (𝑣 ∈ TC+ 𝐴𝑢 ∈ TC+ 𝐴))
3534imp 412 . . 3 ((𝑢𝑣𝑣 ∈ TC+ 𝐴) → 𝑢 ∈ TC+ 𝐴)
3635gen2 1829 . 2 𝑢𝑣((𝑢𝑣𝑣 ∈ TC+ 𝐴) → 𝑢 ∈ TC+ 𝐴)
37 dftr2 5218 . 2 (Tr TC+ 𝐴 ↔ ∀𝑢𝑣((𝑢𝑣𝑣 ∈ TC+ 𝐴) → 𝑢 ∈ TC+ 𝐴))
3836, 37mpbir 234 1 Tr TC+ 𝐴
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  wal 1568   = wceq 1570  wcel 2145  wrex 3088  Vcvv 3453  {csn 4587   cuni 4870   ciun 4954  cmpt 5190  Tr wtr 5216  cima 5662  Oncon0 6361  suc csuc 6363  Fun wfun 6531  cfv 6537  ωcom 7865  reccrdg 8401  TC+ cttc 37092
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-om 7866  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-ttc 37093
This theorem is used by:  ttctr2  37100  ttctr3  37101  ttcss  37104  ttcel  37106  ttcidm  37109  ttciunun  37117  ttcpwss  37121  dfttc3gw  37129  ttc0elw  37133  ttc0el  37141
  Copyright terms: Public domain W3C validator