trcl - Metamath Proof Explorer

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

Theorem trcl 9759

Description: For any set 𝐴, show the properties of its transitive closure 𝐶. Similar to Theorem 9.1 of [TakeutiZaring] p. 73 except that we show an explicit expression for the transitive closure rather than just its existence. See tz9.1 9760 for an abbreviated version showing existence. (Contributed by NM, 14-Sep-2003.) (Revised by Mario Carneiro, 11-Sep-2015.)

**Hypotheses**
Ref	Expression
trcl.1	⊢ 𝐴 ∈ V
trcl.2	⊢ 𝐹 = (rec((𝑧 ∈ V ↦ (𝑧 ∪ ∪ 𝑧)), 𝐴) ↾ ω)
trcl.3	⊢ 𝐶 = ∪ 𝑦 ∈ ω (𝐹‘𝑦)

**Assertion**
Ref	Expression
trcl	⊢ (𝐴 ⊆ 𝐶 ∧ Tr 𝐶 ∧ ∀𝑥((𝐴 ⊆ 𝑥 ∧ Tr 𝑥) → 𝐶 ⊆ 𝑥))

Distinct variable groups: 𝑥,𝑧 𝑥,𝑦,𝐴 𝑥,𝐹,𝑦 Allowed substitution hints: 𝐴(𝑧) 𝐶(𝑥,𝑦,𝑧) 𝐹(𝑧)

