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 36794
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 36785 . 2 TC+ 𝐴 = 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)
2 ssel2 3922 . . . . 5 ((𝐴𝐵𝑥𝐴) → 𝑥𝐵)
3 rdgfun 8371 . . . . . . 7 Fun rec((𝑦 ∈ V ↦ 𝑦), {𝑥})
4 funiunfv 7217 . . . . . . 7 (Fun rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) → 𝑧 ∈ ω (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω))
53, 4ax-mp 5 . . . . . 6 𝑧 ∈ ω (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)
6 fveq2 6852 . . . . . . . . . 10 (𝑧 = ∅ → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘∅))
76sseq1d 3958 . . . . . . . . 9 (𝑧 = ∅ → ((rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ⊆ 𝐵 ↔ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘∅) ⊆ 𝐵))
8 fveq2 6852 . . . . . . . . . 10 (𝑧 = 𝑤 → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
98sseq1d 3958 . . . . . . . . 9 (𝑧 = 𝑤 → ((rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ⊆ 𝐵 ↔ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵))
10 fveq2 6852 . . . . . . . . . 10 (𝑧 = suc 𝑤 → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑤))
1110sseq1d 3958 . . . . . . . . 9 (𝑧 = suc 𝑤 → ((rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ⊆ 𝐵 ↔ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑤) ⊆ 𝐵))
12 vsnex 5382 . . . . . . . . . . . 12 {𝑥} ∈ V
1312rdg0 8376 . . . . . . . . . . 11 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘∅) = {𝑥}
14 snssi 4734 . . . . . . . . . . 11 (𝑥𝐵 → {𝑥} ⊆ 𝐵)
1513, 14eqsstrid 3965 . . . . . . . . . 10 (𝑥𝐵 → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘∅) ⊆ 𝐵)
1615adantr 483 . . . . . . . . 9 ((𝑥𝐵 ∧ Tr 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘∅) ⊆ 𝐵)
17 nnon 7837 . . . . . . . . . . . . 13 (𝑤 ∈ ω → 𝑤 ∈ On)
18 fvex 6865 . . . . . . . . . . . . . 14 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ∈ V
1918uniex 7709 . . . . . . . . . . . . 13 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ∈ V
20 eqid 2752 . . . . . . . . . . . . . 14 rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) = rec((𝑦 ∈ V ↦ 𝑦), {𝑥})
21 unieq 4866 . . . . . . . . . . . . . 14 (𝑧 = 𝑦 𝑧 = 𝑦)
22 unieq 4866 . . . . . . . . . . . . . 14 (𝑧 = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) → 𝑧 = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
2320, 21, 22rdgsucmpt2 8385 . . . . . . . . . . . . 13 ((𝑤 ∈ On ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ∈ V) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑤) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
2417, 19, 23sylancl 594 . . . . . . . . . . . 12 (𝑤 ∈ ω → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑤) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
25243ad2ant1 1142 . . . . . . . . . . 11 ((𝑤 ∈ ω ∧ (𝑥𝐵 ∧ Tr 𝐵) ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑤) = (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤))
26 uniss 4863 . . . . . . . . . . . . 13 ((rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵)
27263ad2ant3 1144 . . . . . . . . . . . 12 ((𝑤 ∈ ω ∧ (𝑥𝐵 ∧ Tr 𝐵) ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵)
28 simp2r 1210 . . . . . . . . . . . . 13 ((𝑤 ∈ ω ∧ (𝑥𝐵 ∧ Tr 𝐵) ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵) → Tr 𝐵)
29 df-tr 5198 . . . . . . . . . . . . 13 (Tr 𝐵 𝐵𝐵)
3028, 29sylib 220 . . . . . . . . . . . 12 ((𝑤 ∈ ω ∧ (𝑥𝐵 ∧ Tr 𝐵) ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵) → 𝐵𝐵)
3127, 30sstrd 3937 . . . . . . . . . . 11 ((𝑤 ∈ ω ∧ (𝑥𝐵 ∧ Tr 𝐵) ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵)
3225, 31eqsstrd 3961 . . . . . . . . . 10 ((𝑤 ∈ ω ∧ (𝑥𝐵 ∧ Tr 𝐵) ∧ (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑤) ⊆ 𝐵)
33323exp 1128 . . . . . . . . 9 (𝑤 ∈ ω → ((𝑥𝐵 ∧ Tr 𝐵) → ((rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑤) ⊆ 𝐵 → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘suc 𝑤) ⊆ 𝐵)))
347, 9, 11, 16, 33finds2 7864 . . . . . . . 8 (𝑧 ∈ ω → ((𝑥𝐵 ∧ Tr 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ⊆ 𝐵))
3534impcom 410 . . . . . . 7 (((𝑥𝐵 ∧ Tr 𝐵) ∧ 𝑧 ∈ ω) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ⊆ 𝐵)
3635iunssd 4998 . . . . . 6 ((𝑥𝐵 ∧ Tr 𝐵) → 𝑧 ∈ ω (rec((𝑦 ∈ V ↦ 𝑦), {𝑥})‘𝑧) ⊆ 𝐵)
375, 36eqsstrrid 3966 . . . . 5 ((𝑥𝐵 ∧ Tr 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ⊆ 𝐵)
382, 37sylan 588 . . . 4 (((𝐴𝐵𝑥𝐴) ∧ Tr 𝐵) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ⊆ 𝐵)
3938an32s 660 . . 3 (((𝐴𝐵 ∧ Tr 𝐵) ∧ 𝑥𝐴) → (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ⊆ 𝐵)
4039iunssd 4998 . 2 ((𝐴𝐵 ∧ Tr 𝐵) → 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) ⊆ 𝐵)
411, 40eqsstrid 3965 1 ((𝐴𝐵 ∧ Tr 𝐵) → TC+ 𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1095   = wceq 1550  wcel 2132  Vcvv 3444  wss 3895  c0 4276  {csn 4572   cuni 4855   ciun 4939  cmpt 5171  Tr wtr 5197  cima 5639  Oncon0 6331  suc csuc 6333  Fun wfun 6500  cfv 6506  ωcom 7831  reccrdg 8364  TC+ cttc 36784
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-rep 5217  ax-sep 5236  ax-nul 5246  ax-pr 5380  ax-un 7703
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3or 1096  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-ral 3067  df-rex 3077  df-reu 3358  df-rab 3405  df-v 3446  df-sbc 3736  df-csb 3844  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-pss 3915  df-nul 4277  df-if 4471  df-pw 4547  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4856  df-iun 4941  df-br 5091  df-opab 5153  df-mpt 5172  df-tr 5198  df-id 5531  df-eprel 5536  df-po 5544  df-so 5545  df-fr 5589  df-we 5591  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-res 5648  df-ima 5649  df-pred 6273  df-ord 6334  df-on 6335  df-lim 6336  df-suc 6337  df-iota 6462  df-fun 6508  df-fn 6509  df-f 6510  df-f1 6511  df-fo 6512  df-f1o 6513  df-fv 6514  df-ov 7384  df-om 7832  df-2nd 7956  df-frecs 8246  df-wrecs 8277  df-recs 8326  df-rdg 8365  df-ttc 36785
This theorem is referenced by:  ttcss  36796  ttcel  36798  ttctrid  36800  dfttc2g  36804  ttcuniun  36808  ttciunun  36809  ttcuni  36811  ttcpwss  36813  ttcsnmin  36816  dfttc3gw  36821  ttcwf  36822  dfttc4  36828  ttcexg  36830
  Copyright terms: Public domain W3C validator