Theorem ltexprlemopu 6701

Description: The upper cut of our constructed difference is open. Lemma for ltexpri 6711. (Contributed by Jim Kingdon, 21-Dec-2019.)

Hypothesis

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

Assertion

Ref	Expression
ltexprlemopu	⊢ ((𝐴<P 𝐵 ∧ 𝑟 ∈ Q ∧ 𝑟 ∈ (2nd ‘𝐶)) → ∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ 𝑞 ∈ (2nd ‘𝐶)))

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

Proof of Theorem ltexprlemopu

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

Step	Hyp	Ref	Expression
1		ltexprlem.1	. . . . 5 ⊢ 𝐶 = ⟨{𝑥 ∈ Q ∣ ∃𝑦(𝑦 ∈ (2nd ‘𝐴) ∧ (𝑦 +Q 𝑥) ∈ (1st ‘𝐵))}, {𝑥 ∈ Q ∣ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑥) ∈ (2nd ‘𝐵))}⟩
2	1	ltexprlemelu 6697	. . . 4 ⊢ (𝑟 ∈ (2nd ‘𝐶) ↔ (𝑟 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵))))
3	2	simprbi 260	. . 3 ⊢ (𝑟 ∈ (2nd ‘𝐶) → ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))
4		19.42v 1786	. . . . . . . 8 ⊢ (∃𝑦(𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ↔ (𝐴<P 𝐵 ∧ ∃𝑦(𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))))
5		19.42v 1786	. . . . . . . . 9 ⊢ (∃𝑦(𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵))) ↔ (𝑟 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵))))
6	5	anbi2i 430	. . . . . . . 8 ⊢ ((𝐴<P 𝐵 ∧ ∃𝑦(𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ↔ (𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))))
7	4, 6	bitri 173	. . . . . . 7 ⊢ (∃𝑦(𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ↔ (𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))))
8		ltrelpr 6603	. . . . . . . . . . . . . . 15 ⊢ <P ⊆ (P × P)
9	8	brel 4392	. . . . . . . . . . . . . 14 ⊢ (𝐴<P 𝐵 → (𝐴 ∈ P ∧ 𝐵 ∈ P))
10	9	simprd 107	. . . . . . . . . . . . 13 ⊢ (𝐴<P 𝐵 → 𝐵 ∈ P)
11		prop 6573	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ P → ⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P)
12	10, 11	syl 14	. . . . . . . . . . . 12 ⊢ (𝐴<P 𝐵 → ⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P)
13		prnminu 6587	. . . . . . . . . . . 12 ⊢ ((⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)) → ∃𝑠 ∈ (2nd ‘𝐵)𝑠 <Q (𝑦 +Q 𝑟))
14	12, 13	sylan 267	. . . . . . . . . . 11 ⊢ ((𝐴<P 𝐵 ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)) → ∃𝑠 ∈ (2nd ‘𝐵)𝑠 <Q (𝑦 +Q 𝑟))
15	14	adantrl 447	. . . . . . . . . 10 ⊢ ((𝐴<P 𝐵 ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵))) → ∃𝑠 ∈ (2nd ‘𝐵)𝑠 <Q (𝑦 +Q 𝑟))
16	15	adantrl 447	. . . . . . . . 9 ⊢ ((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) → ∃𝑠 ∈ (2nd ‘𝐵)𝑠 <Q (𝑦 +Q 𝑟))
17		ltdfpr 6604	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴<P 𝐵 ↔ ∃𝑡 ∈ Q (𝑡 ∈ (2nd ‘𝐴) ∧ 𝑡 ∈ (1st ‘𝐵))))
18	17	biimpd 132	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴<P 𝐵 → ∃𝑡 ∈ Q (𝑡 ∈ (2nd ‘𝐴) ∧ 𝑡 ∈ (1st ‘𝐵))))
19	9, 18	mpcom 32	. . . . . . . . . . . . 13 ⊢ (𝐴<P 𝐵 → ∃𝑡 ∈ Q (𝑡 ∈ (2nd ‘𝐴) ∧ 𝑡 ∈ (1st ‘𝐵)))
20	19	ad2antrr 457	. . . . . . . . . . . 12 ⊢ (((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) → ∃𝑡 ∈ Q (𝑡 ∈ (2nd ‘𝐴) ∧ 𝑡 ∈ (1st ‘𝐵)))
21	9	simpld 105	. . . . . . . . . . . . . . . 16 ⊢ (𝐴<P 𝐵 → 𝐴 ∈ P)
22	21	ad2antrr 457	. . . . . . . . . . . . . . 15 ⊢ (((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) → 𝐴 ∈ P)
23	22	adantr 261	. . . . . . . . . . . . . 14 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑡 ∈ Q ∧ (𝑡 ∈ (2nd ‘𝐴) ∧ 𝑡 ∈ (1st ‘𝐵)))) → 𝐴 ∈ P)
24		simplrr 488	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) → (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))
25	24	simpld 105	. . . . . . . . . . . . . . 15 ⊢ (((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) → 𝑦 ∈ (1st ‘𝐴))
26	25	adantr 261	. . . . . . . . . . . . . 14 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑡 ∈ Q ∧ (𝑡 ∈ (2nd ‘𝐴) ∧ 𝑡 ∈ (1st ‘𝐵)))) → 𝑦 ∈ (1st ‘𝐴))
27		simprrl 491	. . . . . . . . . . . . . 14 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑡 ∈ Q ∧ (𝑡 ∈ (2nd ‘𝐴) ∧ 𝑡 ∈ (1st ‘𝐵)))) → 𝑡 ∈ (2nd ‘𝐴))
28		prop 6573	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ P → ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P)
29		prltlu 6585	. . . . . . . . . . . . . . 15 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ 𝑦 ∈ (1st ‘𝐴) ∧ 𝑡 ∈ (2nd ‘𝐴)) → 𝑦 <Q 𝑡)
30	28, 29	syl3an1 1168	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ P ∧ 𝑦 ∈ (1st ‘𝐴) ∧ 𝑡 ∈ (2nd ‘𝐴)) → 𝑦 <Q 𝑡)
31	23, 26, 27, 30	syl3anc 1135	. . . . . . . . . . . . 13 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑡 ∈ Q ∧ (𝑡 ∈ (2nd ‘𝐴) ∧ 𝑡 ∈ (1st ‘𝐵)))) → 𝑦 <Q 𝑡)
32		simplll 485	. . . . . . . . . . . . . 14 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑡 ∈ Q ∧ (𝑡 ∈ (2nd ‘𝐴) ∧ 𝑡 ∈ (1st ‘𝐵)))) → 𝐴<P 𝐵)
33		simprrr 492	. . . . . . . . . . . . . 14 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑡 ∈ Q ∧ (𝑡 ∈ (2nd ‘𝐴) ∧ 𝑡 ∈ (1st ‘𝐵)))) → 𝑡 ∈ (1st ‘𝐵))
34		simplrl 487	. . . . . . . . . . . . . 14 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑡 ∈ Q ∧ (𝑡 ∈ (2nd ‘𝐴) ∧ 𝑡 ∈ (1st ‘𝐵)))) → 𝑠 ∈ (2nd ‘𝐵))
35		prltlu 6585	. . . . . . . . . . . . . . 15 ⊢ ((⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P ∧ 𝑡 ∈ (1st ‘𝐵) ∧ 𝑠 ∈ (2nd ‘𝐵)) → 𝑡 <Q 𝑠)
36	12, 35	syl3an1 1168	. . . . . . . . . . . . . 14 ⊢ ((𝐴<P 𝐵 ∧ 𝑡 ∈ (1st ‘𝐵) ∧ 𝑠 ∈ (2nd ‘𝐵)) → 𝑡 <Q 𝑠)
37	32, 33, 34, 36	syl3anc 1135	. . . . . . . . . . . . 13 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑡 ∈ Q ∧ (𝑡 ∈ (2nd ‘𝐴) ∧ 𝑡 ∈ (1st ‘𝐵)))) → 𝑡 <Q 𝑠)
38		ltsonq 6496	. . . . . . . . . . . . . 14 ⊢ <Q Or Q
39		ltrelnq 6463	. . . . . . . . . . . . . 14 ⊢ <Q ⊆ (Q × Q)
40	38, 39	sotri 4720	. . . . . . . . . . . . 13 ⊢ ((𝑦 <Q 𝑡 ∧ 𝑡 <Q 𝑠) → 𝑦 <Q 𝑠)
41	31, 37, 40	syl2anc 391	. . . . . . . . . . . 12 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑡 ∈ Q ∧ (𝑡 ∈ (2nd ‘𝐴) ∧ 𝑡 ∈ (1st ‘𝐵)))) → 𝑦 <Q 𝑠)
42	20, 41	rexlimddv 2437	. . . . . . . . . . 11 ⊢ (((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) → 𝑦 <Q 𝑠)
43		elprnql 6579	. . . . . . . . . . . . . 14 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ 𝑦 ∈ (1st ‘𝐴)) → 𝑦 ∈ Q)
44	28, 43	sylan 267	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ P ∧ 𝑦 ∈ (1st ‘𝐴)) → 𝑦 ∈ Q)
45	22, 25, 44	syl2anc 391	. . . . . . . . . . . 12 ⊢ (((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) → 𝑦 ∈ Q)
46		elprnqu 6580	. . . . . . . . . . . . . 14 ⊢ ((⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P ∧ 𝑠 ∈ (2nd ‘𝐵)) → 𝑠 ∈ Q)
47	12, 46	sylan 267	. . . . . . . . . . . . 13 ⊢ ((𝐴<P 𝐵 ∧ 𝑠 ∈ (2nd ‘𝐵)) → 𝑠 ∈ Q)
48	47	ad2ant2r 478	. . . . . . . . . . . 12 ⊢ (((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) → 𝑠 ∈ Q)
49		ltexnqq 6506	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ Q ∧ 𝑠 ∈ Q) → (𝑦 <Q 𝑠 ↔ ∃𝑞 ∈ Q (𝑦 +Q 𝑞) = 𝑠))
50	45, 48, 49	syl2anc 391	. . . . . . . . . . 11 ⊢ (((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) → (𝑦 <Q 𝑠 ↔ ∃𝑞 ∈ Q (𝑦 +Q 𝑞) = 𝑠))
51	42, 50	mpbid 135	. . . . . . . . . 10 ⊢ (((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) → ∃𝑞 ∈ Q (𝑦 +Q 𝑞) = 𝑠)
52		simprr 484	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑞 ∈ Q ∧ (𝑦 +Q 𝑞) = 𝑠)) → (𝑦 +Q 𝑞) = 𝑠)
53		simplrr 488	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑞 ∈ Q ∧ (𝑦 +Q 𝑞) = 𝑠)) → 𝑠 <Q (𝑦 +Q 𝑟))
54	52, 53	eqbrtrd 3784	. . . . . . . . . . . . . 14 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑞 ∈ Q ∧ (𝑦 +Q 𝑞) = 𝑠)) → (𝑦 +Q 𝑞) <Q (𝑦 +Q 𝑟))
55		simprl 483	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑞 ∈ Q ∧ (𝑦 +Q 𝑞) = 𝑠)) → 𝑞 ∈ Q)
56		simplrl 487	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) → 𝑟 ∈ Q)
57	56	adantr 261	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑞 ∈ Q ∧ (𝑦 +Q 𝑞) = 𝑠)) → 𝑟 ∈ Q)
58	45	adantr 261	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑞 ∈ Q ∧ (𝑦 +Q 𝑞) = 𝑠)) → 𝑦 ∈ Q)
59		ltanqg 6498	. . . . . . . . . . . . . . 15 ⊢ ((𝑞 ∈ Q ∧ 𝑟 ∈ Q ∧ 𝑦 ∈ Q) → (𝑞 <Q 𝑟 ↔ (𝑦 +Q 𝑞) <Q (𝑦 +Q 𝑟)))
60	55, 57, 58, 59	syl3anc 1135	. . . . . . . . . . . . . 14 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑞 ∈ Q ∧ (𝑦 +Q 𝑞) = 𝑠)) → (𝑞 <Q 𝑟 ↔ (𝑦 +Q 𝑞) <Q (𝑦 +Q 𝑟)))
61	54, 60	mpbird 156	. . . . . . . . . . . . 13 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑞 ∈ Q ∧ (𝑦 +Q 𝑞) = 𝑠)) → 𝑞 <Q 𝑟)
62	25	adantr 261	. . . . . . . . . . . . . 14 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑞 ∈ Q ∧ (𝑦 +Q 𝑞) = 𝑠)) → 𝑦 ∈ (1st ‘𝐴))
63		simplrl 487	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑞 ∈ Q ∧ (𝑦 +Q 𝑞) = 𝑠)) → 𝑠 ∈ (2nd ‘𝐵))
64	52, 63	eqeltrd 2114	. . . . . . . . . . . . . 14 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑞 ∈ Q ∧ (𝑦 +Q 𝑞) = 𝑠)) → (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵))
65	62, 64	jca 290	. . . . . . . . . . . . 13 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑞 ∈ Q ∧ (𝑦 +Q 𝑞) = 𝑠)) → (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))
66	61, 55, 65	jca32 293	. . . . . . . . . . . 12 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ (𝑞 ∈ Q ∧ (𝑦 +Q 𝑞) = 𝑠)) → (𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))))
67	66	expr 357	. . . . . . . . . . 11 ⊢ ((((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) ∧ 𝑞 ∈ Q) → ((𝑦 +Q 𝑞) = 𝑠 → (𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵))))))
68	67	reximdva 2421	. . . . . . . . . 10 ⊢ (((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) → (∃𝑞 ∈ Q (𝑦 +Q 𝑞) = 𝑠 → ∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵))))))
69	51, 68	mpd 13	. . . . . . . . 9 ⊢ (((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q (𝑦 +Q 𝑟))) → ∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))))
70	16, 69	rexlimddv 2437	. . . . . . . 8 ⊢ ((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) → ∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))))
71	70	eximi 1491	. . . . . . 7 ⊢ (∃𝑦(𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) → ∃𝑦∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))))
72	7, 71	sylbir 125	. . . . . 6 ⊢ ((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) → ∃𝑦∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))))
73		rexcom4 2577	. . . . . 6 ⊢ (∃𝑞 ∈ Q ∃𝑦(𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))) ↔ ∃𝑦∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))))
74	72, 73	sylibr 137	. . . . 5 ⊢ ((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) → ∃𝑞 ∈ Q ∃𝑦(𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))))
75		19.42v 1786	. . . . . . 7 ⊢ (∃𝑦(𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))) ↔ (𝑞 <Q 𝑟 ∧ ∃𝑦(𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))))
76		19.42v 1786	. . . . . . . 8 ⊢ (∃𝑦(𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵))) ↔ (𝑞 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵))))
77	76	anbi2i 430	. . . . . . 7 ⊢ ((𝑞 <Q 𝑟 ∧ ∃𝑦(𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))) ↔ (𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))))
78	75, 77	bitri 173	. . . . . 6 ⊢ (∃𝑦(𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))) ↔ (𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))))
79	78	rexbii 2331	. . . . 5 ⊢ (∃𝑞 ∈ Q ∃𝑦(𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))) ↔ ∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))))
80	74, 79	sylib 127	. . . 4 ⊢ ((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) → ∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))))
81	1	ltexprlemelu 6697	. . . . . 6 ⊢ (𝑞 ∈ (2nd ‘𝐶) ↔ (𝑞 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵))))
82	81	anbi2i 430	. . . . 5 ⊢ ((𝑞 <Q 𝑟 ∧ 𝑞 ∈ (2nd ‘𝐶)) ↔ (𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))))
83	82	rexbii 2331	. . . 4 ⊢ (∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ 𝑞 ∈ (2nd ‘𝐶)) ↔ ∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ (𝑞 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd ‘𝐵)))))
84	80, 83	sylibr 137	. . 3 ⊢ ((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1st ‘𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd ‘𝐵)))) → ∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ 𝑞 ∈ (2nd ‘𝐶)))
85	3, 84	sylanr2 385	. 2 ⊢ ((𝐴<P 𝐵 ∧ (𝑟 ∈ Q ∧ 𝑟 ∈ (2nd ‘𝐶))) → ∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ 𝑞 ∈ (2nd ‘𝐶)))
86	85	3impb 1100	1 ⊢ ((𝐴<P 𝐵 ∧ 𝑟 ∈ Q ∧ 𝑟 ∈ (2nd ‘𝐶)) → ∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ 𝑞 ∈ (2nd ‘𝐶)))

Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98   ∧ w3a 885   = wceq 1243  ∃wex 1381   ∈ wcel 1393  ∃wrex 2307  {crab 2310  ⟨cop 3378   class class class wbr 3764  ‘cfv 4902  (class class class)co 5512  1^st c1st 5765  2^nd c2nd 5766  Qcnq 6378   +_Q cplq 6380   <_Q cltq 6383  Pcnp 6389  <_P cltp 6393

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-nul 3883  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-setind 4262  ax-iinf 4311

This theorem depends on definitions:  df-bi 110  df-dc 743  df-3or 886  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-nul 3225  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-int 3616  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-tr 3855  df-eprel 4026  df-id 4030  df-po 4033  df-iso 4034  df-iord 4103  df-on 4105  df-suc 4108  df-iom 4314  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-ov 5515  df-oprab 5516  df-mpt2 5517  df-1st 5767  df-2nd 5768  df-recs 5920  df-irdg 5957  df-1o 6001  df-oadd 6005  df-omul 6006  df-er 6106  df-ec 6108  df-qs 6112  df-ni 6402  df-pli 6403  df-mi 6404  df-lti 6405  df-plpq 6442  df-mpq 6443  df-enq 6445  df-nqqs 6446  df-plqqs 6447  df-mqqs 6448  df-1nqqs 6449  df-ltnqqs 6451  df-inp 6564  df-iltp 6568

This theorem is referenced by:  ltexprlemrnd  6703