Theorem recexprlemloc 7340

Description: 𝐵 is located. Lemma for recexpr 7347. (Contributed by Jim Kingdon, 27-Dec-2019.)

Hypothesis

Ref	Expression
recexpr.1	⊢ 𝐵 = ⟨{𝑥 ∣ ∃𝑦(𝑥 <Q 𝑦 ∧ (*Q‘𝑦) ∈ (2nd ‘𝐴))}, {𝑥 ∣ ∃𝑦(𝑦 <Q 𝑥 ∧ (*Q‘𝑦) ∈ (1st ‘𝐴))}⟩

Assertion

Ref	Expression
recexprlemloc	⊢ (𝐴 ∈ P → ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘𝐵) ∨ 𝑟 ∈ (2nd ‘𝐵))))

Distinct variable groups:   𝑟,𝑞,𝑥,𝑦,𝐴   𝐵,𝑞,𝑟,𝑥,𝑦

Proof of Theorem recexprlemloc

Dummy variables 𝑣 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prop 7184	. . . . . . . . 9 ⊢ (𝐴 ∈ P → ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P)
2		prnmaxl 7197	. . . . . . . . 9 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) → ∃𝑢 ∈ (1st ‘𝐴)(*Q‘𝑟) <Q 𝑢)
3	1, 2	sylan 279	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) → ∃𝑢 ∈ (1st ‘𝐴)(*Q‘𝑟) <Q 𝑢)
4	3	adantlr 464	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) → ∃𝑢 ∈ (1st ‘𝐴)(*Q‘𝑟) <Q 𝑢)
5		simprr 502	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (*Q‘𝑟) <Q 𝑢)) → (*Q‘𝑟) <Q 𝑢)
6		elprnql 7190	. . . . . . . . . . . . . 14 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ 𝑢 ∈ (1st ‘𝐴)) → 𝑢 ∈ Q)
7	1, 6	sylan 279	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ P ∧ 𝑢 ∈ (1st ‘𝐴)) → 𝑢 ∈ Q)
8	7	ad2ant2r 496	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (*Q‘𝑟) <Q 𝑢)) → 𝑢 ∈ Q)
9	8	adantlr 464	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (*Q‘𝑟) <Q 𝑢)) → 𝑢 ∈ Q)
10		recrecnq 7103	. . . . . . . . . . 11 ⊢ (𝑢 ∈ Q → (*Q‘(*Q‘𝑢)) = 𝑢)
11	9, 10	syl 14	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (*Q‘𝑟) <Q 𝑢)) → (*Q‘(*Q‘𝑢)) = 𝑢)
12	5, 11	breqtrrd 3901	. . . . . . . . 9 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (*Q‘𝑟) <Q 𝑢)) → (*Q‘𝑟) <Q (*Q‘(*Q‘𝑢)))
13		recclnq 7101	. . . . . . . . . . 11 ⊢ (𝑢 ∈ Q → (*Q‘𝑢) ∈ Q)
14	9, 13	syl 14	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (*Q‘𝑟) <Q 𝑢)) → (*Q‘𝑢) ∈ Q)
15		ltrelnq 7074	. . . . . . . . . . . . . 14 ⊢ <Q ⊆ (Q × Q)
16	15	brel 4529	. . . . . . . . . . . . 13 ⊢ (𝑞 <Q 𝑟 → (𝑞 ∈ Q ∧ 𝑟 ∈ Q))
17	16	adantl 273	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) → (𝑞 ∈ Q ∧ 𝑟 ∈ Q))
18	17	ad2antrr 475	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (*Q‘𝑟) <Q 𝑢)) → (𝑞 ∈ Q ∧ 𝑟 ∈ Q))
19	18	simprd 113	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (*Q‘𝑟) <Q 𝑢)) → 𝑟 ∈ Q)
20		ltrnqg 7129	. . . . . . . . . 10 ⊢ (((*Q‘𝑢) ∈ Q ∧ 𝑟 ∈ Q) → ((*Q‘𝑢) <Q 𝑟 ↔ (*Q‘𝑟) <Q (*Q‘(*Q‘𝑢))))
21	14, 19, 20	syl2anc 406	. . . . . . . . 9 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (*Q‘𝑟) <Q 𝑢)) → ((*Q‘𝑢) <Q 𝑟 ↔ (*Q‘𝑟) <Q (*Q‘(*Q‘𝑢))))
22	12, 21	mpbird 166	. . . . . . . 8 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (*Q‘𝑟) <Q 𝑢)) → (*Q‘𝑢) <Q 𝑟)
23		simprl 501	. . . . . . . . 9 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (*Q‘𝑟) <Q 𝑢)) → 𝑢 ∈ (1st ‘𝐴))
24	11, 23	eqeltrd 2176	. . . . . . . 8 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (*Q‘𝑟) <Q 𝑢)) → (*Q‘(*Q‘𝑢)) ∈ (1st ‘𝐴))
25		breq1 3878	. . . . . . . . . . . 12 ⊢ (𝑦 = (*Q‘𝑢) → (𝑦 <Q 𝑟 ↔ (*Q‘𝑢) <Q 𝑟))
26		fveq2 5353	. . . . . . . . . . . . 13 ⊢ (𝑦 = (*Q‘𝑢) → (*Q‘𝑦) = (*Q‘(*Q‘𝑢)))
27	26	eleq1d 2168	. . . . . . . . . . . 12 ⊢ (𝑦 = (*Q‘𝑢) → ((*Q‘𝑦) ∈ (1st ‘𝐴) ↔ (*Q‘(*Q‘𝑢)) ∈ (1st ‘𝐴)))
28	25, 27	anbi12d 460	. . . . . . . . . . 11 ⊢ (𝑦 = (*Q‘𝑢) → ((𝑦 <Q 𝑟 ∧ (*Q‘𝑦) ∈ (1st ‘𝐴)) ↔ ((*Q‘𝑢) <Q 𝑟 ∧ (*Q‘(*Q‘𝑢)) ∈ (1st ‘𝐴))))
29	28	spcegv 2729	. . . . . . . . . 10 ⊢ ((*Q‘𝑢) ∈ Q → (((*Q‘𝑢) <Q 𝑟 ∧ (*Q‘(*Q‘𝑢)) ∈ (1st ‘𝐴)) → ∃𝑦(𝑦 <Q 𝑟 ∧ (*Q‘𝑦) ∈ (1st ‘𝐴))))
30		recexpr.1	. . . . . . . . . . 11 ⊢ 𝐵 = ⟨{𝑥 ∣ ∃𝑦(𝑥 <Q 𝑦 ∧ (*Q‘𝑦) ∈ (2nd ‘𝐴))}, {𝑥 ∣ ∃𝑦(𝑦 <Q 𝑥 ∧ (*Q‘𝑦) ∈ (1st ‘𝐴))}⟩
31	30	recexprlemelu 7332	. . . . . . . . . 10 ⊢ (𝑟 ∈ (2nd ‘𝐵) ↔ ∃𝑦(𝑦 <Q 𝑟 ∧ (*Q‘𝑦) ∈ (1st ‘𝐴)))
32	29, 31	syl6ibr 161	. . . . . . . . 9 ⊢ ((*Q‘𝑢) ∈ Q → (((*Q‘𝑢) <Q 𝑟 ∧ (*Q‘(*Q‘𝑢)) ∈ (1st ‘𝐴)) → 𝑟 ∈ (2nd ‘𝐵)))
33	14, 32	syl 14	. . . . . . . 8 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (*Q‘𝑟) <Q 𝑢)) → (((*Q‘𝑢) <Q 𝑟 ∧ (*Q‘(*Q‘𝑢)) ∈ (1st ‘𝐴)) → 𝑟 ∈ (2nd ‘𝐵)))
34	22, 24, 33	mp2and 427	. . . . . . 7 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (*Q‘𝑟) <Q 𝑢)) → 𝑟 ∈ (2nd ‘𝐵))
35	4, 34	rexlimddv 2513	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) → 𝑟 ∈ (2nd ‘𝐵))
36	35	olcd 694	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑟) ∈ (1st ‘𝐴)) → (𝑞 ∈ (1st ‘𝐵) ∨ 𝑟 ∈ (2nd ‘𝐵)))
37		prnminu 7198	. . . . . . . . 9 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) → ∃𝑣 ∈ (2nd ‘𝐴)𝑣 <Q (*Q‘𝑞))
38	1, 37	sylan 279	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) → ∃𝑣 ∈ (2nd ‘𝐴)𝑣 <Q (*Q‘𝑞))
39	38	adantlr 464	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) → ∃𝑣 ∈ (2nd ‘𝐴)𝑣 <Q (*Q‘𝑞))
40		elprnqu 7191	. . . . . . . . . . . . . 14 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ 𝑣 ∈ (2nd ‘𝐴)) → 𝑣 ∈ Q)
41	1, 40	sylan 279	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ P ∧ 𝑣 ∈ (2nd ‘𝐴)) → 𝑣 ∈ Q)
42	41	adantlr 464	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ 𝑣 ∈ (2nd ‘𝐴)) → 𝑣 ∈ Q)
43	42	ad2ant2r 496	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) ∧ (𝑣 ∈ (2nd ‘𝐴) ∧ 𝑣 <Q (*Q‘𝑞))) → 𝑣 ∈ Q)
44		recrecnq 7103	. . . . . . . . . . 11 ⊢ (𝑣 ∈ Q → (*Q‘(*Q‘𝑣)) = 𝑣)
45	43, 44	syl 14	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) ∧ (𝑣 ∈ (2nd ‘𝐴) ∧ 𝑣 <Q (*Q‘𝑞))) → (*Q‘(*Q‘𝑣)) = 𝑣)
46		simprr 502	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) ∧ (𝑣 ∈ (2nd ‘𝐴) ∧ 𝑣 <Q (*Q‘𝑞))) → 𝑣 <Q (*Q‘𝑞))
47	45, 46	eqbrtrd 3895	. . . . . . . . 9 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) ∧ (𝑣 ∈ (2nd ‘𝐴) ∧ 𝑣 <Q (*Q‘𝑞))) → (*Q‘(*Q‘𝑣)) <Q (*Q‘𝑞))
48	17	ad2antrr 475	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) ∧ (𝑣 ∈ (2nd ‘𝐴) ∧ 𝑣 <Q (*Q‘𝑞))) → (𝑞 ∈ Q ∧ 𝑟 ∈ Q))
49	48	simpld 111	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) ∧ (𝑣 ∈ (2nd ‘𝐴) ∧ 𝑣 <Q (*Q‘𝑞))) → 𝑞 ∈ Q)
50		recclnq 7101	. . . . . . . . . . 11 ⊢ (𝑣 ∈ Q → (*Q‘𝑣) ∈ Q)
51	43, 50	syl 14	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) ∧ (𝑣 ∈ (2nd ‘𝐴) ∧ 𝑣 <Q (*Q‘𝑞))) → (*Q‘𝑣) ∈ Q)
52		ltrnqg 7129	. . . . . . . . . 10 ⊢ ((𝑞 ∈ Q ∧ (*Q‘𝑣) ∈ Q) → (𝑞 <Q (*Q‘𝑣) ↔ (*Q‘(*Q‘𝑣)) <Q (*Q‘𝑞)))
53	49, 51, 52	syl2anc 406	. . . . . . . . 9 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) ∧ (𝑣 ∈ (2nd ‘𝐴) ∧ 𝑣 <Q (*Q‘𝑞))) → (𝑞 <Q (*Q‘𝑣) ↔ (*Q‘(*Q‘𝑣)) <Q (*Q‘𝑞)))
54	47, 53	mpbird 166	. . . . . . . 8 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) ∧ (𝑣 ∈ (2nd ‘𝐴) ∧ 𝑣 <Q (*Q‘𝑞))) → 𝑞 <Q (*Q‘𝑣))
55		simprl 501	. . . . . . . . 9 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) ∧ (𝑣 ∈ (2nd ‘𝐴) ∧ 𝑣 <Q (*Q‘𝑞))) → 𝑣 ∈ (2nd ‘𝐴))
56	45, 55	eqeltrd 2176	. . . . . . . 8 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) ∧ (𝑣 ∈ (2nd ‘𝐴) ∧ 𝑣 <Q (*Q‘𝑞))) → (*Q‘(*Q‘𝑣)) ∈ (2nd ‘𝐴))
57		breq2 3879	. . . . . . . . . . . 12 ⊢ (𝑦 = (*Q‘𝑣) → (𝑞 <Q 𝑦 ↔ 𝑞 <Q (*Q‘𝑣)))
58		fveq2 5353	. . . . . . . . . . . . 13 ⊢ (𝑦 = (*Q‘𝑣) → (*Q‘𝑦) = (*Q‘(*Q‘𝑣)))
59	58	eleq1d 2168	. . . . . . . . . . . 12 ⊢ (𝑦 = (*Q‘𝑣) → ((*Q‘𝑦) ∈ (2nd ‘𝐴) ↔ (*Q‘(*Q‘𝑣)) ∈ (2nd ‘𝐴)))
60	57, 59	anbi12d 460	. . . . . . . . . . 11 ⊢ (𝑦 = (*Q‘𝑣) → ((𝑞 <Q 𝑦 ∧ (*Q‘𝑦) ∈ (2nd ‘𝐴)) ↔ (𝑞 <Q (*Q‘𝑣) ∧ (*Q‘(*Q‘𝑣)) ∈ (2nd ‘𝐴))))
61	60	spcegv 2729	. . . . . . . . . 10 ⊢ ((*Q‘𝑣) ∈ Q → ((𝑞 <Q (*Q‘𝑣) ∧ (*Q‘(*Q‘𝑣)) ∈ (2nd ‘𝐴)) → ∃𝑦(𝑞 <Q 𝑦 ∧ (*Q‘𝑦) ∈ (2nd ‘𝐴))))
62	30	recexprlemell 7331	. . . . . . . . . 10 ⊢ (𝑞 ∈ (1st ‘𝐵) ↔ ∃𝑦(𝑞 <Q 𝑦 ∧ (*Q‘𝑦) ∈ (2nd ‘𝐴)))
63	61, 62	syl6ibr 161	. . . . . . . . 9 ⊢ ((*Q‘𝑣) ∈ Q → ((𝑞 <Q (*Q‘𝑣) ∧ (*Q‘(*Q‘𝑣)) ∈ (2nd ‘𝐴)) → 𝑞 ∈ (1st ‘𝐵)))
64	51, 63	syl 14	. . . . . . . 8 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) ∧ (𝑣 ∈ (2nd ‘𝐴) ∧ 𝑣 <Q (*Q‘𝑞))) → ((𝑞 <Q (*Q‘𝑣) ∧ (*Q‘(*Q‘𝑣)) ∈ (2nd ‘𝐴)) → 𝑞 ∈ (1st ‘𝐵)))
65	54, 56, 64	mp2and 427	. . . . . . 7 ⊢ ((((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) ∧ (𝑣 ∈ (2nd ‘𝐴) ∧ 𝑣 <Q (*Q‘𝑞))) → 𝑞 ∈ (1st ‘𝐵))
66	39, 65	rexlimddv 2513	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) → 𝑞 ∈ (1st ‘𝐵))
67	66	orcd 693	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) ∧ (*Q‘𝑞) ∈ (2nd ‘𝐴)) → (𝑞 ∈ (1st ‘𝐵) ∨ 𝑟 ∈ (2nd ‘𝐵)))
68		ltrnqi 7130	. . . . . 6 ⊢ (𝑞 <Q 𝑟 → (*Q‘𝑟) <Q (*Q‘𝑞))
69		prloc 7200	. . . . . 6 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ (*Q‘𝑟) <Q (*Q‘𝑞)) → ((*Q‘𝑟) ∈ (1st ‘𝐴) ∨ (*Q‘𝑞) ∈ (2nd ‘𝐴)))
70	1, 68, 69	syl2an 285	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) → ((*Q‘𝑟) ∈ (1st ‘𝐴) ∨ (*Q‘𝑞) ∈ (2nd ‘𝐴)))
71	36, 67, 70	mpjaodan 753	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝑞 <Q 𝑟) → (𝑞 ∈ (1st ‘𝐵) ∨ 𝑟 ∈ (2nd ‘𝐵)))
72	71	ex 114	. . 3 ⊢ (𝐴 ∈ P → (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘𝐵) ∨ 𝑟 ∈ (2nd ‘𝐵))))
73	72	ralrimivw 2465	. 2 ⊢ (𝐴 ∈ P → ∀𝑟 ∈ Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘𝐵) ∨ 𝑟 ∈ (2nd ‘𝐵))))
74	73	ralrimivw 2465	1 ⊢ (𝐴 ∈ P → ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st ‘𝐵) ∨ 𝑟 ∈ (2nd ‘𝐵))))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 670   = wceq 1299  ∃wex 1436   ∈ wcel 1448  {cab 2086  ∀wral 2375  ∃wrex 2376  ⟨cop 3477   class class class wbr 3875  ‘cfv 5059  1^st c1st 5967  2^nd c2nd 5968  Qcnq 6989  *_Qcrq 6993   <_Q cltq 6994  Pcnp 7000

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 584  ax-in2 585  ax-io 671  ax-5 1391  ax-7 1392  ax-gen 1393  ax-ie1 1437  ax-ie2 1438  ax-8 1450  ax-10 1451  ax-11 1452  ax-i12 1453  ax-bndl 1454  ax-4 1455  ax-13 1459  ax-14 1460  ax-17 1474  ax-i9 1478  ax-ial 1482  ax-i5r 1483  ax-ext 2082  ax-coll 3983  ax-sep 3986  ax-nul 3994  ax-pow 4038  ax-pr 4069  ax-un 4293  ax-setind 4390  ax-iinf 4440

This theorem depends on definitions:  df-bi 116  df-dc 787  df-3or 931  df-3an 932  df-tru 1302  df-fal 1305  df-nf 1405  df-sb 1704  df-eu 1963  df-mo 1964  df-clab 2087  df-cleq 2093  df-clel 2096  df-nfc 2229  df-ne 2268  df-ral 2380  df-rex 2381  df-reu 2382  df-rab 2384  df-v 2643  df-sbc 2863  df-csb 2956  df-dif 3023  df-un 3025  df-in 3027  df-ss 3034  df-nul 3311  df-pw 3459  df-sn 3480  df-pr 3481  df-op 3483  df-uni 3684  df-int 3719  df-iun 3762  df-br 3876  df-opab 3930  df-mpt 3931  df-tr 3967  df-eprel 4149  df-id 4153  df-iord 4226  df-on 4228  df-suc 4231  df-iom 4443  df-xp 4483  df-rel 4484  df-cnv 4485  df-co 4486  df-dm 4487  df-rn 4488  df-res 4489  df-ima 4490  df-iota 5024  df-fun 5061  df-fn 5062  df-f 5063  df-f1 5064  df-fo 5065  df-f1o 5066  df-fv 5067  df-ov 5709  df-oprab 5710  df-mpo 5711  df-1st 5969  df-2nd 5970  df-recs 6132  df-irdg 6197  df-1o 6243  df-oadd 6247  df-omul 6248  df-er 6359  df-ec 6361  df-qs 6365  df-ni 7013  df-mi 7015  df-lti 7016  df-mpq 7054  df-enq 7056  df-nqqs 7057  df-mqqs 7059  df-1nqqs 7060  df-rq 7061  df-ltnqqs 7062  df-inp 7175

This theorem is referenced by:  recexprlempr  7341