Theorem aptiprlemu 7971

Description: Lemma for aptipr 7972. (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 7806	. . . . . 6 ⊢ (𝐵 ∈ P → ⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P)
2		prnminu 7820	. . . . . 6 ⊢ ((⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P ∧ 𝑥 ∈ (2nd ‘𝐵)) → ∃𝑠 ∈ (2nd ‘𝐵)𝑠 <Q 𝑥)
3	1, 2	sylan 283	. . . . 5 ⊢ ((𝐵 ∈ P ∧ 𝑥 ∈ (2nd ‘𝐵)) → ∃𝑠 ∈ (2nd ‘𝐵)𝑠 <Q 𝑥)
4	3	3ad2antl2 1187	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) → ∃𝑠 ∈ (2nd ‘𝐵)𝑠 <Q 𝑥)
5		simprr 533	. . . . . 6 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) → 𝑠 <Q 𝑥)
6		ltexnqi 7740	. . . . . 6 ⊢ (𝑠 <Q 𝑥 → ∃𝑡 ∈ Q (𝑠 +Q 𝑡) = 𝑥)
7	5, 6	syl 14	. . . . 5 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) → ∃𝑡 ∈ Q (𝑠 +Q 𝑡) = 𝑥)
8		simpl1 1027	. . . . . . . 8 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) → 𝐴 ∈ P)
9	8	ad2antrr 488	. . . . . . 7 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) → 𝐴 ∈ P)
10		simprl 531	. . . . . . 7 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) → 𝑡 ∈ Q)
11		prop 7806	. . . . . . . 8 ⊢ (𝐴 ∈ P → ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P)
12		prarloc2 7835	. . . . . . . 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 1028	. . . . . . . . . 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 7813	. . . . . . . . . 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 531	. . . . . . . . . 10 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → 𝑢 ∈ (1st ‘𝐴))
24		elprnql 7812	. . . . . . . . . . 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 7706	. . . . . . . . 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 7727	. . . . . . . 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 531	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) → 𝑠 ∈ (2nd ‘𝐵))
34		elprnqu 7813	. . . . . . . . . . . . . . 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 538	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → (𝑠 +Q 𝑡) = 𝑥)
40		breq1 4117	. . . . . . . . . . . . . . . . 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 7731	. . . . . . . . . . . . . . . 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 7712	. . . . . . . . . . . . . . . 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 6232	. . . . . . . . . . . . . 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 7815	. . . . . . . . . . . . . . 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 2593	. . . . . . . . . . . 12 ⊢ ((𝑠 ∈ Q ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 ∈ (1st ‘𝐴))) → ∃𝑠 ∈ Q (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 ∈ (1st ‘𝐴)))
59	37, 38, 57, 58	syl12anc 1272	. . . . . . . . . . 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 7837	. . . . . . . . . . . 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 1065	. . . . . . . . . . 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 625	. . . . . . . . 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 533	. . . . . . . . 9 ⊢ ((((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) ∧ (𝑢 ∈ (1st ‘𝐴) ∧ (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))) → (𝑢 +Q 𝑡) ∈ (2nd ‘𝐴))
69		eleq1 2297	. . . . . . . . 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 7816	. . . . . . . . . 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 1341	. . . . . . 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 2667	. . . . 5 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) → 𝑥 ∈ (2nd ‘𝐴))
77	7, 76	rexlimddv 2667	. . . 4 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) → 𝑥 ∈ (2nd ‘𝐴))
78	4, 77	rexlimddv 2667	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) → 𝑥 ∈ (2nd ‘𝐴))
79	78	ex 115	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) → (𝑥 ∈ (2nd ‘𝐵) → 𝑥 ∈ (2nd ‘𝐴)))
80	79	ssrdv 3248	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) → (2nd ‘𝐵) ⊆ (2nd ‘𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ w3o 1004   ∧ w3a 1005   = wceq 1398   ∈ wcel 2205  ∃wrex 2523   ⊆ wss 3214  ⟨cop 3697   class class class wbr 4114  ‘cfv 5357  (class class class)co 6058  1^st c1st 6345  2^nd c2nd 6346  Qcnq 7611   +_Q cplq 7613   <_Q cltq 7616  Pcnp 7622  <_P cltp 7626

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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-eprel 4415  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-irdg 6614  df-1o 6660  df-2o 6661  df-oadd 6664  df-omul 6665  df-er 6780  df-ec 6782  df-qs 6786  df-ni 7635  df-pli 7636  df-mi 7637  df-lti 7638  df-plpq 7675  df-mpq 7676  df-enq 7678  df-nqqs 7679  df-plqqs 7680  df-mqqs 7681  df-1nqqs 7682  df-rq 7683  df-ltnqqs 7684  df-enq0 7755  df-nq0 7756  df-0nq0 7757  df-plq0 7758  df-mq0 7759  df-inp 7797  df-iltp 7801

This theorem is referenced by:  aptipr  7972  suplocexprlemmu  8049