Theorem aptiprlemu 7659

Description: Lemma for aptipr 7660. (Contributed by Jim Kingdon, 28-Jan-2020.)

Assertion

Ref	Expression
aptiprlemu	⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) → (2nd ‘𝐵) ⊆ (2nd ‘𝐴))

Proof of Theorem aptiprlemu

Dummy variables 𝑓 𝑔 ℎ 𝑠 𝑡 𝑢 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prop 7494	. . . . . 6 ⊢ (𝐵 ∈ P → ⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P)
2		prnminu 7508	. . . . . 6 ⊢ ((⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P ∧ 𝑥 ∈ (2nd ‘𝐵)) → ∃𝑠 ∈ (2nd ‘𝐵)𝑠 <Q 𝑥)
3	1, 2	sylan 283	. . . . 5 ⊢ ((𝐵 ∈ P ∧ 𝑥 ∈ (2nd ‘𝐵)) → ∃𝑠 ∈ (2nd ‘𝐵)𝑠 <Q 𝑥)
4	3	3ad2antl2 1162	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) → ∃𝑠 ∈ (2nd ‘𝐵)𝑠 <Q 𝑥)
5		simprr 531	. . . . . 6 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) → 𝑠 <Q 𝑥)
6		ltexnqi 7428	. . . . . 6 ⊢ (𝑠 <Q 𝑥 → ∃𝑡 ∈ Q (𝑠 +Q 𝑡) = 𝑥)
7	5, 6	syl 14	. . . . 5 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) → ∃𝑡 ∈ Q (𝑠 +Q 𝑡) = 𝑥)
8		simpl1 1002	. . . . . . . 8 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) → 𝐴 ∈ P)
9	8	ad2antrr 488	. . . . . . 7 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) → 𝐴 ∈ P)
10		simprl 529	. . . . . . 7 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) → 𝑡 ∈ Q)
11		prop 7494	. . . . . . . 8 ⊢ (𝐴 ∈ P → ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P)
12		prarloc2 7523	. . . . . . . 8 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ 𝑡 ∈ Q) → ∃𝑢 ∈ (1st ‘𝐴)(𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))
13	11, 12	sylan 283	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝑡 ∈ Q) → ∃𝑢 ∈ (1st ‘𝐴)(𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))
14	9, 10, 13	syl2anc 411	. . . . . 6 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) → ∃𝑢 ∈ (1st ‘𝐴)(𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))
15		simpl2 1003	. . . . . . . . . 10 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) → 𝐵 ∈ P)
16	15	ad3antrrr 492	. . . . . . . . 9 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → 𝐵 ∈ P)
17		simpr 110	. . . . . . . . . 10 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) → 𝑥 ∈ (2nd ‘𝐵))
18	17	ad3antrrr 492	. . . . . . . . 9 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → 𝑥 ∈ (2nd ‘𝐵))
19		elprnqu 7501	. . . . . . . . . 10 ⊢ ((⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P ∧ 𝑥 ∈ (2nd ‘𝐵)) → 𝑥 ∈ Q)
20	1, 19	sylan 283	. . . . . . . . 9 ⊢ ((𝐵 ∈ P ∧ 𝑥 ∈ (2nd ‘𝐵)) → 𝑥 ∈ Q)
21	16, 18, 20	syl2anc 411	. . . . . . . 8 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → 𝑥 ∈ Q)
22	8	ad3antrrr 492	. . . . . . . . . 10 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → 𝐴 ∈ P)
23		simprl 529	. . . . . . . . . 10 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → 𝑢 ∈ (1st ‘𝐴))
24		elprnql 7500	. . . . . . . . . . 11 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ 𝑢 ∈ (1st ‘𝐴)) → 𝑢 ∈ Q)
25	11, 24	sylan 283	. . . . . . . . . 10 ⊢ ((𝐴 ∈ P ∧ 𝑢 ∈ (1st ‘𝐴)) → 𝑢 ∈ Q)
26	22, 23, 25	syl2anc 411	. . . . . . . . 9 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → 𝑢 ∈ Q)
27	10	adantr 276	. . . . . . . . 9 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → 𝑡 ∈ Q)
28		addclnq 7394	. . . . . . . . 9 ⊢ ((𝑢 ∈ Q ∧ 𝑡 ∈ Q) → (𝑢 +Q 𝑡) ∈ Q)
29	26, 27, 28	syl2anc 411	. . . . . . . 8 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → (𝑢 +Q 𝑡) ∈ Q)
30		nqtri3or 7415	. . . . . . . 8 ⊢ ((𝑥 ∈ Q ∧ (𝑢 +Q 𝑡) ∈ Q) → (𝑥 <Q (𝑢 +Q 𝑡) ∨ 𝑥 = (𝑢 +Q 𝑡) ∨ (𝑢 +Q 𝑡) <Q 𝑥))
31	21, 29, 30	syl2anc 411	. . . . . . 7 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → (𝑥 <Q (𝑢 +Q 𝑡) ∨ 𝑥 = (𝑢 +Q 𝑡) ∨ (𝑢 +Q 𝑡) <Q 𝑥))
32	15	adantr 276	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) → 𝐵 ∈ P)
33		simprl 529	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) → 𝑠 ∈ (2nd ‘𝐵))
34		elprnqu 7501	. . . . . . . . . . . . . . 15 ⊢ ((⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P ∧ 𝑠 ∈ (2nd ‘𝐵)) → 𝑠 ∈ Q)
35	1, 34	sylan 283	. . . . . . . . . . . . . 14 ⊢ ((𝐵 ∈ P ∧ 𝑠 ∈ (2nd ‘𝐵)) → 𝑠 ∈ Q)
36	32, 33, 35	syl2anc 411	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) → 𝑠 ∈ Q)
37	36	ad3antrrr 492	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → 𝑠 ∈ Q)
38	33	ad3antrrr 492	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → 𝑠 ∈ (2nd ‘𝐵))
39		simplrr 536	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → (𝑠 +Q 𝑡) = 𝑥)
40		breq1 4021	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑠 +Q 𝑡) = 𝑥 → ((𝑠 +Q 𝑡) <Q (𝑢 +Q 𝑡) ↔ 𝑥 <Q (𝑢 +Q 𝑡)))
41	40	biimprd 158	. . . . . . . . . . . . . . . 16 ⊢ ((𝑠 +Q 𝑡) = 𝑥 → (𝑥 <Q (𝑢 +Q 𝑡) → (𝑠 +Q 𝑡) <Q (𝑢 +Q 𝑡)))
42	39, 41	syl 14	. . . . . . . . . . . . . . 15 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → (𝑥 <Q (𝑢 +Q 𝑡) → (𝑠 +Q 𝑡) <Q (𝑢 +Q 𝑡)))
43	42	imp 124	. . . . . . . . . . . . . 14 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → (𝑠 +Q 𝑡) <Q (𝑢 +Q 𝑡))
44		ltanqg 7419	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑓 <Q 𝑔 ↔ (ℎ +Q 𝑓) <Q (ℎ +Q 𝑔)))
45	44	adantl 277	. . . . . . . . . . . . . . 15 ⊢ ((((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) ∧ (𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ ℎ ∈ Q)) → (𝑓 <Q 𝑔 ↔ (ℎ +Q 𝑓) <Q (ℎ +Q 𝑔)))
46	26	adantr 276	. . . . . . . . . . . . . . 15 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → 𝑢 ∈ Q)
47	27	adantr 276	. . . . . . . . . . . . . . 15 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → 𝑡 ∈ Q)
48		addcomnqg 7400	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q) → (𝑓 +Q 𝑔) = (𝑔 +Q 𝑓))
49	48	adantl 277	. . . . . . . . . . . . . . 15 ⊢ ((((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) ∧ (𝑓 ∈ Q ∧ 𝑔 ∈ Q)) → (𝑓 +Q 𝑔) = (𝑔 +Q 𝑓))
50	45, 37, 46, 47, 49	caovord2d 6062	. . . . . . . . . . . . . 14 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → (𝑠 <Q 𝑢 ↔ (𝑠 +Q 𝑡) <Q (𝑢 +Q 𝑡)))
51	43, 50	mpbird 167	. . . . . . . . . . . . 13 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → 𝑠 <Q 𝑢)
52	22	adantr 276	. . . . . . . . . . . . . 14 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → 𝐴 ∈ P)
53	23	adantr 276	. . . . . . . . . . . . . 14 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → 𝑢 ∈ (1st ‘𝐴))
54		prcdnql 7503	. . . . . . . . . . . . . . 15 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ 𝑢 ∈ (1st ‘𝐴)) → (𝑠 <Q 𝑢 → 𝑠 ∈ (1st ‘𝐴)))
55	11, 54	sylan 283	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ P ∧ 𝑢 ∈ (1st ‘𝐴)) → (𝑠 <Q 𝑢 → 𝑠 ∈ (1st ‘𝐴)))
56	52, 53, 55	syl2anc 411	. . . . . . . . . . . . 13 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → (𝑠 <Q 𝑢 → 𝑠 ∈ (1st ‘𝐴)))
57	51, 56	mpd 13	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → 𝑠 ∈ (1st ‘𝐴))
58		rspe 2539	. . . . . . . . . . . 12 ⊢ ((𝑠 ∈ Q ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 ∈ (1st ‘𝐴))) → ∃𝑠 ∈ Q (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 ∈ (1st ‘𝐴)))
59	37, 38, 57, 58	syl12anc 1247	. . . . . . . . . . 11 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → ∃𝑠 ∈ Q (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 ∈ (1st ‘𝐴)))
60	16	adantr 276	. . . . . . . . . . . 12 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → 𝐵 ∈ P)
61		ltdfpr 7525	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ P ∧ 𝐴 ∈ P) → (𝐵<P 𝐴 ↔ ∃𝑠 ∈ Q (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 ∈ (1st ‘𝐴))))
62	60, 52, 61	syl2anc 411	. . . . . . . . . . 11 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → (𝐵<P 𝐴 ↔ ∃𝑠 ∈ Q (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 ∈ (1st ‘𝐴))))
63	59, 62	mpbird 167	. . . . . . . . . 10 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → 𝐵<P 𝐴)
64		simpll3 1040	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) → ¬ 𝐵<P 𝐴)
65	64	ad3antrrr 492	. . . . . . . . . 10 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → ¬ 𝐵<P 𝐴)
66	63, 65	pm2.21dd 621	. . . . . . . . 9 ⊢ (((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) ∧ 𝑥 <Q (𝑢 +Q 𝑡)) → 𝑥 ∈ (2nd ‘𝐴))
67	66	ex 115	. . . . . . . 8 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → (𝑥 <Q (𝑢 +Q 𝑡) → 𝑥 ∈ (2nd ‘𝐴)))
68		simprr 531	. . . . . . . . 9 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))
69		eleq1 2252	. . . . . . . . 9 ⊢ (𝑥 = (𝑢 +Q 𝑡) → (𝑥 ∈ (2nd ‘𝐴) ↔ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴)))
70	68, 69	syl5ibrcom 157	. . . . . . . 8 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → (𝑥 = (𝑢 +Q 𝑡) → 𝑥 ∈ (2nd ‘𝐴)))
71		prcunqu 7504	. . . . . . . . . 10 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴)) → ((𝑢 +Q 𝑡) <Q 𝑥 → 𝑥 ∈ (2nd ‘𝐴)))
72	11, 71	sylan 283	. . . . . . . . 9 ⊢ ((𝐴 ∈ P ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴)) → ((𝑢 +Q 𝑡) <Q 𝑥 → 𝑥 ∈ (2nd ‘𝐴)))
73	22, 68, 72	syl2anc 411	. . . . . . . 8 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → ((𝑢 +Q 𝑡) <Q 𝑥 → 𝑥 ∈ (2nd ‘𝐴)))
74	67, 70, 73	3jaod 1315	. . . . . . 7 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → ((𝑥 <Q (𝑢 +Q 𝑡) ∨ 𝑥 = (𝑢 +Q 𝑡) ∨ (𝑢 +Q 𝑡) <Q 𝑥) → 𝑥 ∈ (2nd ‘𝐴)))
75	31, 74	mpd 13	. . . . . 6 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → 𝑥 ∈ (2nd ‘𝐴))
76	14, 75	rexlimddv 2612	. . . . 5 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) → 𝑥 ∈ (2nd ‘𝐴))
77	7, 76	rexlimddv 2612	. . . 4 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) → 𝑥 ∈ (2nd ‘𝐴))
78	4, 77	rexlimddv 2612	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) → 𝑥 ∈ (2nd ‘𝐴))
79	78	ex 115	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) → (𝑥 ∈ (2nd ‘𝐵) → 𝑥 ∈ (2nd ‘𝐴)))
80	79	ssrdv 3176	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) → (2nd ‘𝐵) ⊆ (2nd ‘𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ w3o 979   ∧ w3a 980   = wceq 1364   ∈ wcel 2160  ∃wrex 2469   ⊆ wss 3144  ⟨cop 3610   class class class wbr 4018  ‘cfv 5232  (class class class)co 5892  1^st c1st 6158  2^nd c2nd 6159  Qcnq 7299   +_Q cplq 7301   <_Q cltq 7304  Pcnp 7310  <_P cltp 7314

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-coll 4133  ax-sep 4136  ax-nul 4144  ax-pow 4189  ax-pr 4224  ax-un 4448  ax-setind 4551  ax-iinf 4602

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-ral 2473  df-rex 2474  df-reu 2475  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-tr 4117  df-eprel 4304  df-id 4308  df-po 4311  df-iso 4312  df-iord 4381  df-on 4383  df-suc 4386  df-iom 4605  df-xp 4647  df-rel 4648  df-cnv 4649  df-co 4650  df-dm 4651  df-rn 4652  df-res 4653  df-ima 4654  df-iota 5193  df-fun 5234  df-fn 5235  df-f 5236  df-f1 5237  df-fo 5238  df-f1o 5239  df-fv 5240  df-ov 5895  df-oprab 5896  df-mpo 5897  df-1st 6160  df-2nd 6161  df-recs 6325  df-irdg 6390  df-1o 6436  df-2o 6437  df-oadd 6440  df-omul 6441  df-er 6554  df-ec 6556  df-qs 6560  df-ni 7323  df-pli 7324  df-mi 7325  df-lti 7326  df-plpq 7363  df-mpq 7364  df-enq 7366  df-nqqs 7367  df-plqqs 7368  df-mqqs 7369  df-1nqqs 7370  df-rq 7371  df-ltnqqs 7372  df-enq0 7443  df-nq0 7444  df-0nq0 7445  df-plq0 7446  df-mq0 7447  df-inp 7485  df-iltp 7489

This theorem is referenced by:  aptipr  7660  suplocexprlemmu  7737