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

Theorem ttciunun 37117
Description: Relationship between TC+ 𝐴 and 𝑥𝐴TC+ 𝑥: we can decompose TC+ 𝐴 into the elements of 𝑥𝐴TC+ 𝑥 plus the elements of 𝐴 itself. (Contributed by Matthew House, 6-Apr-2026.)
Assertion
Ref Expression
ttciunun TC+ 𝐴 = ( 𝑥𝐴 TC+ 𝑥𝐴)
Distinct variable group:   𝑥,𝐴

Proof of Theorem ttciunun
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 ssun2 4128 . . 3 𝐴 ⊆ ( 𝑥𝐴 TC+ 𝑥𝐴)
2 dftr3 5221 . . . 4 (Tr ( 𝑥𝐴 TC+ 𝑥𝐴) ↔ ∀𝑦 ∈ ( 𝑥𝐴 TC+ 𝑥𝐴)𝑦 ⊆ ( 𝑥𝐴 TC+ 𝑥𝐴))
3 elun 4103 . . . . . 6 (𝑦 ∈ ( 𝑥𝐴 TC+ 𝑥𝐴) ↔ (𝑦 𝑥𝐴 TC+ 𝑥𝑦𝐴))
4 ttctr 37099 . . . . . . . . 9 Tr TC+ 𝑥
54rgenw 3082 . . . . . . . 8 𝑥𝐴 Tr TC+ 𝑥
6 triun 5231 . . . . . . . 8 (∀𝑥𝐴 Tr TC+ 𝑥 → Tr 𝑥𝐴 TC+ 𝑥)
7 trss 5226 . . . . . . . 8 (Tr 𝑥𝐴 TC+ 𝑥 → (𝑦 𝑥𝐴 TC+ 𝑥𝑦 𝑥𝐴 TC+ 𝑥))
85, 6, 7mp2b 10 . . . . . . 7 (𝑦 𝑥𝐴 TC+ 𝑥𝑦 𝑥𝐴 TC+ 𝑥)
9 ttcid 37098 . . . . . . . 8 𝑦 ⊆ TC+ 𝑦
10 ttceq 37094 . . . . . . . . 9 (𝑥 = 𝑦 → TC+ 𝑥 = TC+ 𝑦)
1110ssiun2s 5011 . . . . . . . 8 (𝑦𝐴 → TC+ 𝑦 𝑥𝐴 TC+ 𝑥)
129, 11sstrid 3945 . . . . . . 7 (𝑦𝐴𝑦 𝑥𝐴 TC+ 𝑥)
138, 12jaoi 871 . . . . . 6 ((𝑦 𝑥𝐴 TC+ 𝑥𝑦𝐴) → 𝑦 𝑥𝐴 TC+ 𝑥)
143, 13sylbi 220 . . . . 5 (𝑦 ∈ ( 𝑥𝐴 TC+ 𝑥𝐴) → 𝑦 𝑥𝐴 TC+ 𝑥)
15 ssun3 4129 . . . . 5 (𝑦 𝑥𝐴 TC+ 𝑥𝑦 ⊆ ( 𝑥𝐴 TC+ 𝑥𝐴))
1614, 15syl 18 . . . 4 (𝑦 ∈ ( 𝑥𝐴 TC+ 𝑥𝐴) → 𝑦 ⊆ ( 𝑥𝐴 TC+ 𝑥𝐴))
172, 16mprgbir 3085 . . 3 Tr ( 𝑥𝐴 TC+ 𝑥𝐴)
18 ttcmin 37102 . . 3 ((𝐴 ⊆ ( 𝑥𝐴 TC+ 𝑥𝐴) ∧ Tr ( 𝑥𝐴 TC+ 𝑥𝐴)) → TC+ 𝐴 ⊆ ( 𝑥𝐴 TC+ 𝑥𝐴))
191, 17, 18mp2an 705 . 2 TC+ 𝐴 ⊆ ( 𝑥𝐴 TC+ 𝑥𝐴)
20 iunss 5007 . . . 4 ( 𝑥𝐴 TC+ 𝑥 ⊆ TC+ 𝐴 ↔ ∀𝑥𝐴 TC+ 𝑥 ⊆ TC+ 𝐴)
21 ttcel2 37107 . . . 4 (𝑥𝐴 → TC+ 𝑥 ⊆ TC+ 𝐴)
2220, 21mprgbir 3085 . . 3 𝑥𝐴 TC+ 𝑥 ⊆ TC+ 𝐴
23 ttcid 37098 . . 3 𝐴 ⊆ TC+ 𝐴
2422, 23unssi 4140 . 2 ( 𝑥𝐴 TC+ 𝑥𝐴) ⊆ TC+ 𝐴
2519, 24eqssi 3950 1 TC+ 𝐴 = ( 𝑥𝐴 TC+ 𝑥𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wo 861   = wceq 1570  wcel 2145  wral 3078  cun 3900  wss 3902   ciun 4954  Tr wtr 5216  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:  ttcun  37118  ttciun  37120  ttcsng  37125
  Copyright terms: Public domain W3C validator