Theorem bnj600 32473

Description: Technical lemma for bnj852 32475. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj600.1	⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj600.2	⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj600.3	⊢ 𝐷 = (ω ∖ {∅})
bnj600.4	⊢ (𝜒 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
bnj600.5	⊢ (𝜃 ↔ ∀𝑚 ∈ 𝐷 (𝑚 E 𝑛 → [𝑚 / 𝑛]𝜒))
bnj600.10	⊢ (𝜑′ ↔ [𝑚 / 𝑛]𝜑)
bnj600.11	⊢ (𝜓′ ↔ [𝑚 / 𝑛]𝜓)
bnj600.12	⊢ (𝜒′ ↔ [𝑚 / 𝑛]𝜒)
bnj600.13	⊢ (𝜑″ ↔ [𝐺 / 𝑓]𝜑)
bnj600.14	⊢ (𝜓″ ↔ [𝐺 / 𝑓]𝜓)
bnj600.15	⊢ (𝜒″ ↔ [𝐺 / 𝑓]𝜒)
bnj600.16	⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
bnj600.17	⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
bnj600.18	⊢ (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚))
bnj600.19	⊢ (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
bnj600.20	⊢ (𝜁 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 = suc 𝑖))
bnj600.21	⊢ (𝜌 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 ≠ suc 𝑖))
bnj600.22	⊢ 𝐵 = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)
bnj600.23	⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)
bnj600.24	⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)
bnj600.25	⊢ 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅)
bnj600.26	⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, 𝐶⟩})

Assertion

Ref	Expression
bnj600	⊢ (𝑛 ≠ 1o → ((𝑛 ∈ 𝐷 ∧ 𝜃) → 𝜒))