Proof of Theorem trcl Dummy variables 𝑣 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		peano1 7904	. . . . 5 ⊢ ∅ ∈ ω
2		trcl.2	. . . . . . . 8 ⊢ 𝐹 = (rec((𝑧 ∈ V ↦ (𝑧 ∪ ∪ 𝑧)), 𝐴) ↾ ω)
3	2	fveq1i 6902	. . . . . . 7 ⊢ (𝐹‘∅) = ((rec((𝑧 ∈ V ↦ (𝑧 ∪ ∪ 𝑧)), 𝐴) ↾ ω)‘∅)
4		trcl.1	. . . . . . . 8 ⊢ 𝐴 ∈ V
5		fr0g 8469	. . . . . . . 8 ⊢ (𝐴 ∈ V → ((rec((𝑧 ∈ V ↦ (𝑧 ∪ ∪ 𝑧)), 𝐴) ↾ ω)‘∅) = 𝐴)
6	4, 5	ax-mp 5	. . . . . . 7 ⊢ ((rec((𝑧 ∈ V ↦ (𝑧 ∪ ∪ 𝑧)), 𝐴) ↾ ω)‘∅) = 𝐴
7	3, 6	eqtr2i 2762	. . . . . 6 ⊢ 𝐴 = (𝐹‘∅)
8	7	eqimssi 4056	. . . . 5 ⊢ 𝐴 ⊆ (𝐹‘∅)
9		fveq2 6901	. . . . . . 7 ⊢ (𝑦 = ∅ → (𝐹‘𝑦) = (𝐹‘∅))
10	9	sseq2d 4028	. . . . . 6 ⊢ (𝑦 = ∅ → (𝐴 ⊆ (𝐹‘𝑦) ↔ 𝐴 ⊆ (𝐹‘∅)))
11	10	rspcev 3622	. . . . 5 ⊢ ((∅ ∈ ω ∧ 𝐴 ⊆ (𝐹‘∅)) → ∃𝑦 ∈ ω 𝐴 ⊆ (𝐹‘𝑦))
12	1, 8, 11	mp2an 691	. . . 4 ⊢ ∃𝑦 ∈ ω 𝐴 ⊆ (𝐹‘𝑦)
13		ssiun 5052	. . . 4 ⊢ (∃𝑦 ∈ ω 𝐴 ⊆ (𝐹‘𝑦) → 𝐴 ⊆ ∪ 𝑦 ∈ ω (𝐹‘𝑦))
14	12, 13	ax-mp 5	. . 3 ⊢ 𝐴 ⊆ ∪ 𝑦 ∈ ω (𝐹‘𝑦)
15		trcl.3	. . 3 ⊢ 𝐶 = ∪ 𝑦 ∈ ω (𝐹‘𝑦)
16	14, 15	sseqtrri 4033	. 2 ⊢ 𝐴 ⊆ 𝐶
17		dftr2 5268	. . . 4 ⊢ (Tr ∪ 𝑦 ∈ ω (𝐹‘𝑦) ↔ ∀𝑣∀𝑢((𝑣 ∈ 𝑢 ∧ 𝑢 ∈ ∪ 𝑦 ∈ ω (𝐹‘𝑦)) → 𝑣 ∈ ∪ 𝑦 ∈ ω (𝐹‘𝑦)))
18		eliun 5002	. . . . . . . . 9 ⊢ (𝑢 ∈ ∪ 𝑦 ∈ ω (𝐹‘𝑦) ↔ ∃𝑦 ∈ ω 𝑢 ∈ (𝐹‘𝑦))
19	18	anbi2i 622	. . . . . . . 8 ⊢ ((𝑣 ∈ 𝑢 ∧ 𝑢 ∈ ∪ 𝑦 ∈ ω (𝐹‘𝑦)) ↔ (𝑣 ∈ 𝑢 ∧ ∃𝑦 ∈ ω 𝑢 ∈ (𝐹‘𝑦)))
20		r19.42v 3187	. . . . . . . 8 ⊢ (∃𝑦 ∈ ω (𝑣 ∈ 𝑢 ∧ 𝑢 ∈ (𝐹‘𝑦)) ↔ (𝑣 ∈ 𝑢 ∧ ∃𝑦 ∈ ω 𝑢 ∈ (𝐹‘𝑦)))
21	19, 20	bitr4i 278	. . . . . . 7 ⊢ ((𝑣 ∈ 𝑢 ∧ 𝑢 ∈ ∪ 𝑦 ∈ ω (𝐹‘𝑦)) ↔ ∃𝑦 ∈ ω (𝑣 ∈ 𝑢 ∧ 𝑢 ∈ (𝐹‘𝑦)))
22		elunii 4919	. . . . . . . . 9 ⊢ ((𝑣 ∈ 𝑢 ∧ 𝑢 ∈ (𝐹‘𝑦)) → 𝑣 ∈ ∪ (𝐹‘𝑦))
23		ssun2 4189	. . . . . . . . . . 11 ⊢ ∪ (𝐹‘𝑦) ⊆ ((𝐹‘𝑦) ∪ ∪ (𝐹‘𝑦))
24		fvex 6914	. . . . . . . . . . . . 13 ⊢ (𝐹‘𝑦) ∈ V
25	24	uniex 7753	. . . . . . . . . . . . 13 ⊢ ∪ (𝐹‘𝑦) ∈ V
26	24, 25	unex 7756	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑦) ∪ ∪ (𝐹‘𝑦)) ∈ V
27		id 22	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑧 → 𝑥 = 𝑧)
28		unieq 4925	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑧 → ∪ 𝑥 = ∪ 𝑧)
29	27, 28	uneq12d 4179	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑧 → (𝑥 ∪ ∪ 𝑥) = (𝑧 ∪ ∪ 𝑧))
30		id 22	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (𝐹‘𝑦) → 𝑥 = (𝐹‘𝑦))
31		unieq 4925	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (𝐹‘𝑦) → ∪ 𝑥 = ∪ (𝐹‘𝑦))
32	30, 31	uneq12d 4179	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝐹‘𝑦) → (𝑥 ∪ ∪ 𝑥) = ((𝐹‘𝑦) ∪ ∪ (𝐹‘𝑦)))
33	2, 29, 32	frsucmpt2 8473	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ ω ∧ ((𝐹‘𝑦) ∪ ∪ (𝐹‘𝑦)) ∈ V) → (𝐹‘suc 𝑦) = ((𝐹‘𝑦) ∪ ∪ (𝐹‘𝑦)))
34	26, 33	mpan2 690	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ω → (𝐹‘suc 𝑦) = ((𝐹‘𝑦) ∪ ∪ (𝐹‘𝑦)))
35	23, 34	sseqtrrid 4049	. . . . . . . . . 10 ⊢ (𝑦 ∈ ω → ∪ (𝐹‘𝑦) ⊆ (𝐹‘suc 𝑦))
36	35	sseld 3994	. . . . . . . . 9 ⊢ (𝑦 ∈ ω → (𝑣 ∈ ∪ (𝐹‘𝑦) → 𝑣 ∈ (𝐹‘suc 𝑦)))
37	22, 36	syl5 34	. . . . . . . 8 ⊢ (𝑦 ∈ ω → ((𝑣 ∈ 𝑢 ∧ 𝑢 ∈ (𝐹‘𝑦)) → 𝑣 ∈ (𝐹‘suc 𝑦)))
38	37	reximia 3077	. . . . . . 7 ⊢ (∃𝑦 ∈ ω (𝑣 ∈ 𝑢 ∧ 𝑢 ∈ (𝐹‘𝑦)) → ∃𝑦 ∈ ω 𝑣 ∈ (𝐹‘suc 𝑦))
39	21, 38	sylbi 217	. . . . . 6 ⊢ ((𝑣 ∈ 𝑢 ∧ 𝑢 ∈ ∪ 𝑦 ∈ ω (𝐹‘𝑦)) → ∃𝑦 ∈ ω 𝑣 ∈ (𝐹‘suc 𝑦))
40		peano2 7906	. . . . . . . . . 10 ⊢ (𝑦 ∈ ω → suc 𝑦 ∈ ω)
41		fveq2 6901	. . . . . . . . . . . . 13 ⊢ (𝑢 = suc 𝑦 → (𝐹‘𝑢) = (𝐹‘suc 𝑦))
42	41	eleq2d 2823	. . . . . . . . . . . 12 ⊢ (𝑢 = suc 𝑦 → (𝑣 ∈ (𝐹‘𝑢) ↔ 𝑣 ∈ (𝐹‘suc 𝑦)))
43	42	rspcev 3622	. . . . . . . . . . 11 ⊢ ((suc 𝑦 ∈ ω ∧ 𝑣 ∈ (𝐹‘suc 𝑦)) → ∃𝑢 ∈ ω 𝑣 ∈ (𝐹‘𝑢))
44	43	ex 412	. . . . . . . . . 10 ⊢ (suc 𝑦 ∈ ω → (𝑣 ∈ (𝐹‘suc 𝑦) → ∃𝑢 ∈ ω 𝑣 ∈ (𝐹‘𝑢)))
45	40, 44	syl 17	. . . . . . . . 9 ⊢ (𝑦 ∈ ω → (𝑣 ∈ (𝐹‘suc 𝑦) → ∃𝑢 ∈ ω 𝑣 ∈ (𝐹‘𝑢)))
46	45	rexlimiv 3144	. . . . . . . 8 ⊢ (∃𝑦 ∈ ω 𝑣 ∈ (𝐹‘suc 𝑦) → ∃𝑢 ∈ ω 𝑣 ∈ (𝐹‘𝑢))
47		fveq2 6901	. . . . . . . . . 10 ⊢ (𝑦 = 𝑢 → (𝐹‘𝑦) = (𝐹‘𝑢))
48	47	eleq2d 2823	. . . . . . . . 9 ⊢ (𝑦 = 𝑢 → (𝑣 ∈ (𝐹‘𝑦) ↔ 𝑣 ∈ (𝐹‘𝑢)))
49	48	cbvrexvw 3234	. . . . . . . 8 ⊢ (∃𝑦 ∈ ω 𝑣 ∈ (𝐹‘𝑦) ↔ ∃𝑢 ∈ ω 𝑣 ∈ (𝐹‘𝑢))
50	46, 49	sylibr 234	. . . . . . 7 ⊢ (∃𝑦 ∈ ω 𝑣 ∈ (𝐹‘suc 𝑦) → ∃𝑦 ∈ ω 𝑣 ∈ (𝐹‘𝑦))
51		eliun 5002	. . . . . . 7 ⊢ (𝑣 ∈ ∪ 𝑦 ∈ ω (𝐹‘𝑦) ↔ ∃𝑦 ∈ ω 𝑣 ∈ (𝐹‘𝑦))
52	50, 51	sylibr 234	. . . . . 6 ⊢ (∃𝑦 ∈ ω 𝑣 ∈ (𝐹‘suc 𝑦) → 𝑣 ∈ ∪ 𝑦 ∈ ω (𝐹‘𝑦))
53	39, 52	syl 17	. . . . 5 ⊢ ((𝑣 ∈ 𝑢 ∧ 𝑢 ∈ ∪ 𝑦 ∈ ω (𝐹‘𝑦)) → 𝑣 ∈ ∪ 𝑦 ∈ ω (𝐹‘𝑦))
54	53	ax-gen 1790	. . . 4 ⊢ ∀𝑢((𝑣 ∈ 𝑢 ∧ 𝑢 ∈ ∪ 𝑦 ∈ ω (𝐹‘𝑦)) → 𝑣 ∈ ∪ 𝑦 ∈ ω (𝐹‘𝑦))
55	17, 54	mpgbir 1794	. . 3 ⊢ Tr ∪ 𝑦 ∈ ω (𝐹‘𝑦)
56		treq 5274	. . . 4 ⊢ (𝐶 = ∪ 𝑦 ∈ ω (𝐹‘𝑦) → (Tr 𝐶 ↔ Tr ∪ 𝑦 ∈ ω (𝐹‘𝑦)))
57	15, 56	ax-mp 5	. . 3 ⊢ (Tr 𝐶 ↔ Tr ∪ 𝑦 ∈ ω (𝐹‘𝑦))
58	55, 57	mpbir 231	. 2 ⊢ Tr 𝐶
59		fveq2 6901	. . . . . . . 8 ⊢ (𝑣 = ∅ → (𝐹‘𝑣) = (𝐹‘∅))
60	59	sseq1d 4027	. . . . . . 7 ⊢ (𝑣 = ∅ → ((𝐹‘𝑣) ⊆ 𝑥 ↔ (𝐹‘∅) ⊆ 𝑥))
61		fveq2 6901	. . . . . . . 8 ⊢ (𝑣 = 𝑦 → (𝐹‘𝑣) = (𝐹‘𝑦))
62	61	sseq1d 4027	. . . . . . 7 ⊢ (𝑣 = 𝑦 → ((𝐹‘𝑣) ⊆ 𝑥 ↔ (𝐹‘𝑦) ⊆ 𝑥))
63		fveq2 6901	. . . . . . . 8 ⊢ (𝑣 = suc 𝑦 → (𝐹‘𝑣) = (𝐹‘suc 𝑦))
64	63	sseq1d 4027	. . . . . . 7 ⊢ (𝑣 = suc 𝑦 → ((𝐹‘𝑣) ⊆ 𝑥 ↔ (𝐹‘suc 𝑦) ⊆ 𝑥))
65	3, 6	eqtri 2761	. . . . . . . . . 10 ⊢ (𝐹‘∅) = 𝐴
66	65	sseq1i 4024	. . . . . . . . 9 ⊢ ((𝐹‘∅) ⊆ 𝑥 ↔ 𝐴 ⊆ 𝑥)
67	66	biimpri 228	. . . . . . . 8 ⊢ (𝐴 ⊆ 𝑥 → (𝐹‘∅) ⊆ 𝑥)
68	67	adantr 480	. . . . . . 7 ⊢ ((𝐴 ⊆ 𝑥 ∧ Tr 𝑥) → (𝐹‘∅) ⊆ 𝑥)
69		uniss 4922	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑦) ⊆ 𝑥 → ∪ (𝐹‘𝑦) ⊆ ∪ 𝑥)
70		df-tr 5267	. . . . . . . . . . . . . 14 ⊢ (Tr 𝑥 ↔ ∪ 𝑥 ⊆ 𝑥)
71		sstr2 4002	. . . . . . . . . . . . . 14 ⊢ (∪ (𝐹‘𝑦) ⊆ ∪ 𝑥 → (∪ 𝑥 ⊆ 𝑥 → ∪ (𝐹‘𝑦) ⊆ 𝑥))
72	70, 71	biimtrid 242	. . . . . . . . . . . . 13 ⊢ (∪ (𝐹‘𝑦) ⊆ ∪ 𝑥 → (Tr 𝑥 → ∪ (𝐹‘𝑦) ⊆ 𝑥))
73	69, 72	syl 17	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑦) ⊆ 𝑥 → (Tr 𝑥 → ∪ (𝐹‘𝑦) ⊆ 𝑥))
74	73	anc2li 555	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑦) ⊆ 𝑥 → (Tr 𝑥 → ((𝐹‘𝑦) ⊆ 𝑥 ∧ ∪ (𝐹‘𝑦) ⊆ 𝑥)))
75		unss 4200	. . . . . . . . . . 11 ⊢ (((𝐹‘𝑦) ⊆ 𝑥 ∧ ∪ (𝐹‘𝑦) ⊆ 𝑥) ↔ ((𝐹‘𝑦) ∪ ∪ (𝐹‘𝑦)) ⊆ 𝑥)
76	74, 75	imbitrdi 251	. . . . . . . . . 10 ⊢ ((𝐹‘𝑦) ⊆ 𝑥 → (Tr 𝑥 → ((𝐹‘𝑦) ∪ ∪ (𝐹‘𝑦)) ⊆ 𝑥))
77	34	sseq1d 4027	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ω → ((𝐹‘suc 𝑦) ⊆ 𝑥 ↔ ((𝐹‘𝑦) ∪ ∪ (𝐹‘𝑦)) ⊆ 𝑥))
78	77	biimprd 248	. . . . . . . . . 10 ⊢ (𝑦 ∈ ω → (((𝐹‘𝑦) ∪ ∪ (𝐹‘𝑦)) ⊆ 𝑥 → (𝐹‘suc 𝑦) ⊆ 𝑥))
79	76, 78	syl9r 78	. . . . . . . . 9 ⊢ (𝑦 ∈ ω → ((𝐹‘𝑦) ⊆ 𝑥 → (Tr 𝑥 → (𝐹‘suc 𝑦) ⊆ 𝑥)))
80	79	com23 86	. . . . . . . 8 ⊢ (𝑦 ∈ ω → (Tr 𝑥 → ((𝐹‘𝑦) ⊆ 𝑥 → (𝐹‘suc 𝑦) ⊆ 𝑥)))
81	80	adantld 490	. . . . . . 7 ⊢ (𝑦 ∈ ω → ((𝐴 ⊆ 𝑥 ∧ Tr 𝑥) → ((𝐹‘𝑦) ⊆ 𝑥 → (𝐹‘suc 𝑦) ⊆ 𝑥)))
82	60, 62, 64, 68, 81	finds2 7915	. . . . . 6 ⊢ (𝑣 ∈ ω → ((𝐴 ⊆ 𝑥 ∧ Tr 𝑥) → (𝐹‘𝑣) ⊆ 𝑥))
83	82	com12 32	. . . . 5 ⊢ ((𝐴 ⊆ 𝑥 ∧ Tr 𝑥) → (𝑣 ∈ ω → (𝐹‘𝑣) ⊆ 𝑥))
84	83	ralrimiv 3141	. . . 4 ⊢ ((𝐴 ⊆ 𝑥 ∧ Tr 𝑥) → ∀𝑣 ∈ ω (𝐹‘𝑣) ⊆ 𝑥)
85		fveq2 6901	. . . . . . . 8 ⊢ (𝑦 = 𝑣 → (𝐹‘𝑦) = (𝐹‘𝑣))
86	85	cbviunv 5046	. . . . . . 7 ⊢ ∪ 𝑦 ∈ ω (𝐹‘𝑦) = ∪ 𝑣 ∈ ω (𝐹‘𝑣)
87	15, 86	eqtri 2761	. . . . . 6 ⊢ 𝐶 = ∪ 𝑣 ∈ ω (𝐹‘𝑣)
88	87	sseq1i 4024	. . . . 5 ⊢ (𝐶 ⊆ 𝑥 ↔ ∪ 𝑣 ∈ ω (𝐹‘𝑣) ⊆ 𝑥)
89		iunss 5051	. . . . 5 ⊢ (∪ 𝑣 ∈ ω (𝐹‘𝑣) ⊆ 𝑥 ↔ ∀𝑣 ∈ ω (𝐹‘𝑣) ⊆ 𝑥)
90	88, 89	bitri 275	. . . 4 ⊢ (𝐶 ⊆ 𝑥 ↔ ∀𝑣 ∈ ω (𝐹‘𝑣) ⊆ 𝑥)
91	84, 90	sylibr 234	. . 3 ⊢ ((𝐴 ⊆ 𝑥 ∧ Tr 𝑥) → 𝐶 ⊆ 𝑥)
92	91	ax-gen 1790	. 2 ⊢ ∀𝑥((𝐴 ⊆ 𝑥 ∧ Tr 𝑥) → 𝐶 ⊆ 𝑥)
93	16, 58, 92	3pm3.2i 1337	1 ⊢ (𝐴 ⊆ 𝐶 ∧ Tr 𝐶 ∧ ∀𝑥((𝐴 ⊆ 𝑥 ∧ Tr 𝑥) → 𝐶 ⊆ 𝑥))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1085 ∀wal 1533 = wceq 1535 ∈ wcel 2104 ∀wral 3057 ∃wrex 3066 Vcvv 3477 ∪ cun 3961 ⊆ wss 3963 ∅c0 4339 ∪ cuni 4914 ∪ ciun 4998 ↦ cmpt 5232 Tr wtr 5266 ↾ cres 5685 suc csuc 6382 ‘cfv 6558 ωcom 7880 reccrdg 8442

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1963 ax-7 2003 ax-8 2106 ax-9 2114 ax-10 2137 ax-11 2153 ax-12 2173 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pr 5430 ax-un 7747

This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1538 df-fal 1548 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2536 df-eu 2565 df-clab 2711 df-cleq 2725 df-clel 2812 df-nfc 2888 df-ne 2937 df-ral 3058 df-rex 3067 df-reu 3377 df-rab 3433 df-v 3479 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4915 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5635 df-we 5637 df-xp 5689 df-rel 5690 df-cnv 5691 df-co 5692 df-dm 5693 df-rn 5694 df-res 5695 df-ima 5696 df-pred 6317 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6510 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-ov 7428 df-om 7881 df-2nd 8008 df-frecs 8299 df-wrecs 8330 df-recs 8404 df-rdg 8443

This theorem is referenced by: tz9.1 9760 tz9.1c 9761

W3C validator