Theorem tcmin 9701

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 9698	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (TC‘𝐴) = ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)})
2		fvex 6874	. . . . 5 ⊢ (TC‘𝐴) ∈ V
3	1, 2	eqeltrrdi 2838	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} ∈ V)
4		intexab 5304	. . . 4 ⊢ (∃𝑥(𝐴 ⊆ 𝑥 ∧ Tr 𝑥) ↔ ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ Tr 𝑥)} ∈ V)
5	3, 4	sylibr 234	. . 3 ⊢ (𝐴 ∈ 𝑉 → ∃𝑥(𝐴 ⊆ 𝑥 ∧ Tr 𝑥))
6		ssin 4205	. . . . . . . . 9 ⊢ ((𝐴 ⊆ 𝑥 ∧ 𝐴 ⊆ 𝐵) ↔ 𝐴 ⊆ (𝑥 ∩ 𝐵))
7	6	biimpi 216	. . . . . . . 8 ⊢ ((𝐴 ⊆ 𝑥 ∧ 𝐴 ⊆ 𝐵) → 𝐴 ⊆ (𝑥 ∩ 𝐵))
8		trin 5229	. . . . . . . 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 3454	. . . . . . . . 9 ⊢ 𝑥 ∈ V
13	12	inex1 5275	. . . . . . . 8 ⊢ (𝑥 ∩ 𝐵) ∈ V
14		sseq2 3976	. . . . . . . . 9 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → (𝐴 ⊆ 𝑦 ↔ 𝐴 ⊆ (𝑥 ∩ 𝐵)))
15		treq 5225	. . . . . . . . 9 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → (Tr 𝑦 ↔ Tr (𝑥 ∩ 𝐵)))
16	14, 15	anbi12d 632	. . . . . . . 8 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → ((𝐴 ⊆ 𝑦 ∧ Tr 𝑦) ↔ (𝐴 ⊆ (𝑥 ∩ 𝐵) ∧ Tr (𝑥 ∩ 𝐵))))
17	13, 16	elab 3649	. . . . . . 7 ⊢ ((𝑥 ∩ 𝐵) ∈ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ↔ (𝐴 ⊆ (𝑥 ∩ 𝐵) ∧ Tr (𝑥 ∩ 𝐵)))
18		intss1 4930	. . . . . . 7 ⊢ ((𝑥 ∩ 𝐵) ∈ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} → ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ⊆ (𝑥 ∩ 𝐵))
19	17, 18	sylbir 235	. . . . . 6 ⊢ ((𝐴 ⊆ (𝑥 ∩ 𝐵) ∧ Tr (𝑥 ∩ 𝐵)) → ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ⊆ (𝑥 ∩ 𝐵))
20		inss2 4204	. . . . . 6 ⊢ (𝑥 ∩ 𝐵) ⊆ 𝐵
21	19, 20	sstrdi 3962	. . . . 5 ⊢ ((𝐴 ⊆ (𝑥 ∩ 𝐵) ∧ Tr (𝑥 ∩ 𝐵)) → ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ⊆ 𝐵)
22	11, 21	syl6 35	. . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ Tr 𝐵) → ((𝐴 ⊆ 𝑥 ∧ Tr 𝑥) → ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ⊆ 𝐵))
23	22	exlimdv 1933	. . 3 ⊢ ((𝐴 ⊆ 𝐵 ∧ Tr 𝐵) → (∃𝑥(𝐴 ⊆ 𝑥 ∧ Tr 𝑥) → ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ⊆ 𝐵))
24	5, 23	syl5com 31	. 2 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ⊆ 𝐵 ∧ Tr 𝐵) → ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ⊆ 𝐵))
25		tcvalg 9698	. . 3 ⊢ (𝐴 ∈ 𝑉 → (TC‘𝐴) = ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)})
26	25	sseq1d 3981	. 2 ⊢ (𝐴 ∈ 𝑉 → ((TC‘𝐴) ⊆ 𝐵 ↔ ∩ {𝑦 ∣ (𝐴 ⊆ 𝑦 ∧ Tr 𝑦)} ⊆ 𝐵))
27	24, 26	sylibrd 259	1 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ⊆ 𝐵 ∧ Tr 𝐵) → (TC‘𝐴) ⊆ 𝐵))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2109  {cab 2708  Vcvv 3450   ∩ cin 3916   ⊆ wss 3917  ∩ cint 4913  Tr wtr 5217  ‘cfv 6514  TCctc 9696

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pr 5390  ax-un 7714  ax-inf2 9601

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-int 4914  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-ov 7393  df-om 7846  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8381  df-tc 9697

This theorem is referenced by:  tcidm  9706  tc0  9707  tcwf  9843  itunitc  10381  grur1  10780