Theorem tc2 9744

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 9740	. . . . 5 ⊢ (𝐴 ∈ V → (TC‘𝐴) = ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)})
3	1, 2	ax-mp 5	. . . 4 ⊢ (TC‘𝐴) = ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)}
4		trss 5221	. . . . . . 7 ⊢ (Tr 𝑥 → (𝐴 ∈ 𝑥 → 𝐴 ⊆ 𝑥))
5	4	imdistanri 580	. . . . . 6 ⊢ ((𝐴 ∈ 𝑥 ∧ Tr 𝑥) → (𝐴 ⊆ 𝑥 ∧ Tr 𝑥))
6	5	ss2abi 3991	. . . . 5 ⊢ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ⊆ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)}
7		intss 4928	. . . . 5 ⊢ ({𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ⊆ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} → ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)})
8	6, 7	ax-mp 5	. . . 4 ⊢ ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
9	3, 8	eqsstri 3954	. . 3 ⊢ (TC‘𝐴) ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
10	1	elintab 4918	. . . . 5 ⊢ (𝐴 ∈ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ↔ ∀𝑥((𝐴 ∈ 𝑥 ∧ Tr 𝑥) → 𝐴 ∈ 𝑥))
11		simpl 488	. . . . 5 ⊢ ((𝐴 ∈ 𝑥 ∧ Tr 𝑥) → 𝐴 ∈ 𝑥)
12	10, 11	mpgbir 1831	. . . 4 ⊢ 𝐴 ∈ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
13	1	snss 4741	. . . 4 ⊢ (𝐴 ∈ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ↔ {𝐴} ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)})
14	12, 13	mpbi 233	. . 3 ⊢ {𝐴} ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
15	9, 14	unssi 4189	. 2 ⊢ ((TC‘𝐴) ∪ {𝐴}) ⊆ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
16	1	snid 4619	. . . . 5 ⊢ 𝐴 ∈ {𝐴}
17		elun2 4181	. . . . 5 ⊢ (𝐴 ∈ {𝐴} → 𝐴 ∈ ((TC‘𝐴) ∪ {𝐴}))
18	16, 17	ax-mp 5	. . . 4 ⊢ 𝐴 ∈ ((TC‘𝐴) ∪ {𝐴})
19		uniun 4889	. . . . . . 7 ⊢ ∪ ((TC‘𝐴) ∪ {𝐴}) = (∪ (TC‘𝐴) ∪ ∪ {𝐴})
20		tctr 9742	. . . . . . . . 9 ⊢ Tr (TC‘𝐴)
21		df-tr 5212	. . . . . . . . 9 ⊢ (Tr (TC‘𝐴) ↔ ∪ (TC‘𝐴) ⊆ (TC‘𝐴))
22	20, 21	mpbi 233	. . . . . . . 8 ⊢ ∪ (TC‘𝐴) ⊆ (TC‘𝐴)
23	1	unisn 4885	. . . . . . . . 9 ⊢ ∪ {𝐴} = 𝐴
24		tcid 9741	. . . . . . . . . 10 ⊢ (𝐴 ∈ V → 𝐴 ⊆ (TC‘𝐴))
25	1, 24	ax-mp 5	. . . . . . . . 9 ⊢ 𝐴 ⊆ (TC‘𝐴)
26	23, 25	eqsstri 3954	. . . . . . . 8 ⊢ ∪ {𝐴} ⊆ (TC‘𝐴)
27	22, 26	unssi 4189	. . . . . . 7 ⊢ (∪ (TC‘𝐴) ∪ ∪ {𝐴}) ⊆ (TC‘𝐴)
28	19, 27	eqsstri 3954	. . . . . 6 ⊢ ∪ ((TC‘𝐴) ∪ {𝐴}) ⊆ (TC‘𝐴)
29		ssun1 4176	. . . . . 6 ⊢ (TC‘𝐴) ⊆ ((TC‘𝐴) ∪ {𝐴})
30	28, 29	sstri 3917	. . . . 5 ⊢ ∪ ((TC‘𝐴) ∪ {𝐴}) ⊆ ((TC‘𝐴) ∪ {𝐴})
31		df-tr 5212	. . . . 5 ⊢ (Tr ((TC‘𝐴) ∪ {𝐴}) ↔ ∪ ((TC‘𝐴) ∪ {𝐴}) ⊆ ((TC‘𝐴) ∪ {𝐴}))
32	30, 31	mpbir 234	. . . 4 ⊢ Tr ((TC‘𝐴) ∪ {𝐴})
33		fvex 6898	. . . . . 6 ⊢ (TC‘𝐴) ∈ V
34		snex 5396	. . . . . 6 ⊢ {𝐴} ∈ V
35	33, 34	unex 7761	. . . . 5 ⊢ ((TC‘𝐴) ∪ {𝐴}) ∈ V
36		eleq2 2849	. . . . . 6 ⊢ (𝑥 = ((TC‘𝐴) ∪ {𝐴}) → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ ((TC‘𝐴) ∪ {𝐴})))
37		treq 5218	. . . . . 6 ⊢ (𝑥 = ((TC‘𝐴) ∪ {𝐴}) → (Tr 𝑥 ↔ Tr ((TC‘𝐴) ∪ {𝐴})))
38	36, 37	anbi12d 644	. . . . 5 ⊢ (𝑥 = ((TC‘𝐴) ∪ {𝐴}) → ((𝐴 ∈ 𝑥 ∧ Tr 𝑥) ↔ (𝐴 ∈ ((TC‘𝐴) ∪ {𝐴}) ∧ Tr ((TC‘𝐴) ∪ {𝐴}))))
39	35, 38	elab 3632	. . . 4 ⊢ (((TC‘𝐴) ∪ {𝐴}) ∈ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ↔ (𝐴 ∈ ((TC‘𝐴) ∪ {𝐴}) ∧ Tr ((TC‘𝐴) ∪ {𝐴})))
40	18, 32, 39	mpbir2an 724	. . 3 ⊢ ((TC‘𝐴) ∪ {𝐴}) ∈ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}
41		intss1 4922	. . 3 ⊢ (((TC‘𝐴) ∪ {𝐴}) ∈ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} → ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ⊆ ((TC‘𝐴) ∪ {𝐴}))
42	40, 41	ax-mp 5	. 2 ⊢ ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)} ⊆ ((TC‘𝐴) ∪ {𝐴})
43	15, 42	eqssi 3924	1 ⊢ ((TC‘𝐴) ∪ {𝐴}) = ∩ {𝑥 ∣ (𝐴 ∈ 𝑥 ∧ Tr 𝑥)}

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738  Vcvv 3450   ⊆ wss 3895   ∪ cun 4149  {csn 4584  ∪ cuni 4866  ∩ cint 4906  Tr wtr 5211  ‘cfv 6538  TCctc 9738

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751  ax-inf2 9645

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  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 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-om 7878  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-tc 9739

This theorem is used by:  tcsni  9745