Theorem tcmin 9631

Description: Defining property of the transitive closure function: it is a subset of any transitive class containing 𝐴. (Contributed by Mario Carneiro, 23-Jun-2013.)

Assertion

Ref	Expression
tcmin	⊢ (𝐴 ∈ 𝑉 → ((𝐴 ⊆ 𝐵 ∧ Tr 𝐵) → (TC‘𝐴) ⊆ 𝐵))

Proof of Theorem tcmin

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		tcvalg 9628	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (TC‘𝐴) = ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)})
2		fvex 6835	. . . . 5 ⊢ (TC‘𝐴) ∈ V
3	1, 2	eqeltrrdi 2840	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} ∈ V)
4		intexab 5284	. . . 4 ⊢ (∃𝑥(𝐴 ⊆ 𝑥 ∧ Tr 𝑥) ↔ ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} ∈ V)
5	3, 4	sylibr 234	. . 3 ⊢ (𝐴 ∈ 𝑉 → ∃𝑥(𝐴 ⊆ 𝑥 ∧ Tr 𝑥))
6		ssin 4189	. . . . . . . . 9 ⊢ ((𝐴 ⊆ 𝑥 ∧ 𝐴 ⊆ 𝐵) ↔ 𝐴 ⊆ (𝑥 ∩ 𝐵))
7	6	biimpi 216	. . . . . . . 8 ⊢ ((𝐴 ⊆ 𝑥 ∧ 𝐴 ⊆ 𝐵) → 𝐴 ⊆ (𝑥 ∩ 𝐵))
8		trin 5209	. . . . . . . 8 ⊢ ((Tr 𝑥 ∧ Tr 𝐵) → Tr (𝑥 ∩ 𝐵))
9	7, 8	anim12i 613	. . . . . . 7 ⊢ (((𝐴 ⊆ 𝑥 ∧ 𝐴 ⊆ 𝐵) ∧ (Tr 𝑥 ∧ Tr 𝐵)) → (𝐴 ⊆ (𝑥 ∩ 𝐵) ∧ Tr (𝑥 ∩ 𝐵)))
10	9	an4s 660	. . . . . 6 ⊢ (((𝐴 ⊆ 𝑥 ∧ Tr 𝑥) ∧ (𝐴 ⊆ 𝐵 ∧ Tr 𝐵)) → (𝐴 ⊆ (𝑥 ∩ 𝐵) ∧ Tr (𝑥 ∩ 𝐵)))
11	10	expcom 413	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ Tr 𝐵) → ((𝐴 ⊆ 𝑥 ∧ Tr 𝑥) → (𝐴 ⊆ (𝑥 ∩ 𝐵) ∧ Tr (𝑥 ∩ 𝐵))))
12		vex 3440	. . . . . . . . 9 ⊢ 𝑥 ∈ V
13	12	inex1 5255	. . . . . . . 8 ⊢ (𝑥 ∩ 𝐵) ∈ V
14		sseq2 3961	. . . . . . . . 9 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → (𝐴 ⊆ 𝑦 ↔ 𝐴 ⊆ (𝑥 ∩ 𝐵)))
15		treq 5205	. . . . . . . . 9 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → (Tr 𝑦 ↔ Tr (𝑥 ∩ 𝐵)))
16	14, 15	anbi12d 632	. . . . . . . 8 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → ((𝐴 ⊆ 𝑦 ∧ Tr 𝑦) ↔ (𝐴 ⊆ (𝑥 ∩ 𝐵) ∧ Tr (𝑥 ∩ 𝐵))))
17	13, 16	elab 3635	. . . . . . 7 ⊢ ((𝑥 ∩ 𝐵) ∈ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ↔ (𝐴 ⊆ (𝑥 ∩ 𝐵) ∧ Tr (𝑥 ∩ 𝐵)))
18		intss1 4913	. . . . . . 7 ⊢ ((𝑥 ∩ 𝐵) ∈ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} → ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ⊆ (𝑥 ∩ 𝐵))
19	17, 18	sylbir 235	. . . . . 6 ⊢ ((𝐴 ⊆ (𝑥 ∩ 𝐵) ∧ Tr (𝑥 ∩ 𝐵)) → ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ⊆ (𝑥 ∩ 𝐵))
20		inss2 4188	. . . . . 6 ⊢ (𝑥 ∩ 𝐵) ⊆ 𝐵
21	19, 20	sstrdi 3947	. . . . 5 ⊢ ((𝐴 ⊆ (𝑥 ∩ 𝐵) ∧ Tr (𝑥 ∩ 𝐵)) → ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ⊆ 𝐵)
22	11, 21	syl6 35	. . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ Tr 𝐵) → ((𝐴 ⊆ 𝑥 ∧ Tr 𝑥) → ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ⊆ 𝐵))
23	22	exlimdv 1934	. . 3 ⊢ ((𝐴 ⊆ 𝐵 ∧ Tr 𝐵) → (∃𝑥(𝐴 ⊆ 𝑥 ∧ Tr 𝑥) → ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ⊆ 𝐵))
24	5, 23	syl5com 31	. 2 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ⊆ 𝐵 ∧ Tr 𝐵) → ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ⊆ 𝐵))
25		tcvalg 9628	. . 3 ⊢ (𝐴 ∈ 𝑉 → (TC‘𝐴) = ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)})
26	25	sseq1d 3966	. 2 ⊢ (𝐴 ∈ 𝑉 → ((TC‘𝐴) ⊆ 𝐵 ↔ ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ⊆ 𝐵))
27	24, 26	sylibrd 259	1 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ⊆ 𝐵 ∧ Tr 𝐵) → (TC‘𝐴) ⊆ 𝐵))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541  ∃wex 1780   ∈ wcel 2111  {cab 2709  Vcvv 3436   ∩ cin 3901   ⊆ wss 3902  ∩ cint 4897  Tr wtr 5198  ‘cfv 6481  TCctc 9626

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pr 5370  ax-un 7668  ax-inf2 9531

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-int 4898  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-tr 5199  df-id 5511  df-eprel 5516  df-po 5524  df-so 5525  df-fr 5569  df-we 5571  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-pred 6248  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-om 7797  df-2nd 7922  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-rdg 8329  df-tc 9627

This theorem is referenced by:  tcidm  9636  tc0  9637  tcwf  9773  itunitc  10309  grur1  10708