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

Theorem tc2 9500
Description: A variant of the definition of the transitive closure function, using instead the smallest transitive set containing 𝐴 as a member, gives almost the same set, except that 𝐴 itself must be added because it is not usually a member of (TC‘𝐴) (and it is never a member if 𝐴 is well-founded). (Contributed by Mario Carneiro, 23-Jun-2013.)
Hypothesis
Ref Expression
tc2.1 𝐴 ∈ V
Assertion
Ref Expression
tc2 ((TC‘𝐴) ∪ {𝐴}) = {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)}
Distinct variable group:   𝑥,𝐴

Proof of Theorem tc2
StepHypRef Expression
1 tc2.1 . . . . 5 𝐴 ∈ V
2 tcvalg 9496 . . . . 5 (𝐴 ∈ V → (TC‘𝐴) = {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)})
31, 2ax-mp 5 . . . 4 (TC‘𝐴) = {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)}
4 trss 5200 . . . . . . 7 (Tr 𝑥 → (𝐴𝑥𝐴𝑥))
54imdistanri 570 . . . . . 6 ((𝐴𝑥 ∧ Tr 𝑥) → (𝐴𝑥 ∧ Tr 𝑥))
65ss2abi 4000 . . . . 5 {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)} ⊆ {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)}
7 intss 4900 . . . . 5 ({𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)} ⊆ {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)} → {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)} ⊆ {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)})
86, 7ax-mp 5 . . . 4 {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)} ⊆ {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)}
93, 8eqsstri 3955 . . 3 (TC‘𝐴) ⊆ {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)}
101elintab 4890 . . . . 5 (𝐴 {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)} ↔ ∀𝑥((𝐴𝑥 ∧ Tr 𝑥) → 𝐴𝑥))
11 simpl 483 . . . . 5 ((𝐴𝑥 ∧ Tr 𝑥) → 𝐴𝑥)
1210, 11mpgbir 1802 . . . 4 𝐴 {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)}
131snss 4719 . . . 4 (𝐴 {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)} ↔ {𝐴} ⊆ {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)})
1412, 13mpbi 229 . . 3 {𝐴} ⊆ {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)}
159, 14unssi 4119 . 2 ((TC‘𝐴) ∪ {𝐴}) ⊆ {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)}
161snid 4597 . . . . 5 𝐴 ∈ {𝐴}
17 elun2 4111 . . . . 5 (𝐴 ∈ {𝐴} → 𝐴 ∈ ((TC‘𝐴) ∪ {𝐴}))
1816, 17ax-mp 5 . . . 4 𝐴 ∈ ((TC‘𝐴) ∪ {𝐴})
19 uniun 4864 . . . . . . 7 ((TC‘𝐴) ∪ {𝐴}) = ( (TC‘𝐴) ∪ {𝐴})
20 tctr 9498 . . . . . . . . 9 Tr (TC‘𝐴)
21 df-tr 5192 . . . . . . . . 9 (Tr (TC‘𝐴) ↔ (TC‘𝐴) ⊆ (TC‘𝐴))
2220, 21mpbi 229 . . . . . . . 8 (TC‘𝐴) ⊆ (TC‘𝐴)
231unisn 4861 . . . . . . . . 9 {𝐴} = 𝐴
24 tcid 9497 . . . . . . . . . 10 (𝐴 ∈ V → 𝐴 ⊆ (TC‘𝐴))
251, 24ax-mp 5 . . . . . . . . 9 𝐴 ⊆ (TC‘𝐴)
2623, 25eqsstri 3955 . . . . . . . 8 {𝐴} ⊆ (TC‘𝐴)
2722, 26unssi 4119 . . . . . . 7 ( (TC‘𝐴) ∪ {𝐴}) ⊆ (TC‘𝐴)
2819, 27eqsstri 3955 . . . . . 6 ((TC‘𝐴) ∪ {𝐴}) ⊆ (TC‘𝐴)
29 ssun1 4106 . . . . . 6 (TC‘𝐴) ⊆ ((TC‘𝐴) ∪ {𝐴})
3028, 29sstri 3930 . . . . 5 ((TC‘𝐴) ∪ {𝐴}) ⊆ ((TC‘𝐴) ∪ {𝐴})
31 df-tr 5192 . . . . 5 (Tr ((TC‘𝐴) ∪ {𝐴}) ↔ ((TC‘𝐴) ∪ {𝐴}) ⊆ ((TC‘𝐴) ∪ {𝐴}))
3230, 31mpbir 230 . . . 4 Tr ((TC‘𝐴) ∪ {𝐴})
33 fvex 6787 . . . . . 6 (TC‘𝐴) ∈ V
34 snex 5354 . . . . . 6 {𝐴} ∈ V
3533, 34unex 7596 . . . . 5 ((TC‘𝐴) ∪ {𝐴}) ∈ V
36 eleq2 2827 . . . . . 6 (𝑥 = ((TC‘𝐴) ∪ {𝐴}) → (𝐴𝑥𝐴 ∈ ((TC‘𝐴) ∪ {𝐴})))
37 treq 5197 . . . . . 6 (𝑥 = ((TC‘𝐴) ∪ {𝐴}) → (Tr 𝑥 ↔ Tr ((TC‘𝐴) ∪ {𝐴})))
3836, 37anbi12d 631 . . . . 5 (𝑥 = ((TC‘𝐴) ∪ {𝐴}) → ((𝐴𝑥 ∧ Tr 𝑥) ↔ (𝐴 ∈ ((TC‘𝐴) ∪ {𝐴}) ∧ Tr ((TC‘𝐴) ∪ {𝐴}))))
3935, 38elab 3609 . . . 4 (((TC‘𝐴) ∪ {𝐴}) ∈ {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)} ↔ (𝐴 ∈ ((TC‘𝐴) ∪ {𝐴}) ∧ Tr ((TC‘𝐴) ∪ {𝐴})))
4018, 32, 39mpbir2an 708 . . 3 ((TC‘𝐴) ∪ {𝐴}) ∈ {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)}
41 intss1 4894 . . 3 (((TC‘𝐴) ∪ {𝐴}) ∈ {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)} → {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)} ⊆ ((TC‘𝐴) ∪ {𝐴}))
4240, 41ax-mp 5 . 2 {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)} ⊆ ((TC‘𝐴) ∪ {𝐴})
4315, 42eqssi 3937 1 ((TC‘𝐴) ∪ {𝐴}) = {𝑥 ∣ (𝐴𝑥 ∧ Tr 𝑥)}
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1539  wcel 2106  {cab 2715  Vcvv 3432  cun 3885  wss 3887  {csn 4561   cuni 4839   cint 4879  Tr wtr 5191  cfv 6433  TCctc 9494
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588  ax-inf2 9399
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-iin 4927  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-om 7713  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-tc 9495
This theorem is referenced by:  tcsni  9501
  Copyright terms: Public domain W3C validator