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

Theorem ttcmin 36737
Description: The transitive closure of 𝐴 is a subclass of every transitive class containing 𝐴. (Contributed by Matthew House, 6-Apr-2026.)
Assertion
Ref Expression
ttcmin ((𝐴𝐵 ∧ Tr 𝐵) → TC+ 𝐴𝐵)

Proof of Theorem ttcmin
Dummy variables 𝑥 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ttc 36728 . 2 TC+ 𝐴 = 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)
2 ssel2 3911 . . . . 5 ((𝐴𝐵𝑥𝐴) → 𝑥𝐵)
3 rdgfun 8349 . . . . . . 7 Fun rec((𝑦 ∈ V ↦ 𝑦), {𝑥})
4 funiunfv 7195 . . . . . . 7 (Fun rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) → 𝑧 ∈ ω (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω))
53, 4ax-mp 5 . . . . . 6 𝑧 ∈ ω (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)
6 fveq2 6830 . . . . . . . . . 10 (𝑧 = ∅ → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘∅))
76sseq1d 3947 . . . . . . . . 9 (𝑧 = ∅ → ((rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ⊆ 𝐵 ↔ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘∅) ⊆ 𝐵))
8 fveq2 6830 . . . . . . . . . 10 (𝑧 = 𝑤 → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
98sseq1d 3947 . . . . . . . . 9 (𝑧 = 𝑤 → ((rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ⊆ 𝐵 ↔ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵))
10 fveq2 6830 . . . . . . . . . 10 (𝑧 = suc 𝑤 → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑤))
1110sseq1d 3947 . . . . . . . . 9 (𝑧 = suc 𝑤 → ((rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ⊆ 𝐵 ↔ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑤) ⊆ 𝐵))
12 vsnex 5366 . . . . . . . . . . . 12 {𝑥} ∈ V
1312rdg0 8354 . . . . . . . . . . 11 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘∅) = {𝑥}
14 snssi 4719 . . . . . . . . . . 11 (𝑥𝐵 → {𝑥} ⊆ 𝐵)
1513, 14eqsstrid 3954 . . . . . . . . . 10 (𝑥𝐵 → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘∅) ⊆ 𝐵)
1615adantr 482 . . . . . . . . 9 ((𝑥𝐵 ∧ Tr 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘∅) ⊆ 𝐵)
17 nnon 7815 . . . . . . . . . . . . 13 (𝑤 ∈ ω → 𝑤 ∈ On)
18 fvex 6843 . . . . . . . . . . . . . 14 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ∈ V
1918uniex 7687 . . . . . . . . . . . . 13 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ∈ V
20 eqid 2741 . . . . . . . . . . . . . 14 rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) = rec((𝑦 ∈ V ↦ 𝑦), {𝑥})
21 unieq 4851 . . . . . . . . . . . . . 14 (𝑧 = 𝑦 𝑧 = 𝑦)
22 unieq 4851 . . . . . . . . . . . . . 14 (𝑧 = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) → 𝑧 = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
2320, 21, 22rdgsucmpt2 8363 . . . . . . . . . . . . 13 ((𝑤 ∈ On ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ∈ V) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑤) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
2417, 19, 23sylancl 593 . . . . . . . . . . . 12 (𝑤 ∈ ω → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑤) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
25243ad2ant1 1140 . . . . . . . . . . 11 ((𝑤 ∈ ω ∧ (𝑥𝐵 ∧ Tr 𝐵) ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑤) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
26 uniss 4848 . . . . . . . . . . . . 13 ((rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵)
27263ad2ant3 1142 . . . . . . . . . . . 12 ((𝑤 ∈ ω ∧ (𝑥𝐵 ∧ Tr 𝐵) ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵)
28 simp2r 1208 . . . . . . . . . . . . 13 ((𝑤 ∈ ω ∧ (𝑥𝐵 ∧ Tr 𝐵) ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵) → Tr 𝐵)
29 df-tr 5182 . . . . . . . . . . . . 13 (Tr 𝐵 𝐵𝐵)
3028, 29sylib 220 . . . . . . . . . . . 12 ((𝑤 ∈ ω ∧ (𝑥𝐵 ∧ Tr 𝐵) ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵) → 𝐵𝐵)
3127, 30sstrd 3926 . . . . . . . . . . 11 ((𝑤 ∈ ω ∧ (𝑥𝐵 ∧ Tr 𝐵) ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵)
3225, 31eqsstrd 3950 . . . . . . . . . 10 ((𝑤 ∈ ω ∧ (𝑥𝐵 ∧ Tr 𝐵) ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑤) ⊆ 𝐵)
33323exp 1126 . . . . . . . . 9 (𝑤 ∈ ω → ((𝑥𝐵 ∧ Tr 𝐵) → ((rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵 → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑤) ⊆ 𝐵)))
347, 9, 11, 16, 33finds2 7842 . . . . . . . 8 (𝑧 ∈ ω → ((𝑥𝐵 ∧ Tr 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ⊆ 𝐵))
3534impcom 409 . . . . . . 7 (((𝑥𝐵 ∧ Tr 𝐵) ∧ 𝑧 ∈ ω) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ⊆ 𝐵)
3635iunssd 4982 . . . . . 6 ((𝑥𝐵 ∧ Tr 𝐵) → 𝑧 ∈ ω (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ⊆ 𝐵)
375, 36eqsstrrid 3955 . . . . 5 ((𝑥𝐵 ∧ Tr 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ⊆ 𝐵)
382, 37sylan 587 . . . 4 (((𝐴𝐵𝑥𝐴) ∧ Tr 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ⊆ 𝐵)
3938an32s 659 . . 3 (((𝐴𝐵 ∧ Tr 𝐵) ∧ 𝑥𝐴) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ⊆ 𝐵)
4039iunssd 4982 . 2 ((𝐴𝐵 ∧ Tr 𝐵) → 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ⊆ 𝐵)
411, 40eqsstrid 3954 1 ((𝐴𝐵 ∧ Tr 𝐵) → TC+ 𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397  w3a 1093   = wceq 1548  wcel 2121  Vcvv 3433  wss 3884  c0 4263  {csn 4557   cuni 4840   ciun 4923  cmpt 5155  Tr wtr 5181  cima 5623  Oncon0 6313  suc csuc 6315  Fun wfun 6482  cfv 6488  ωcom 7809  reccrdg 8342  TC+ cttc 36727
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5201  ax-sep 5220  ax-nul 5230  ax-pr 5364  ax-un 7681
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3725  df-csb 3833  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-pss 3904  df-nul 4264  df-if 4457  df-pw 4533  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4841  df-iun 4925  df-br 5075  df-opab 5137  df-mpt 5156  df-tr 5182  df-id 5515  df-eprel 5520  df-po 5528  df-so 5529  df-fr 5573  df-we 5575  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-pred 6255  df-ord 6316  df-on 6317  df-lim 6318  df-suc 6319  df-iota 6444  df-fun 6490  df-fn 6491  df-f 6492  df-f1 6493  df-fo 6494  df-f1o 6495  df-fv 6496  df-ov 7362  df-om 7810  df-2nd 7934  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8343  df-ttc 36728
This theorem is referenced by:  ttcss  36739  ttcel  36741  ttctrid  36743  dfttc2g  36747  ttcuniun  36751  ttciunun  36752  ttcuni  36754  ttcpwss  36756  ttcsnmin  36759  dfttc3gw  36764  ttcwf  36765  dfttc4  36771  ttcexg  36773
  Copyright terms: Public domain W3C validator