Distinct variable groups:   𝐴,𝑓,𝑖,𝑚,𝑛,𝑝   𝑦,𝐴,𝑓,𝑖,𝑛,𝑝   𝐷,𝑓,𝑝   𝑖,𝐺,𝑦   𝑅,𝑓,𝑖,𝑚,𝑛,𝑝   𝑦,𝑅   𝜂,𝑓,𝑖   𝑥,𝑓,𝑚,𝑛,𝑝   𝑖,𝜑′,𝑝   𝜑,𝑚,𝑝   𝜓,𝑚,𝑝   𝜃,𝑝

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑓,𝑖,𝑛)   𝜓(𝑥,𝑦,𝑓,𝑖,𝑛)   𝜒(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜃(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛)   𝜏(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜂(𝑥,𝑦,𝑚,𝑛,𝑝)   𝜁(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜎(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜌(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐴(𝑥)   𝐵(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐶(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐷(𝑥,𝑦,𝑖,𝑚,𝑛)   𝑅(𝑥)   𝐺(𝑥,𝑓,𝑚,𝑛,𝑝)   𝐾(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐿(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜑′(𝑥,𝑦,𝑓,𝑚,𝑛)   𝜓′(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜒′(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜑″(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜓″(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜒″(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)

Proof of Theorem bnj600

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		bnj600.5	. . . . . 6 ⊢ (𝜃 ↔ ∀𝑚 ∈ 𝐷 (𝑚 E 𝑛 → [𝑚 / 𝑛]𝜒))
2		bnj600.13	. . . . . 6 ⊢ (𝜑″ ↔ [𝐺 / 𝑓]𝜑)
3		bnj600.14	. . . . . 6 ⊢ (𝜓″ ↔ [𝐺 / 𝑓]𝜓)
4		bnj600.17	. . . . . 6 ⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
5		bnj600.19	. . . . . 6 ⊢ (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
6		bnj600.16	. . . . . . 7 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
7	6	bnj528 32443	. . . . . 6 ⊢ 𝐺 ∈ V
8		bnj600.4	. . . . . . 7 ⊢ (𝜒 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
9		bnj600.10	. . . . . . 7 ⊢ (𝜑′ ↔ [𝑚 / 𝑛]𝜑)
10		bnj600.11	. . . . . . 7 ⊢ (𝜓′ ↔ [𝑚 / 𝑛]𝜓)
11		bnj600.12	. . . . . . 7 ⊢ (𝜒′ ↔ [𝑚 / 𝑛]𝜒)
12		vex 3403	. . . . . . 7 ⊢ 𝑚 ∈ V
13	8, 9, 10, 11, 12	bnj207 32435	. . . . . 6 ⊢ (𝜒′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)))
14		bnj600.1	. . . . . . 7 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
15	14, 2, 7	bnj609 32471	. . . . . 6 ⊢ (𝜑″ ↔ (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
16		bnj600.2	. . . . . . 7 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
17	16, 3, 7	bnj611 32472	. . . . . 6 ⊢ (𝜓″ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))
18		bnj600.3	. . . . . . . . . 10 ⊢ 𝐷 = (ω ∖ {∅})
19	18	bnj168 32282	. . . . . . . . 9 ⊢ ((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷) → ∃𝑚 ∈ 𝐷 𝑛 = suc 𝑚)
20		df-rex 3060	. . . . . . . . 9 ⊢ (∃𝑚 ∈ 𝐷 𝑛 = suc 𝑚 ↔ ∃𝑚(𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚))
21	19, 20	sylib 221	. . . . . . . 8 ⊢ ((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷) → ∃𝑚(𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚))
22	18	bnj158 32281	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ 𝐷 → ∃𝑝 ∈ ω 𝑚 = suc 𝑝)
23		df-rex 3060	. . . . . . . . . . . . . 14 ⊢ (∃𝑝 ∈ ω 𝑚 = suc 𝑝 ↔ ∃𝑝(𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
24	22, 23	sylib 221	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ 𝐷 → ∃𝑝(𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
25	24	adantr 484	. . . . . . . . . . . 12 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚) → ∃𝑝(𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
26	25	ancri 553	. . . . . . . . . . 11 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚) → (∃𝑝(𝑝 ∈ ω ∧ 𝑚 = suc 𝑝) ∧ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚)))
27	26	bnj534 32292	. . . . . . . . . 10 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚) → ∃𝑝((𝑝 ∈ ω ∧ 𝑚 = suc 𝑝) ∧ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚)))
28		bnj432 32268	. . . . . . . . . . 11 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝) ↔ ((𝑝 ∈ ω ∧ 𝑚 = suc 𝑝) ∧ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚)))
29	28	exbii 1854	. . . . . . . . . 10 ⊢ (∃𝑝(𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝) ↔ ∃𝑝((𝑝 ∈ ω ∧ 𝑚 = suc 𝑝) ∧ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚)))
30	27, 29	sylibr 237	. . . . . . . . 9 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚) → ∃𝑝(𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
31	30	eximi 1841	. . . . . . . 8 ⊢ (∃𝑚(𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚) → ∃𝑚∃𝑝(𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
32	21, 31	syl 17	. . . . . . 7 ⊢ ((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷) → ∃𝑚∃𝑝(𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
33	5	2exbii 1855	. . . . . . 7 ⊢ (∃𝑚∃𝑝𝜂 ↔ ∃𝑚∃𝑝(𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
34	32, 33	sylibr 237	. . . . . 6 ⊢ ((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷) → ∃𝑚∃𝑝𝜂)
35		rsp 3119	. . . . . . . . 9 ⊢ (∀𝑚 ∈ 𝐷 (𝑚 E 𝑛 → [𝑚 / 𝑛]𝜒) → (𝑚 ∈ 𝐷 → (𝑚 E 𝑛 → [𝑚 / 𝑛]𝜒)))
36	1, 35	sylbi 220	. . . . . . . 8 ⊢ (𝜃 → (𝑚 ∈ 𝐷 → (𝑚 E 𝑛 → [𝑚 / 𝑛]𝜒)))
37	36	3imp 1112	. . . . . . 7 ⊢ ((𝜃 ∧ 𝑚 ∈ 𝐷 ∧ 𝑚 E 𝑛) → [𝑚 / 𝑛]𝜒)
38	37, 11	sylibr 237	. . . . . 6 ⊢ ((𝜃 ∧ 𝑚 ∈ 𝐷 ∧ 𝑚 E 𝑛) → 𝜒′)
39		bnj600.18	. . . . . . 7 ⊢ (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚))
40	14, 9, 12	bnj523 32441	. . . . . . . 8 ⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
41	16, 10, 12	bnj539 32445	. . . . . . . 8 ⊢ (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
42	40, 41, 18, 6, 4, 39	bnj544 32448	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → 𝐺 Fn 𝑛)
43	39, 5, 42	bnj561 32457	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → 𝐺 Fn 𝑛)
44	40, 18, 6, 4, 39, 42, 15	bnj545 32449	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → 𝜑″)
45	39, 5, 44	bnj562 32458	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → 𝜑″)
46		bnj600.20	. . . . . . 7 ⊢ (𝜁 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 = suc 𝑖))
47		bnj600.22	. . . . . . 7 ⊢ 𝐵 = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)
48		bnj600.23	. . . . . . 7 ⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)
49		bnj600.24	. . . . . . 7 ⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)
50		bnj600.25	. . . . . . 7 ⊢ 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅)
51		bnj600.26	. . . . . . 7 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, 𝐶⟩})
52		bnj600.21	. . . . . . 7 ⊢ (𝜌 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 ≠ suc 𝑖))
53	18, 6, 4, 39, 5, 46, 47, 48, 49, 50, 51, 40, 41, 42, 52, 43, 17	bnj571 32460	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → 𝜓″)
54		biid 264	. . . . . 6 ⊢ ([𝑧 / 𝑓]𝜑 ↔ [𝑧 / 𝑓]𝜑)
55		biid 264	. . . . . 6 ⊢ ([𝑧 / 𝑓]𝜓 ↔ [𝑧 / 𝑓]𝜓)
56		biid 264	. . . . . 6 ⊢ ([𝐺 / 𝑧][𝑧 / 𝑓]𝜑 ↔ [𝐺 / 𝑧][𝑧 / 𝑓]𝜑)
57		biid 264	. . . . . 6 ⊢ ([𝐺 / 𝑧][𝑧 / 𝑓]𝜓 ↔ [𝐺 / 𝑧][𝑧 / 𝑓]𝜓)
58	1, 2, 3, 4, 5, 7, 13, 15, 17, 34, 38, 43, 45, 53, 14, 16, 54, 55, 56, 57	bnj607 32470	. . . . 5 ⊢ ((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷 ∧ 𝜃) → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
59	14, 16, 18	bnj579 32468	. . . . . . 7 ⊢ (𝑛 ∈ 𝐷 → ∃*𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
60	59	a1d 25	. . . . . 6 ⊢ (𝑛 ∈ 𝐷 → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃*𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
61	60	3ad2ant2 1135	. . . . 5 ⊢ ((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷 ∧ 𝜃) → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃*𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
62	58, 61	jcad 516	. . . 4 ⊢ ((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷 ∧ 𝜃) → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (∃𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ ∃*𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))))
63		df-eu 2571	. . . 4 ⊢ (∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (∃𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ ∃*𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
64	62, 63	syl6ibr 255	. . 3 ⊢ ((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷 ∧ 𝜃) → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
65	64, 8	sylibr 237	. 2 ⊢ ((𝑛 ≠ 1o ∧ 𝑛 ∈ 𝐷 ∧ 𝜃) → 𝜒)
66	65	3expib 1123	1 ⊢ (𝑛 ≠ 1o → ((𝑛 ∈ 𝐷 ∧ 𝜃) → 𝜒))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1088   = wceq 1542  ∃wex 1786   ∈ wcel 2114  ∃*wmo 2539  ∃!weu 2570   ≠ wne 2935  ∀wral 3054  ∃wrex 3055  [wsbc 3681   ∖ cdif 3841   ∪ cun 3842  ∅c0 4212  {csn 4517  ⟨cop 4523  ∪ ciun 4882   class class class wbr 5031   E cep 5434  suc csuc 6175   Fn wfn 6335  ‘cfv 6340  ωcom 7602  1_oc1o 8127   ∧ w-bnj17 32238   predc-bnj14 32240   FrSe w-bnj15 32244

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2020  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2162  ax-12 2179  ax-ext 2711  ax-rep 5155  ax-sep 5168  ax-nul 5175  ax-pr 5297  ax-un 7482  ax-reg 9132

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2075  df-mo 2541  df-eu 2571  df-clab 2718  df-cleq 2731  df-clel 2812  df-nfc 2882  df-ne 2936  df-ral 3059  df-rex 3060  df-reu 3061  df-rab 3063  df-v 3401  df-sbc 3682  df-csb 3792  df-dif 3847  df-un 3849  df-in 3851  df-ss 3861  df-pss 3863  df-nul 4213  df-if 4416  df-pw 4491  df-sn 4518  df-pr 4520  df-tp 4522  df-op 4524  df-uni 4798  df-iun 4884  df-br 5032  df-opab 5094  df-mpt 5112  df-tr 5138  df-id 5430  df-eprel 5435  df-po 5443  df-so 5444  df-fr 5484  df-we 5486  df-xp 5532  df-rel 5533  df-cnv 5534  df-co 5535  df-dm 5536  df-rn 5537  df-res 5538  df-ima 5539  df-ord 6176  df-on 6177  df-lim 6178  df-suc 6179  df-iota 6298  df-fun 6342  df-fn 6343  df-f 6344  df-f1 6345  df-fo 6346  df-f1o 6347  df-fv 6348  df-om 7603  df-1o 8134  df-bnj17 32239  df-bnj14 32241  df-bnj13 32243  df-bnj15 32245

This theorem is referenced by:  bnj601  32474