dftrpred3g - Metamath Proof Explorer

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

Theorem dftrpred3g 9412

Description: The transitive predecessors of 𝑋 are equal to the predecessors of 𝑋 together with their transitive predecessors. (Contributed by Scott Fenton, 26-Apr-2012.) (Revised by Mario Carneiro, 26-Jun-2015.)

**Assertion**
Ref	Expression
dftrpred3g	⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → TrPred(𝑅, 𝐴, 𝑋) = (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)))

Distinct variable groups: 𝑦,𝐴 𝑦,𝑅 𝑦,𝑋

Proof of Theorem dftrpred3g Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elun 4079	. . . . . 6 ⊢ (𝑧 ∈ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)) ↔ (𝑧 ∈ Pred(𝑅, 𝐴, 𝑋) ∨ 𝑧 ∈ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)))
2		predel 6212	. . . . . . . . . . 11 ⊢ (𝑧 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑧 ∈ 𝐴)
3		setlikespec 6217	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → Pred(𝑅, 𝐴, 𝑧) ∈ V)
4		trpredpred 9406	. . . . . . . . . . . . . 14 ⊢ (Pred(𝑅, 𝐴, 𝑧) ∈ V → Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑧))
5	3, 4	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑧))
6	5	expcom 413	. . . . . . . . . . . 12 ⊢ (𝑅 Se 𝐴 → (𝑧 ∈ 𝐴 → Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑧)))
7	6	adantl 481	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑧 ∈ 𝐴 → Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑧)))
8	2, 7	syl5 34	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑧 ∈ Pred(𝑅, 𝐴, 𝑋) → Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑧)))
9	8	ancld 550	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑧 ∈ Pred(𝑅, 𝐴, 𝑋) → (𝑧 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑧))))
10		trpredeq3 9400	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑧 → TrPred(𝑅, 𝐴, 𝑦) = TrPred(𝑅, 𝐴, 𝑧))
11	10	sseq2d 3949	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑦) ↔ Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑧)))
12	11	rspcev 3552	. . . . . . . . . 10 ⊢ ((𝑧 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑧)) → ∃𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑦))
13		ssiun 4972	. . . . . . . . . 10 ⊢ (∃𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑦) → Pred(𝑅, 𝐴, 𝑧) ⊆ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦))
14	12, 13	syl 17	. . . . . . . . 9 ⊢ ((𝑧 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑧)) → Pred(𝑅, 𝐴, 𝑧) ⊆ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦))
15	9, 14	syl6 35	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑧 ∈ Pred(𝑅, 𝐴, 𝑋) → Pred(𝑅, 𝐴, 𝑧) ⊆ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)))
16		eliun 4925	. . . . . . . . 9 ⊢ (𝑧 ∈ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦) ↔ ∃𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)𝑧 ∈ TrPred(𝑅, 𝐴, 𝑦))
17		predel 6212	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑦 ∈ 𝐴)
18		setlikespec 6217	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → Pred(𝑅, 𝐴, 𝑦) ∈ V)
19	18	ancoms 458	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑅 Se 𝐴 ∧ 𝑦 ∈ 𝐴) → Pred(𝑅, 𝐴, 𝑦) ∈ V)
20	19	adantll 710	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) → Pred(𝑅, 𝐴, 𝑦) ∈ V)
21		trpredss 9407	. . . . . . . . . . . . . . . . . . 19 ⊢ (Pred(𝑅, 𝐴, 𝑦) ∈ V → TrPred(𝑅, 𝐴, 𝑦) ⊆ 𝐴)
22	20, 21	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) → TrPred(𝑅, 𝐴, 𝑦) ⊆ 𝐴)
23	22	sseld 3916	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) → (𝑧 ∈ TrPred(𝑅, 𝐴, 𝑦) → 𝑧 ∈ 𝐴))
24	3	expcom 413	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑅 Se 𝐴 → (𝑧 ∈ 𝐴 → Pred(𝑅, 𝐴, 𝑧) ∈ V))
25	24	ad2antlr 723	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) → (𝑧 ∈ 𝐴 → Pred(𝑅, 𝐴, 𝑧) ∈ V))
26	23, 25	syld 47	. . . . . . . . . . . . . . . 16 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) → (𝑧 ∈ TrPred(𝑅, 𝐴, 𝑦) → Pred(𝑅, 𝐴, 𝑧) ∈ V))
27	26	imp 406	. . . . . . . . . . . . . . 15 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) ∧ 𝑧 ∈ TrPred(𝑅, 𝐴, 𝑦)) → Pred(𝑅, 𝐴, 𝑧) ∈ V)
28	27, 4	syl 17	. . . . . . . . . . . . . 14 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) ∧ 𝑧 ∈ TrPred(𝑅, 𝐴, 𝑦)) → Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑧))
29		simpr 484	. . . . . . . . . . . . . . . 16 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ 𝐴)
30		simplr 765	. . . . . . . . . . . . . . . 16 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) → 𝑅 Se 𝐴)
31		trpredelss 9411	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑧 ∈ TrPred(𝑅, 𝐴, 𝑦) → TrPred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑦)))
32	29, 30, 31	syl2anc 583	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) → (𝑧 ∈ TrPred(𝑅, 𝐴, 𝑦) → TrPred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑦)))
33	32	imp 406	. . . . . . . . . . . . . 14 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) ∧ 𝑧 ∈ TrPred(𝑅, 𝐴, 𝑦)) → TrPred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑦))
34	28, 33	sstrd 3927	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) ∧ 𝑧 ∈ TrPred(𝑅, 𝐴, 𝑦)) → Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑦))
35	34	exp31 419	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑦 ∈ 𝐴 → (𝑧 ∈ TrPred(𝑅, 𝐴, 𝑦) → Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑦))))
36	17, 35	syl5 34	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑦 ∈ Pred(𝑅, 𝐴, 𝑋) → (𝑧 ∈ TrPred(𝑅, 𝐴, 𝑦) → Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑦))))
37	36	reximdvai 3199	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (∃𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)𝑧 ∈ TrPred(𝑅, 𝐴, 𝑦) → ∃𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)Pred(𝑅, 𝐴, 𝑧) ⊆ TrPred(𝑅, 𝐴, 𝑦)))
38	37, 13	syl6 35	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (∃𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)𝑧 ∈ TrPred(𝑅, 𝐴, 𝑦) → Pred(𝑅, 𝐴, 𝑧) ⊆ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)))
39	16, 38	syl5bi 241	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑧 ∈ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦) → Pred(𝑅, 𝐴, 𝑧) ⊆ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)))
40	15, 39	jaod 855	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → ((𝑧 ∈ Pred(𝑅, 𝐴, 𝑋) ∨ 𝑧 ∈ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)) → Pred(𝑅, 𝐴, 𝑧) ⊆ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)))
41		ssun4 4105	. . . . . . 7 ⊢ (Pred(𝑅, 𝐴, 𝑧) ⊆ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦) → Pred(𝑅, 𝐴, 𝑧) ⊆ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)))
42	40, 41	syl6 35	. . . . . 6 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → ((𝑧 ∈ Pred(𝑅, 𝐴, 𝑋) ∨ 𝑧 ∈ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)) → Pred(𝑅, 𝐴, 𝑧) ⊆ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦))))
43	1, 42	syl5bi 241	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑧 ∈ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)) → Pred(𝑅, 𝐴, 𝑧) ⊆ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦))))
44	43	ralrimiv 3106	. . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑧 ∈ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦))Pred(𝑅, 𝐴, 𝑧) ⊆ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)))
45		ssun1 4102	. . . 4 ⊢ Pred(𝑅, 𝐴, 𝑋) ⊆ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦))
46	44, 45	jctir 520	. . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (∀𝑧 ∈ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦))Pred(𝑅, 𝐴, 𝑧) ⊆ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)) ∧ Pred(𝑅, 𝐴, 𝑋) ⊆ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦))))
47		trpredmintr 9409	. . 3 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) ∧ (∀𝑧 ∈ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦))Pred(𝑅, 𝐴, 𝑧) ⊆ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)) ∧ Pred(𝑅, 𝐴, 𝑋) ⊆ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)))) → TrPred(𝑅, 𝐴, 𝑋) ⊆ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)))
48	46, 47	mpdan 683	. 2 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → TrPred(𝑅, 𝐴, 𝑋) ⊆ (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)))
49		setlikespec 6217	. . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → Pred(𝑅, 𝐴, 𝑋) ∈ V)
50		trpredpred 9406	. . . 4 ⊢ (Pred(𝑅, 𝐴, 𝑋) ∈ V → Pred(𝑅, 𝐴, 𝑋) ⊆ TrPred(𝑅, 𝐴, 𝑋))
51	49, 50	syl 17	. . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → Pred(𝑅, 𝐴, 𝑋) ⊆ TrPred(𝑅, 𝐴, 𝑋))
52	51	sseld 3916	. . . . . 6 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑦 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑦 ∈ TrPred(𝑅, 𝐴, 𝑋)))
53		trpredelss 9411	. . . . . 6 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑦 ∈ TrPred(𝑅, 𝐴, 𝑋) → TrPred(𝑅, 𝐴, 𝑦) ⊆ TrPred(𝑅, 𝐴, 𝑋)))
54	52, 53	syld 47	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (𝑦 ∈ Pred(𝑅, 𝐴, 𝑋) → TrPred(𝑅, 𝐴, 𝑦) ⊆ TrPred(𝑅, 𝐴, 𝑋)))
55	54	ralrimiv 3106	. . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦) ⊆ TrPred(𝑅, 𝐴, 𝑋))
56		iunss 4971	. . . 4 ⊢ (∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦) ⊆ TrPred(𝑅, 𝐴, 𝑋) ↔ ∀𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦) ⊆ TrPred(𝑅, 𝐴, 𝑋))
57	55, 56	sylibr 233	. . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦) ⊆ TrPred(𝑅, 𝐴, 𝑋))
58	51, 57	unssd 4116	. 2 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)) ⊆ TrPred(𝑅, 𝐴, 𝑋))
59	48, 58	eqssd 3934	1 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → TrPred(𝑅, 𝐴, 𝑋) = (Pred(𝑅, 𝐴, 𝑋) ∪ ∪ 𝑦 ∈ Pred (𝑅, 𝐴, 𝑋)TrPred(𝑅, 𝐴, 𝑦)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∨ wo 843 = wceq 1539 ∈ wcel 2108 ∀wral 3063 ∃wrex 3064 Vcvv 3422 ∪ cun 3881 ⊆ wss 3883 ∪ ciun 4921 Se wse 5533 Predcpred 6190 TrPredctrpred 9395

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-se 5536 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-trpred 9396

This theorem is referenced by: dftrpred4g 9413

W3C validator