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 37477
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 4180 . . 3 𝐴 ⊆ (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴)
2 dftr3 5220 . . . 4 (Tr (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴) ↔ ∀𝑦 ∈ (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴)𝑦 ⊆ (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴))
3 elun 4155 . . . . . 6 (𝑦 ∈ (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴) ↔ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∨ 𝑦 ∈ 𝐴))
4 ttctr 37459 . . . . . . . . 9 Tr TC+ 𝑥
54rgenw 3084 . . . . . . . 8 ∀𝑥 ∈ 𝐴 Tr TC+ 𝑥
6 triun 5230 . . . . . . . 8 (∀𝑥 ∈ 𝐴 Tr TC+ 𝑥 → Tr ∪ 𝑥 ∈ 𝐴 TC+ 𝑥)
7 trss 5225 . . . . . . . 8 (Tr ∪ 𝑥 ∈ 𝐴 TC+ 𝑥 → (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 TC+ 𝑥 → 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 TC+ 𝑥))
85, 6, 7mp2b 10 . . . . . . 7 (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 TC+ 𝑥 → 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 TC+ 𝑥)
9 ttcid 37458 . . . . . . . 8 𝑦 ⊆ TC+ 𝑦
10 ttceq 37454 . . . . . . . . 9 (𝑥 = 𝑦 → TC+ 𝑥 = TC+ 𝑦)
1110ssiun2s 5010 . . . . . . . 8 (𝑦 ∈ 𝐴 → TC+ 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 TC+ 𝑥)
129, 11sstrid 3924 . . . . . . 7 (𝑦 ∈ 𝐴 → 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 TC+ 𝑥)
138, 12jaoi 871 . . . . . 6 ((𝑦 ∈ ∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∨ 𝑦 ∈ 𝐴) → 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 TC+ 𝑥)
143, 13sylbi 220 . . . . 5 (𝑦 ∈ (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴) → 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 TC+ 𝑥)
15 ssun3 4181 . . . . 5 (𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 TC+ 𝑥 → 𝑦 ⊆ (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴))
1614, 15syl 18 . . . 4 (𝑦 ∈ (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴) → 𝑦 ⊆ (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴))
172, 16mprgbir 3087 . . 3 Tr (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴)
18 ttcmin 37462 . . 3 ((𝐴 ⊆ (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴) ∧ Tr (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴)) → TC+ 𝐴 ⊆ (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴))
191, 17, 18mp2an 705 . 2 TC+ 𝐴 ⊆ (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴)
20 iunss 5006 . . . 4 (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ⊆ TC+ 𝐴 ↔ ∀𝑥 ∈ 𝐴 TC+ 𝑥 ⊆ TC+ 𝐴)
21 ttcel2 37467 . . . 4 (𝑥 ∈ 𝐴 → TC+ 𝑥 ⊆ TC+ 𝐴)
2220, 21mprgbir 3087 . . 3 ∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ⊆ TC+ 𝐴
23 ttcid 37458 . . 3 𝐴 ⊆ TC+ 𝐴
2422, 23unssi 4192 . 2 (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴) ⊆ TC+ 𝐴
2519, 24eqssi 3929 1 TC+ 𝐴 = (∪ 𝑥 ∈ 𝐴 TC+ 𝑥 ∪ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∨ wo 861   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900   ∪ cun 4152  ∪ ciun 4954  Tr wtr 5215  TC+ cttc 37452
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7775
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-om 7902  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-ttc 37453
This theorem is used by:  ttcun  37478  ttciun  37480  ttcsng  37485
  Copyright terms: Public domain W3C validator