Theorem aptiprlemu 7835

Description: Lemma for aptipr 7836. (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 7670	. . . . . 6 ⊢ (𝐵 ∈ P → ⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P)
2		prnminu 7684	. . . . . 6 ⊢ ((⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P ∧ 𝑥 ∈ (2nd ‘𝐵)) → ∃𝑠 ∈ (2nd ‘𝐵)𝑠 <Q 𝑥)
3	1, 2	sylan 283	. . . . 5 ⊢ ((𝐵 ∈ P ∧ 𝑥 ∈ (2nd ‘𝐵)) → ∃𝑠 ∈ (2nd ‘𝐵)𝑠 <Q 𝑥)
4	3	3ad2antl2 1184	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) → ∃𝑠 ∈ (2nd ‘𝐵)𝑠 <Q 𝑥)
5		simprr 531	. . . . . 6 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) → 𝑠 <Q 𝑥)
6		ltexnqi 7604	. . . . . 6 ⊢ (𝑠 <Q 𝑥 → ∃𝑡 ∈ Q (𝑠 +Q 𝑡) = 𝑥)
7	5, 6	syl 14	. . . . 5 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) → ∃𝑡 ∈ Q (𝑠 +Q 𝑡) = 𝑥)
8		simpl1 1024	. . . . . . . 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 7670	. . . . . . . 8 ⊢ (𝐴 ∈ P → ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P)
12		prarloc2 7699	. . . . . . . 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 1025	. . . . . . . . . 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 7677	. . . . . . . . . 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 7676	. . . . . . . . . . 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 7570	. . . . . . . . 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 7591	. . . . . . . 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 7677	. . . . . . . . . . . . . . 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 4086	. . . . . . . . . . . . . . . . 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 7595	. . . . . . . . . . . . . . . 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 7576	. . . . . . . . . . . . . . . 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 6181	. . . . . . . . . . . . . 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 7679	. . . . . . . . . . . . . . 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 2579	. . . . . . . . . . . 12 ⊢ ((𝑠 ∈ Q ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 ∈ (1st ‘𝐴))) → ∃𝑠 ∈ Q (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 ∈ (1st ‘𝐴)))
59	37, 38, 57, 58	syl12anc 1269	. . . . . . . . . . 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 7701	. . . . . . . . . . . 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 1062	. . . . . . . . . . 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 623	. . . . . . . . 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 2292	. . . . . . . . 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 7680	. . . . . . . . . 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 1338	. . . . . . 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 2653	. . . . 5 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) ∧ (𝑡 ∈ Q ∧ (𝑠 +Q 𝑡) = 𝑥)) → 𝑥 ∈ (2nd ‘𝐴))
77	7, 76	rexlimddv 2653	. . . 4 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) ∧ (𝑠 ∈ (2nd ‘𝐵) ∧ 𝑠 <Q 𝑥)) → 𝑥 ∈ (2nd ‘𝐴))
78	4, 77	rexlimddv 2653	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) ∧ 𝑥 ∈ (2nd ‘𝐵)) → 𝑥 ∈ (2nd ‘𝐴))
79	78	ex 115	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) → (𝑥 ∈ (2nd ‘𝐵) → 𝑥 ∈ (2nd ‘𝐴)))
80	79	ssrdv 3230	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ¬ 𝐵<P 𝐴) → (2nd ‘𝐵) ⊆ (2nd ‘𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ w3o 1001   ∧ w3a 1002   = wceq 1395   ∈ wcel 2200  ∃wrex 2509   ⊆ wss 3197  ⟨cop 3669   class class class wbr 4083  ‘cfv 5318  (class class class)co 6007  1^st c1st 6290  2^nd c2nd 6291  Qcnq 7475   +_Q cplq 7477   <_Q cltq 7480  Pcnp 7486  <_P cltp 7490

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-eprel 4380  df-id 4384  df-po 4387  df-iso 4388  df-iord 4457  df-on 4459  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-recs 6457  df-irdg 6522  df-1o 6568  df-2o 6569  df-oadd 6572  df-omul 6573  df-er 6688  df-ec 6690  df-qs 6694  df-ni 7499  df-pli 7500  df-mi 7501  df-lti 7502  df-plpq 7539  df-mpq 7540  df-enq 7542  df-nqqs 7543  df-plqqs 7544  df-mqqs 7545  df-1nqqs 7546  df-rq 7547  df-ltnqqs 7548  df-enq0 7619  df-nq0 7620  df-0nq0 7621  df-plq0 7622  df-mq0 7623  df-inp 7661  df-iltp 7665

This theorem is referenced by:  aptipr  7836  suplocexprlemmu  7913