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

Theorem tc2 9725
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 9721 . . . . 5 (𝐴 ∈ V → (TC‘𝐴) = ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)})
31, 2ax-mp 5 . . . 4 (TC‘𝐴) = ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)}
4 trss 5222 . . . . . . 7 (Tr 𝑥 → (𝐴 ∈ 𝑥 → 𝐴 ⊆ 𝑥))
54imdistanri 580 . . . . . 6 ((𝐴 ∈ 𝑥 ∧ Tr 𝑥) → (𝐴 ⊆ 𝑥 ∧ Tr 𝑥))
65ss2abi 4014 . . . . 5 {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ⊆ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)}
7 intss 4929 . . . . 5 ({𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ⊆ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} → ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)})
86, 7ax-mp 5 . . . 4 ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
93, 8eqsstri 3977 . . 3 (TC‘𝐴) ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
101elintab 4919 . . . . 5 (𝐴 ∈ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ↔ ∀𝑥((𝐴 ∈ 𝑥 ∧ Tr 𝑥) → 𝐴 ∈ 𝑥))
11 simpl 488 . . . . 5 ((𝐴 ∈ 𝑥 ∧ Tr 𝑥) → 𝐴 ∈ 𝑥)
1210, 11mpgbir 1832 . . . 4 𝐴 ∈ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
131snss 4745 . . . 4 (𝐴 ∈ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ↔ {𝐴} ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)})
1412, 13mpbi 233 . . 3 {𝐴} ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
159, 14unssi 4137 . 2 ((TC‘𝐴) ∪ {𝐴}) ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
161snid 4623 . . . . 5 𝐴 ∈ {𝐴}
17 elun2 4129 . . . . 5 (𝐴 ∈ {𝐴} → 𝐴 ∈ ((TC‘𝐴) ∪ {𝐴}))
1816, 17ax-mp 5 . . . 4 𝐴 ∈ ((TC‘𝐴) ∪ {𝐴})
19 uniun 4890 . . . . . . 7 ∪ ((TC‘𝐴) ∪ {𝐴}) = (∪ (TC‘𝐴) ∪ ∪ {𝐴})
20 tctr 9723 . . . . . . . . 9 Tr (TC‘𝐴)
21 df-tr 5213 . . . . . . . . 9 (Tr (TC‘𝐴) ↔ ∪ (TC‘𝐴) ⊆ (TC‘𝐴))
2220, 21mpbi 233 . . . . . . . 8 ∪ (TC‘𝐴) ⊆ (TC‘𝐴)
231unisn 4886 . . . . . . . . 9 ∪ {𝐴} = 𝐴
24 tcid 9722 . . . . . . . . . 10 (𝐴 ∈ V → 𝐴 ⊆ (TC‘𝐴))
251, 24ax-mp 5 . . . . . . . . 9 𝐴 ⊆ (TC‘𝐴)
2623, 25eqsstri 3977 . . . . . . . 8 ∪ {𝐴} ⊆ (TC‘𝐴)
2722, 26unssi 4137 . . . . . . 7 (∪ (TC‘𝐴) ∪ ∪ {𝐴}) ⊆ (TC‘𝐴)
2819, 27eqsstri 3977 . . . . . 6 ∪ ((TC‘𝐴) ∪ {𝐴}) ⊆ (TC‘𝐴)
29 ssun1 4124 . . . . . 6 (TC‘𝐴) ⊆ ((TC‘𝐴) ∪ {𝐴})
3028, 29sstri 3940 . . . . 5 ∪ ((TC‘𝐴) ∪ {𝐴}) ⊆ ((TC‘𝐴) ∪ {𝐴})
31 df-tr 5213 . . . . 5 (Tr ((TC‘𝐴) ∪ {𝐴}) ↔ ∪ ((TC‘𝐴) ∪ {𝐴}) ⊆ ((TC‘𝐴) ∪ {𝐴}))
3230, 31mpbir 234 . . . 4 Tr ((TC‘𝐴) ∪ {𝐴})
33 fvex 6890 . . . . . 6 (TC‘𝐴) ∈ V
34 snex 5397 . . . . . 6 {𝐴} ∈ V
3533, 34unex 7750 . . . . 5 ((TC‘𝐴) ∪ {𝐴}) ∈ V
36 eleq2 2850 . . . . . 6 (𝑥 = ((TC‘𝐴) ∪ {𝐴}) → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ ((TC‘𝐴) ∪ {𝐴})))
37 treq 5219 . . . . . 6 (𝑥 = ((TC‘𝐴) ∪ {𝐴}) → (Tr 𝑥 ↔ Tr ((TC‘𝐴) ∪ {𝐴})))
3836, 37anbi12d 644 . . . . 5 (𝑥 = ((TC‘𝐴) ∪ {𝐴}) → ((𝐴 ∈ 𝑥 ∧ Tr 𝑥) ↔ (𝐴 ∈ ((TC‘𝐴) ∪ {𝐴}) ∧ Tr ((TC‘𝐴) ∪ {𝐴}))))
3935, 38elab 3633 . . . 4 (((TC‘𝐴) ∪ {𝐴}) ∈ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ↔ (𝐴 ∈ ((TC‘𝐴) ∪ {𝐴}) ∧ Tr ((TC‘𝐴) ∪ {𝐴})))
4018, 32, 39mpbir2an 724 . . 3 ((TC‘𝐴) ∪ {𝐴}) ∈ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
41 intss1 4923 . . 3 (((TC‘𝐴) ∪ {𝐴}) ∈ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} → ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ⊆ ((TC‘𝐴) ∪ {𝐴}))
4240, 41ax-mp 5 . 2 ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ⊆ ((TC‘𝐴) ∪ {𝐴})
4315, 42eqssi 3947 1 ((TC‘𝐴) ∪ {𝐴}) = ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  Vcvv 3451   ∪ cun 3897   ⊆ wss 3899  {csn 4584  ∪ cuni 4867  ∩ cint 4907  Tr wtr 5212  ‘cfv 6531  TCctc 9719
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 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7740  ax-inf2 9626
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-om 7867  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-tc 9720
This theorem is used by:  tcsni  9726
  Copyright terms: Public domain W3C validator