Theorem tc2 9168

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

Step	Hyp	Ref	Expression
1		tc2.1	. . . . 5 ⊢ 𝐴 ∈ V
2		tcvalg 9164	. . . . 5 ⊢ (𝐴 ∈ V → (TC‘𝐴) = ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)})
3	1, 2	ax-mp 5	. . . 4 ⊢ (TC‘𝐴) = ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)}
4		trss 5145	. . . . . . 7 ⊢ (Tr 𝑥 → (𝐴 ∈ 𝑥 → 𝐴 ⊆ 𝑥))
5	4	imdistanri 573	. . . . . 6 ⊢ ((𝐴 ∈ 𝑥 ∧ Tr 𝑥) → (𝐴 ⊆ 𝑥 ∧ Tr 𝑥))
6	5	ss2abi 3994	. . . . 5 ⊢ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ⊆ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)}
7		intss 4859	. . . . 5 ⊢ ({𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ⊆ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} → ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)})
8	6, 7	ax-mp 5	. . . 4 ⊢ ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
9	3, 8	eqsstri 3949	. . 3 ⊢ (TC‘𝐴) ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
10	1	elintab 4849	. . . . 5 ⊢ (𝐴 ∈ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ↔ ∀𝑥((𝐴 ∈ 𝑥 ∧ Tr 𝑥) → 𝐴 ∈ 𝑥))
11		simpl 486	. . . . 5 ⊢ ((𝐴 ∈ 𝑥 ∧ Tr 𝑥) → 𝐴 ∈ 𝑥)
12	10, 11	mpgbir 1801	. . . 4 ⊢ 𝐴 ∈ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
13	1	snss 4679	. . . 4 ⊢ (𝐴 ∈ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ↔ {𝐴} ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)})
14	12, 13	mpbi 233	. . 3 ⊢ {𝐴} ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
15	9, 14	unssi 4112	. 2 ⊢ ((TC‘𝐴) ∪ {𝐴}) ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
16	1	snid 4561	. . . . 5 ⊢ 𝐴 ∈ {𝐴}
17		elun2 4104	. . . . 5 ⊢ (𝐴 ∈ {𝐴} → 𝐴 ∈ ((TC‘𝐴) ∪ {𝐴}))
18	16, 17	ax-mp 5	. . . 4 ⊢ 𝐴 ∈ ((TC‘𝐴) ∪ {𝐴})
19		uniun 4823	. . . . . . 7 ⊢ ∪ ((TC‘𝐴) ∪ {𝐴}) = (∪ (TC‘𝐴) ∪ ∪ {𝐴})
20		tctr 9166	. . . . . . . . 9 ⊢ Tr (TC‘𝐴)
21		df-tr 5137	. . . . . . . . 9 ⊢ (Tr (TC‘𝐴) ↔ ∪ (TC‘𝐴) ⊆ (TC‘𝐴))
22	20, 21	mpbi 233	. . . . . . . 8 ⊢ ∪ (TC‘𝐴) ⊆ (TC‘𝐴)
23	1	unisn 4820	. . . . . . . . 9 ⊢ ∪ {𝐴} = 𝐴
24		tcid 9165	. . . . . . . . . 10 ⊢ (𝐴 ∈ V → 𝐴 ⊆ (TC‘𝐴))
25	1, 24	ax-mp 5	. . . . . . . . 9 ⊢ 𝐴 ⊆ (TC‘𝐴)
26	23, 25	eqsstri 3949	. . . . . . . 8 ⊢ ∪ {𝐴} ⊆ (TC‘𝐴)
27	22, 26	unssi 4112	. . . . . . 7 ⊢ (∪ (TC‘𝐴) ∪ ∪ {𝐴}) ⊆ (TC‘𝐴)
28	19, 27	eqsstri 3949	. . . . . 6 ⊢ ∪ ((TC‘𝐴) ∪ {𝐴}) ⊆ (TC‘𝐴)
29		ssun1 4099	. . . . . 6 ⊢ (TC‘𝐴) ⊆ ((TC‘𝐴) ∪ {𝐴})
30	28, 29	sstri 3924	. . . . 5 ⊢ ∪ ((TC‘𝐴) ∪ {𝐴}) ⊆ ((TC‘𝐴) ∪ {𝐴})
31		df-tr 5137	. . . . 5 ⊢ (Tr ((TC‘𝐴) ∪ {𝐴}) ↔ ∪ ((TC‘𝐴) ∪ {𝐴}) ⊆ ((TC‘𝐴) ∪ {𝐴}))
32	30, 31	mpbir 234	. . . 4 ⊢ Tr ((TC‘𝐴) ∪ {𝐴})
33		fvex 6658	. . . . . 6 ⊢ (TC‘𝐴) ∈ V
34		snex 5297	. . . . . 6 ⊢ {𝐴} ∈ V
35	33, 34	unex 7449	. . . . 5 ⊢ ((TC‘𝐴) ∪ {𝐴}) ∈ V
36		eleq2 2878	. . . . . 6 ⊢ (𝑥 = ((TC‘𝐴) ∪ {𝐴}) → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ ((TC‘𝐴) ∪ {𝐴})))
37		treq 5142	. . . . . 6 ⊢ (𝑥 = ((TC‘𝐴) ∪ {𝐴}) → (Tr 𝑥 ↔ Tr ((TC‘𝐴) ∪ {𝐴})))
38	36, 37	anbi12d 633	. . . . 5 ⊢ (𝑥 = ((TC‘𝐴) ∪ {𝐴}) → ((𝐴 ∈ 𝑥 ∧ Tr 𝑥) ↔ (𝐴 ∈ ((TC‘𝐴) ∪ {𝐴}) ∧ Tr ((TC‘𝐴) ∪ {𝐴}))))
39	35, 38	elab 3615	. . . 4 ⊢ (((TC‘𝐴) ∪ {𝐴}) ∈ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ↔ (𝐴 ∈ ((TC‘𝐴) ∪ {𝐴}) ∧ Tr ((TC‘𝐴) ∪ {𝐴})))
40	18, 32, 39	mpbir2an 710	. . 3 ⊢ ((TC‘𝐴) ∪ {𝐴}) ∈ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
41		intss1 4853	. . 3 ⊢ (((TC‘𝐴) ∪ {𝐴}) ∈ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} → ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ⊆ ((TC‘𝐴) ∪ {𝐴}))
42	40, 41	ax-mp 5	. 2 ⊢ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ⊆ ((TC‘𝐴) ∪ {𝐴})
43	15, 42	eqssi 3931	1 ⊢ ((TC‘𝐴) ∪ {𝐴}) = ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2111  {cab 2776  Vcvv 3441   ∪ cun 3879   ⊆ wss 3881  {csn 4525  ∪ cuni 4800  ∩ cint 4838  Tr wtr 5136  ‘cfv 6324  TCctc 9162

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-inf2 9088

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-iin 4884  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-om 7561  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-tc 9163

This theorem is referenced by:  tcsni  9169