Theorem bnj893 34559

Description: Property of trCl. Under certain conditions, the transitive closure of 𝑋 in 𝐴 by 𝑅 is a set. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Assertion

Ref	Expression
bnj893	⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) → trCl(𝑋, 𝐴, 𝑅) ∈ V)

Proof of Theorem bnj893

Dummy variables 𝑓 𝑔 𝑖 𝑛 𝑦 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		biid 261	. . 3 ⊢ ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
2		biid 261	. . 3 ⊢ (∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
3		eqid 2728	. . 3 ⊢ (ω ∖ {∅}) = (ω ∖ {∅})
4		eqid 2728	. . 3 ⊢ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))} = {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))}
5	1, 2, 3, 4	bnj882 34557	. 2 ⊢ trCl(𝑋, 𝐴, 𝑅) = ∪ 𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))}∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖)
6		vex 3475	. . . . . . . . . . 11 ⊢ 𝑔 ∈ V
7		fveq1 6896	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → (𝑓‘∅) = (𝑔‘∅))
8	7	eqeq1d 2730	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑔 → ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅)))
9	6, 8	sbcie 3820	. . . . . . . . . 10 ⊢ ([𝑔 / 𝑓](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅))
10	9	bicomi 223	. . . . . . . . 9 ⊢ ((𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ [𝑔 / 𝑓](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
11		fveq1 6896	. . . . . . . . . . . . . 14 ⊢ (𝑓 = 𝑔 → (𝑓‘suc 𝑖) = (𝑔‘suc 𝑖))
12		fveq1 6896	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = 𝑔 → (𝑓‘𝑖) = (𝑔‘𝑖))
13	12	iuneq1d 5023	. . . . . . . . . . . . . 14 ⊢ (𝑓 = 𝑔 → ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅))
14	11, 13	eqeq12d 2744	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝑔 → ((𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))
15	14	imbi2d 340	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → ((suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅))))
16	15	ralbidv 3174	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑔 → (∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅))))
17	6, 16	sbcie 3820	. . . . . . . . . 10 ⊢ ([𝑔 / 𝑓]∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))
18	17	bicomi 223	. . . . . . . . 9 ⊢ (∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ [𝑔 / 𝑓]∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
19	4, 10, 18	bnj873 34555	. . . . . . . 8 ⊢ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))} = {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))}
20	19	eleq2i 2821	. . . . . . 7 ⊢ (𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))} ↔ 𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))})
21	20	anbi1i 623	. . . . . 6 ⊢ ((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑤 ∈ ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖)) ↔ (𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑤 ∈ ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖)))
22	21	rexbii2 3087	. . . . 5 ⊢ (∃𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))}𝑤 ∈ ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ↔ ∃𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))}𝑤 ∈ ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖))
23	22	abbii 2798	. . . 4 ⊢ {𝑤 ∣ ∃𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))}𝑤 ∈ ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖)} = {𝑤 ∣ ∃𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))}𝑤 ∈ ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖)}
24		df-iun 4998	. . . 4 ⊢ ∪ 𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))}∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) = {𝑤 ∣ ∃𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))}𝑤 ∈ ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖)}
25		df-iun 4998	. . . 4 ⊢ ∪ 𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))}∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) = {𝑤 ∣ ∃𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))}𝑤 ∈ ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖)}
26	23, 24, 25	3eqtr4i 2766	. . 3 ⊢ ∪ 𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))}∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) = ∪ 𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))}∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖)
27		biid 261	. . . . 5 ⊢ ((𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅))
28		biid 261	. . . . 5 ⊢ (∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))
29		eqid 2728	. . . . 5 ⊢ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))} = {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))}
30		biid 261	. . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑛 ∈ (ω ∖ {∅})) ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑛 ∈ (ω ∖ {∅})))
31		biid 261	. . . . 5 ⊢ ((𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅))) ↔ (𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅))))
32		biid 261	. . . . 5 ⊢ ([𝑧 / 𝑔](𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ [𝑧 / 𝑔](𝑔‘∅) = pred(𝑋, 𝐴, 𝑅))
33		biid 261	. . . . 5 ⊢ ([𝑧 / 𝑔]∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ [𝑧 / 𝑔]∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))
34		biid 261	. . . . 5 ⊢ ([𝑧 / 𝑔](𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅))) ↔ [𝑧 / 𝑔](𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅))))
35		biid 261	. . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴))
36	27, 28, 3, 29, 30, 31, 32, 33, 34, 35	bnj849 34556	. . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) → {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))} ∈ V)
37		vex 3475	. . . . . . 7 ⊢ 𝑓 ∈ V
38	37	dmex 7917	. . . . . 6 ⊢ dom 𝑓 ∈ V
39		fvex 6910	. . . . . 6 ⊢ (𝑓‘𝑖) ∈ V
40	38, 39	iunex 7972	. . . . 5 ⊢ ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ∈ V
41	40	rgenw 3062	. . . 4 ⊢ ∀𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))}∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ∈ V
42		iunexg 7967	. . . 4 ⊢ (({𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))} ∈ V ∧ ∀𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))}∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ∈ V) → ∪ 𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))}∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ∈ V)
43	36, 41, 42	sylancl 585	. . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) → ∪ 𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑔‘suc 𝑖) = ∪ 𝑦 ∈ (𝑔‘𝑖) pred(𝑦, 𝐴, 𝑅)))}∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ∈ V)
44	26, 43	eqeltrid 2833	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) → ∪ 𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))}∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ∈ V)
45	5, 44	eqeltrid 2833	1 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) → trCl(𝑋, 𝐴, 𝑅) ∈ V)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1085   = wceq 1534   ∈ wcel 2099  {cab 2705  ∀wral 3058  ∃wrex 3067  Vcvv 3471  [wsbc 3776   ∖ cdif 3944  ∅c0 4323  {csn 4629  ∪ ciun 4996  dom cdm 5678  suc csuc 6371   Fn wfn 6543  ‘cfv 6548  ωcom 7870   predc-bnj14 34319   FrSe w-bnj15 34323   trClc-bnj18 34325

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 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5365  ax-pr 5429  ax-un 7740  ax-reg 9616  ax-inf2 9665

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3or 1086  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-reu 3374  df-rab 3430  df-v 3473  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4909  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5576  df-eprel 5582  df-po 5590  df-so 5591  df-fr 5633  df-we 5635  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6500  df-fun 6550  df-fn 6551  df-f 6552  df-f1 6553  df-fo 6554  df-f1o 6555  df-fv 6556  df-om 7871  df-1o 8487  df-bnj17 34318  df-bnj14 34320  df-bnj13 34322  df-bnj15 34324  df-bnj18 34326

This theorem is referenced by:  bnj1125  34623  bnj1136  34628  bnj1177  34637  bnj1413  34666  bnj1452  34683