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

Theorem tctr 9717
Description: Defining property of the transitive closure function: it is transitive. (Contributed by Mario Carneiro, 23-Jun-2013.)
Assertion
Ref Expression
tctr Tr (TC‘𝐴)

Proof of Theorem tctr
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 trint 5229 . . . 4 (∀𝑦 ∈ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)}Tr 𝑦 → Tr ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)})
2 vex 3454 . . . . . 6 𝑦 ∈ V
3 sseq2 3956 . . . . . . 7 (𝑥 = 𝑦 → (𝐴 ⊆ 𝑥 ↔ 𝐴 ⊆ 𝑦))
4 treq 5218 . . . . . . 7 (𝑥 = 𝑦 → (Tr 𝑥 ↔ Tr 𝑦))
53, 4anbi12d 644 . . . . . 6 (𝑥 = 𝑦 → ((𝐴 ⊆ 𝑥 ∧ Tr 𝑥) ↔ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)))
62, 5elab 3632 . . . . 5 (𝑦 ∈ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} ↔ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦))
76simprbi 503 . . . 4 (𝑦 ∈ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} → Tr 𝑦)
81, 7mprg 3082 . . 3 Tr ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)}
9 tcvalg 9715 . . . 4 (𝐴 ∈ V → (TC‘𝐴) = ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)})
10 treq 5218 . . . 4 ((TC‘𝐴) = ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} → (Tr (TC‘𝐴) ↔ Tr ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)}))
119, 10syl 18 . . 3 (𝐴 ∈ V → (Tr (TC‘𝐴) ↔ Tr ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)}))
128, 11mpbiri 261 . 2 (𝐴 ∈ V → Tr (TC‘𝐴))
13 tr0 5224 . . 3 Tr ∅
14 fvprc 6865 . . . 4 (¬ 𝐴 ∈ V → (TC‘𝐴) = ∅)
15 treq 5218 . . . 4 ((TC‘𝐴) = ∅ → (Tr (TC‘𝐴) ↔ Tr ∅))
1614, 15syl 18 . . 3 (¬ 𝐴 ∈ V → (Tr (TC‘𝐴) ↔ Tr ∅))
1713, 16mpbiri 261 . 2 (¬ 𝐴 ∈ V → Tr (TC‘𝐴))
1812, 17pm2.61i 184 1 Tr (TC‘𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2738  Vcvv 3450   ⊆ wss 3898  ∅c0 4278  ∩ cint 4906  Tr wtr 5211  ‘cfv 6527  TCctc 9713
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 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7734  ax-inf2 9620
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6293  df-ord 6354  df-on 6355  df-lim 6356  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-ov 7411  df-om 7861  df-2nd 7985  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-tc 9714
This theorem is used by:  tc2  9719  tcidm  9723  itunitc1  10469  tcfr  45890
  Copyright terms: Public domain W3C validator