MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  trclun Structured version   Visualization version   GIF version

Theorem trclun 14965
Description: Transitive closure of a union of relations. (Contributed by RP, 5-May-2020.)
Assertion
Ref Expression
trclun ((𝑅𝑉𝑆𝑊) → (t+‘(𝑅𝑆)) = (t+‘((t+‘𝑅) ∪ (t+‘𝑆))))

Proof of Theorem trclun
Dummy variables 𝑥 𝑟 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 unss 4183 . . . . . . . . . 10 ((𝑅𝑥𝑆𝑥) ↔ (𝑅𝑆) ⊆ 𝑥)
2 simpl 481 . . . . . . . . . 10 ((𝑅𝑥𝑆𝑥) → 𝑅𝑥)
31, 2sylbir 234 . . . . . . . . 9 ((𝑅𝑆) ⊆ 𝑥𝑅𝑥)
4 vex 3476 . . . . . . . . . . 11 𝑥 ∈ V
5 trcleq2lem 14942 . . . . . . . . . . 11 (𝑟 = 𝑥 → ((𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟) ↔ (𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)))
64, 5elab 3667 . . . . . . . . . 10 (𝑥 ∈ {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ↔ (𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥))
76biimpri 227 . . . . . . . . 9 ((𝑅𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) → 𝑥 ∈ {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)})
83, 7sylan 578 . . . . . . . 8 (((𝑅𝑆) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) → 𝑥 ∈ {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)})
9 intss1 4966 . . . . . . . 8 (𝑥 ∈ {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} → {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ⊆ 𝑥)
108, 9syl 17 . . . . . . 7 (((𝑅𝑆) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) → {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ⊆ 𝑥)
11 simpr 483 . . . . . . . . . 10 ((𝑅𝑥𝑆𝑥) → 𝑆𝑥)
121, 11sylbir 234 . . . . . . . . 9 ((𝑅𝑆) ⊆ 𝑥𝑆𝑥)
13 trcleq2lem 14942 . . . . . . . . . . 11 (𝑠 = 𝑥 → ((𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠) ↔ (𝑆𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)))
144, 13elab 3667 . . . . . . . . . 10 (𝑥 ∈ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} ↔ (𝑆𝑥 ∧ (𝑥𝑥) ⊆ 𝑥))
1514biimpri 227 . . . . . . . . 9 ((𝑆𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) → 𝑥 ∈ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)})
1612, 15sylan 578 . . . . . . . 8 (((𝑅𝑆) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) → 𝑥 ∈ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)})
17 intss1 4966 . . . . . . . 8 (𝑥 ∈ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} → {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} ⊆ 𝑥)
1816, 17syl 17 . . . . . . 7 (((𝑅𝑆) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) → {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} ⊆ 𝑥)
1910, 18unssd 4185 . . . . . 6 (((𝑅𝑆) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) → ( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) ⊆ 𝑥)
20 simpr 483 . . . . . 6 (((𝑅𝑆) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) → (𝑥𝑥) ⊆ 𝑥)
2119, 20jca 510 . . . . 5 (((𝑅𝑆) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) → (( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥))
22 ssmin 4970 . . . . . . . 8 𝑅 {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)}
23 ssmin 4970 . . . . . . . 8 𝑆 {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}
24 unss12 4181 . . . . . . . 8 ((𝑅 {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∧ 𝑆 {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) → (𝑅𝑆) ⊆ ( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}))
2522, 23, 24mp2an 688 . . . . . . 7 (𝑅𝑆) ⊆ ( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)})
26 sstr 3989 . . . . . . 7 (((𝑅𝑆) ⊆ ( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) ∧ ( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) ⊆ 𝑥) → (𝑅𝑆) ⊆ 𝑥)
2725, 26mpan 686 . . . . . 6 (( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) ⊆ 𝑥 → (𝑅𝑆) ⊆ 𝑥)
2827anim1i 613 . . . . 5 ((( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) → ((𝑅𝑆) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥))
2921, 28impbii 208 . . . 4 (((𝑅𝑆) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) ↔ (( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥))
3029abbii 2800 . . 3 {𝑥 ∣ ((𝑅𝑆) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)} = {𝑥 ∣ (( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)}
3130inteqi 4953 . 2 {𝑥 ∣ ((𝑅𝑆) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)} = {𝑥 ∣ (( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)}
32 unexg 7738 . . 3 ((𝑅𝑉𝑆𝑊) → (𝑅𝑆) ∈ V)
33 trclfv 14951 . . 3 ((𝑅𝑆) ∈ V → (t+‘(𝑅𝑆)) = {𝑥 ∣ ((𝑅𝑆) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)})
3432, 33syl 17 . 2 ((𝑅𝑉𝑆𝑊) → (t+‘(𝑅𝑆)) = {𝑥 ∣ ((𝑅𝑆) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)})
35 simpl 481 . . . . . 6 ((𝑅𝑉𝑆𝑊) → 𝑅𝑉)
36 trclfv 14951 . . . . . 6 (𝑅𝑉 → (t+‘𝑅) = {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)})
3735, 36syl 17 . . . . 5 ((𝑅𝑉𝑆𝑊) → (t+‘𝑅) = {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)})
38 simpr 483 . . . . . 6 ((𝑅𝑉𝑆𝑊) → 𝑆𝑊)
39 trclfv 14951 . . . . . 6 (𝑆𝑊 → (t+‘𝑆) = {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)})
4038, 39syl 17 . . . . 5 ((𝑅𝑉𝑆𝑊) → (t+‘𝑆) = {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)})
4137, 40uneq12d 4163 . . . 4 ((𝑅𝑉𝑆𝑊) → ((t+‘𝑅) ∪ (t+‘𝑆)) = ( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}))
4241fveq2d 6894 . . 3 ((𝑅𝑉𝑆𝑊) → (t+‘((t+‘𝑅) ∪ (t+‘𝑆))) = (t+‘( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)})))
43 fvex 6903 . . . . . 6 (t+‘𝑅) ∈ V
4436, 43eqeltrrdi 2840 . . . . 5 (𝑅𝑉 {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∈ V)
45 fvex 6903 . . . . . 6 (t+‘𝑆) ∈ V
4639, 45eqeltrrdi 2840 . . . . 5 (𝑆𝑊 {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} ∈ V)
47 unexg 7738 . . . . 5 (( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∈ V ∧ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} ∈ V) → ( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) ∈ V)
4844, 46, 47syl2an 594 . . . 4 ((𝑅𝑉𝑆𝑊) → ( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) ∈ V)
49 trclfv 14951 . . . 4 (( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) ∈ V → (t+‘( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)})) = {𝑥 ∣ (( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)})
5048, 49syl 17 . . 3 ((𝑅𝑉𝑆𝑊) → (t+‘( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)})) = {𝑥 ∣ (( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)})
5142, 50eqtrd 2770 . 2 ((𝑅𝑉𝑆𝑊) → (t+‘((t+‘𝑅) ∪ (t+‘𝑆))) = {𝑥 ∣ (( {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} ∪ {𝑠 ∣ (𝑆𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}) ⊆ 𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)})
5231, 34, 513eqtr4a 2796 1 ((𝑅𝑉𝑆𝑊) → (t+‘(𝑅𝑆)) = (t+‘((t+‘𝑅) ∪ (t+‘𝑆))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 394   = wceq 1539  wcel 2104  {cab 2707  Vcvv 3472  cun 3945  wss 3947   cint 4949  ccom 5679  cfv 6542  t+ctcl 14936
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7727
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3431  df-v 3474  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-int 4950  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-iota 6494  df-fun 6544  df-fv 6550  df-trcl 14938
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator