Theorem suplocexprlemdisj 8034

Description: Lemma for suplocexpr 8039. The putative supremum is disjoint. (Contributed by Jim Kingdon, 9-Jan-2024.)

Hypotheses

Ref	Expression
suplocexpr.m	⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐴)
suplocexpr.ub	⊢ (𝜑 → ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)
suplocexpr.loc	⊢ (𝜑 → ∀𝑥 ∈ P ∀𝑦 ∈ P (𝑥<P 𝑦 → (∃𝑧 ∈ 𝐴 𝑥<P 𝑧 ∨ ∀𝑧 ∈ 𝐴 𝑧<P 𝑦)))
suplocexpr.b	⊢ 𝐵 = ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}⟩

Assertion

Ref	Expression
suplocexprlemdisj	⊢ (𝜑 → ∀𝑞 ∈ Q ¬ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵)))

Distinct variable groups:   𝑤,𝐴,𝑢   𝑥,𝐴,𝑦   𝑤,𝐵   𝜑,𝑞,𝑤   𝜑,𝑥,𝑦   𝑢,𝑞

Allowed substitution hints:   𝜑(𝑧,𝑢)   𝐴(𝑧,𝑞)   𝐵(𝑥,𝑦,𝑧,𝑢,𝑞)

Proof of Theorem suplocexprlemdisj

Dummy variables 𝑠 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simprl 531	. . . . 5 ⊢ (((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) → 𝑞 ∈ ∪ (1st “ 𝐴))
2		suplocexprlemell 8027	. . . . 5 ⊢ (𝑞 ∈ ∪ (1st “ 𝐴) ↔ ∃𝑠 ∈ 𝐴 𝑞 ∈ (1st ‘𝑠))
3	1, 2	sylib 122	. . . 4 ⊢ (((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) → ∃𝑠 ∈ 𝐴 𝑞 ∈ (1st ‘𝑠))
4		simprr 533	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝑞 ∈ (1st ‘𝑠))
5		simplrr 538	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝑞 ∈ (2nd ‘𝐵))
6		suplocexpr.m	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐴)
7		suplocexpr.ub	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)
8		suplocexpr.loc	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∀𝑥 ∈ P ∀𝑦 ∈ P (𝑥<P 𝑦 → (∃𝑧 ∈ 𝐴 𝑥<P 𝑧 ∨ ∀𝑧 ∈ 𝐴 𝑧<P 𝑦)))
9	6, 7, 8	suplocexprlemss 8029	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ⊆ P)
10	9	ad3antrrr 492	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝐴 ⊆ P)
11		suplocexpr.b	. . . . . . . . . . . . 13 ⊢ 𝐵 = ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}⟩
12	11	suplocexprlem2b 8028	. . . . . . . . . . . 12 ⊢ (𝐴 ⊆ P → (2nd ‘𝐵) = {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢})
13	12	eleq2d 2302	. . . . . . . . . . 11 ⊢ (𝐴 ⊆ P → (𝑞 ∈ (2nd ‘𝐵) ↔ 𝑞 ∈ {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}))
14	10, 13	syl 14	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → (𝑞 ∈ (2nd ‘𝐵) ↔ 𝑞 ∈ {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}))
15		breq2 4112	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑞 → (𝑤 <Q 𝑢 ↔ 𝑤 <Q 𝑞))
16	15	rexbidv 2543	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑞 → (∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢 ↔ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑞))
17	16	elrab 2972	. . . . . . . . . 10 ⊢ (𝑞 ∈ {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢} ↔ (𝑞 ∈ Q ∧ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑞))
18	14, 17	bitrdi 196	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → (𝑞 ∈ (2nd ‘𝐵) ↔ (𝑞 ∈ Q ∧ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑞)))
19	5, 18	mpbid 147	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → (𝑞 ∈ Q ∧ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑞))
20	19	simprd 114	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑞)
21		simprr 533	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → 𝑤 <Q 𝑞)
22	10	adantr 276	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → 𝐴 ⊆ P)
23		simplrl 537	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → 𝑠 ∈ 𝐴)
24	22, 23	sseldd 3238	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → 𝑠 ∈ P)
25		prop 7789	. . . . . . . . . 10 ⊢ (𝑠 ∈ P → ⟨(1st ‘𝑠), (2nd ‘𝑠)⟩ ∈ P)
26	24, 25	syl 14	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → ⟨(1st ‘𝑠), (2nd ‘𝑠)⟩ ∈ P)
27		eleq2 2296	. . . . . . . . . 10 ⊢ (𝑡 = (2nd ‘𝑠) → (𝑤 ∈ 𝑡 ↔ 𝑤 ∈ (2nd ‘𝑠)))
28		simprl 531	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → 𝑤 ∈ ∩ (2nd “ 𝐴))
29		vex 2815	. . . . . . . . . . . 12 ⊢ 𝑤 ∈ V
30	29	elint2 3955	. . . . . . . . . . 11 ⊢ (𝑤 ∈ ∩ (2nd “ 𝐴) ↔ ∀𝑡 ∈ (2nd “ 𝐴)𝑤 ∈ 𝑡)
31	28, 30	sylib 122	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → ∀𝑡 ∈ (2nd “ 𝐴)𝑤 ∈ 𝑡)
32		fo2nd 6351	. . . . . . . . . . . . . 14 ⊢ 2nd :V–onto→V
33		fofun 5590	. . . . . . . . . . . . . 14 ⊢ (2nd :V–onto→V → Fun 2nd )
34	32, 33	ax-mp 5	. . . . . . . . . . . . 13 ⊢ Fun 2nd
35		vex 2815	. . . . . . . . . . . . . 14 ⊢ 𝑠 ∈ V
36		fof 5589	. . . . . . . . . . . . . . . 16 ⊢ (2nd :V–onto→V → 2nd :V⟶V)
37	32, 36	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ 2nd :V⟶V
38	37	fdmi 5515	. . . . . . . . . . . . . 14 ⊢ dom 2nd = V
39	35, 38	eleqtrri 2308	. . . . . . . . . . . . 13 ⊢ 𝑠 ∈ dom 2nd
40		funfvima 5917	. . . . . . . . . . . . 13 ⊢ ((Fun 2nd ∧ 𝑠 ∈ dom 2nd ) → (𝑠 ∈ 𝐴 → (2nd ‘𝑠) ∈ (2nd “ 𝐴)))
41	34, 39, 40	mp2an 426	. . . . . . . . . . . 12 ⊢ (𝑠 ∈ 𝐴 → (2nd ‘𝑠) ∈ (2nd “ 𝐴))
42	41	ad2antrl 490	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → (2nd ‘𝑠) ∈ (2nd “ 𝐴))
43	42	adantr 276	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → (2nd ‘𝑠) ∈ (2nd “ 𝐴))
44	27, 31, 43	rspcdva 2925	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → 𝑤 ∈ (2nd ‘𝑠))
45		prcunqu 7799	. . . . . . . . 9 ⊢ ((⟨(1st ‘𝑠), (2nd ‘𝑠)⟩ ∈ P ∧ 𝑤 ∈ (2nd ‘𝑠)) → (𝑤 <Q 𝑞 → 𝑞 ∈ (2nd ‘𝑠)))
46	26, 44, 45	syl2anc 411	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → (𝑤 <Q 𝑞 → 𝑞 ∈ (2nd ‘𝑠)))
47	21, 46	mpd 13	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → 𝑞 ∈ (2nd ‘𝑠))
48	20, 47	rexlimddv 2665	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝑞 ∈ (2nd ‘𝑠))
49	4, 48	jca 306	. . . . 5 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → (𝑞 ∈ (1st ‘𝑠) ∧ 𝑞 ∈ (2nd ‘𝑠)))
50		simprl 531	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝑠 ∈ 𝐴)
51	10, 50	sseldd 3238	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝑠 ∈ P)
52	51, 25	syl 14	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → ⟨(1st ‘𝑠), (2nd ‘𝑠)⟩ ∈ P)
53		simpllr 536	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝑞 ∈ Q)
54		prdisj 7806	. . . . . 6 ⊢ ((⟨(1st ‘𝑠), (2nd ‘𝑠)⟩ ∈ P ∧ 𝑞 ∈ Q) → ¬ (𝑞 ∈ (1st ‘𝑠) ∧ 𝑞 ∈ (2nd ‘𝑠)))
55	52, 53, 54	syl2anc 411	. . . . 5 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → ¬ (𝑞 ∈ (1st ‘𝑠) ∧ 𝑞 ∈ (2nd ‘𝑠)))
56	49, 55	pm2.21fal 1418	. . . 4 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → ⊥)
57	3, 56	rexlimddv 2665	. . 3 ⊢ (((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) → ⊥)
58	57	inegd 1417	. 2 ⊢ ((𝜑 ∧ 𝑞 ∈ Q) → ¬ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵)))
59	58	ralrimiva 2615	1 ⊢ (𝜑 → ∀𝑞 ∈ Q ¬ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 716   = wceq 1398  ⊥wfal 1403  ∃wex 1541   ∈ wcel 2203  ∀wral 2520  ∃wrex 2521  {crab 2524  Vcvv 2812   ⊆ wss 3210  ⟨cop 3691  ∪ cuni 3913  ∩ cint 3948   class class class wbr 4108  dom cdm 4748   “ cima 4751  Fun wfun 5345  ⟶wf 5347  –onto→wfo 5349  ‘cfv 5351  1^st c1st 6331  2^nd c2nd 6332  Qcnq 7594   <_Q cltq 7599  Pcnp 7605  <_P cltp 7609

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-iinf 4709

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-1st 6333  df-2nd 6334  df-qs 6772  df-ni 7618  df-nqqs 7662  df-ltnqqs 7667  df-inp 7780  df-iltp 7784

This theorem is referenced by:  suplocexprlemex  8036