ltexprlemopl - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer	< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > ltexprlemopl		Structured version GIF version

Theorem ltexprlemopl 6573

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

**Hypothesis**
Ref	Expression
ltexprlem.1	⊢ 𝐶 = ⟨{x ∈ Q ∣ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q x) ∈ (1^st ‘B))}, {x ∈ Q ∣ ∃y(y ∈ (1^st ‘A) ∧ (y +_Q x) ∈ (2^nd ‘B))}⟩

**Assertion**
Ref	Expression
ltexprlemopl	⊢ ((A<_P B ∧ 𝑞 ∈ Q ∧ 𝑞 ∈ (1^st ‘𝐶)) → ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐶)))

Distinct variable groups: x,y,𝑞,𝑟,A x,B,y,𝑞,𝑟 x,𝐶,y,𝑞,𝑟

Proof of Theorem ltexprlemopl Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ltexprlem.1	. . . . 5 ⊢ 𝐶 = ⟨{x ∈ Q ∣ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q x) ∈ (1^st ‘B))}, {x ∈ Q ∣ ∃y(y ∈ (1^st ‘A) ∧ (y +_Q x) ∈ (2^nd ‘B))}⟩
2	1	ltexprlemell 6570	. . . 4 ⊢ (𝑞 ∈ (1^st ‘𝐶) ↔ (𝑞 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B))))
3	2	simprbi 260	. . 3 ⊢ (𝑞 ∈ (1^st ‘𝐶) → ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))
4		19.42v 1783	. . . . . . . 8 ⊢ (∃y(A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ↔ (A<_P B ∧ ∃y(𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))))
5		19.42v 1783	. . . . . . . . 9 ⊢ (∃y(𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B))) ↔ (𝑞 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B))))
6	5	anbi2i 430	. . . . . . . 8 ⊢ ((A<_P B ∧ ∃y(𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ↔ (A<_P B ∧ (𝑞 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))))
7	4, 6	bitri 173	. . . . . . 7 ⊢ (∃y(A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ↔ (A<_P B ∧ (𝑞 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))))
8		ltrelpr 6487	. . . . . . . . . . . . . 14 ⊢ <_P ⊆ (P × P)
9	8	brel 4335	. . . . . . . . . . . . 13 ⊢ (A<_P B → (A ∈ P ∧ B ∈ P))
10	9	simprd 107	. . . . . . . . . . . 12 ⊢ (A<_P B → B ∈ P)
11		prop 6457	. . . . . . . . . . . . 13 ⊢ (B ∈ P → ⟨(1^st ‘B), (2^nd ‘B)⟩ ∈ P)
12		prnmaxl 6470	. . . . . . . . . . . . 13 ⊢ ((⟨(1^st ‘B), (2^nd ‘B)⟩ ∈ P ∧ (y +_Q 𝑞) ∈ (1^st ‘B)) → ∃𝑠 ∈ (1^st ‘B)(y +_Q 𝑞) <_Q 𝑠)
13	11, 12	sylan 267	. . . . . . . . . . . 12 ⊢ ((B ∈ P ∧ (y +_Q 𝑞) ∈ (1^st ‘B)) → ∃𝑠 ∈ (1^st ‘B)(y +_Q 𝑞) <_Q 𝑠)
14	10, 13	sylan 267	. . . . . . . . . . 11 ⊢ ((A<_P B ∧ (y +_Q 𝑞) ∈ (1^st ‘B)) → ∃𝑠 ∈ (1^st ‘B)(y +_Q 𝑞) <_Q 𝑠)
15	14	adantrl 447	. . . . . . . . . 10 ⊢ ((A<_P B ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B))) → ∃𝑠 ∈ (1^st ‘B)(y +_Q 𝑞) <_Q 𝑠)
16	15	adantrl 447	. . . . . . . . 9 ⊢ ((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) → ∃𝑠 ∈ (1^st ‘B)(y +_Q 𝑞) <_Q 𝑠)
17	9	simpld 105	. . . . . . . . . . . . . . 15 ⊢ (A<_P B → A ∈ P)
18	17	ad2antrr 457	. . . . . . . . . . . . . 14 ⊢ (((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) → A ∈ P)
19		simplrr 488	. . . . . . . . . . . . . . 15 ⊢ (((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) → (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))
20	19	simpld 105	. . . . . . . . . . . . . 14 ⊢ (((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) → y ∈ (2^nd ‘A))
21		prop 6457	. . . . . . . . . . . . . . 15 ⊢ (A ∈ P → ⟨(1^st ‘A), (2^nd ‘A)⟩ ∈ P)
22		elprnqu 6464	. . . . . . . . . . . . . . 15 ⊢ ((⟨(1^st ‘A), (2^nd ‘A)⟩ ∈ P ∧ y ∈ (2^nd ‘A)) → y ∈ Q)
23	21, 22	sylan 267	. . . . . . . . . . . . . 14 ⊢ ((A ∈ P ∧ y ∈ (2^nd ‘A)) → y ∈ Q)
24	18, 20, 23	syl2anc 391	. . . . . . . . . . . . 13 ⊢ (((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) → y ∈ Q)
25		simplrl 487	. . . . . . . . . . . . 13 ⊢ (((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) → 𝑞 ∈ Q)
26		ltaddnq 6390	. . . . . . . . . . . . 13 ⊢ ((y ∈ Q ∧ 𝑞 ∈ Q) → y <_Q (y +_Q 𝑞))
27	24, 25, 26	syl2anc 391	. . . . . . . . . . . 12 ⊢ (((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) → y <_Q (y +_Q 𝑞))
28		simprr 484	. . . . . . . . . . . 12 ⊢ (((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) → (y +_Q 𝑞) <_Q 𝑠)
29		ltsonq 6382	. . . . . . . . . . . . 13 ⊢ <_Q Or Q
30		ltrelnq 6349	. . . . . . . . . . . . 13 ⊢ <_Q ⊆ (Q × Q)
31	29, 30	sotri 4663	. . . . . . . . . . . 12 ⊢ ((y <_Q (y +_Q 𝑞) ∧ (y +_Q 𝑞) <_Q 𝑠) → y <_Q 𝑠)
32	27, 28, 31	syl2anc 391	. . . . . . . . . . 11 ⊢ (((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) → y <_Q 𝑠)
33	10	ad2antrr 457	. . . . . . . . . . . . 13 ⊢ (((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) → B ∈ P)
34		simprl 483	. . . . . . . . . . . . 13 ⊢ (((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) → 𝑠 ∈ (1^st ‘B))
35		elprnql 6463	. . . . . . . . . . . . . 14 ⊢ ((⟨(1^st ‘B), (2^nd ‘B)⟩ ∈ P ∧ 𝑠 ∈ (1^st ‘B)) → 𝑠 ∈ Q)
36	11, 35	sylan 267	. . . . . . . . . . . . 13 ⊢ ((B ∈ P ∧ 𝑠 ∈ (1^st ‘B)) → 𝑠 ∈ Q)
37	33, 34, 36	syl2anc 391	. . . . . . . . . . . 12 ⊢ (((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) → 𝑠 ∈ Q)
38		ltexnqq 6391	. . . . . . . . . . . 12 ⊢ ((y ∈ Q ∧ 𝑠 ∈ Q) → (y <_Q 𝑠 ↔ ∃𝑟 ∈ Q (y +_Q 𝑟) = 𝑠))
39	24, 37, 38	syl2anc 391	. . . . . . . . . . 11 ⊢ (((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) → (y <_Q 𝑠 ↔ ∃𝑟 ∈ Q (y +_Q 𝑟) = 𝑠))
40	32, 39	mpbid 135	. . . . . . . . . 10 ⊢ (((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) → ∃𝑟 ∈ Q (y +_Q 𝑟) = 𝑠)
41		simplrr 488	. . . . . . . . . . . . . . 15 ⊢ ((((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) ∧ (𝑟 ∈ Q ∧ (y +_Q 𝑟) = 𝑠)) → (y +_Q 𝑞) <_Q 𝑠)
42		simprr 484	. . . . . . . . . . . . . . 15 ⊢ ((((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) ∧ (𝑟 ∈ Q ∧ (y +_Q 𝑟) = 𝑠)) → (y +_Q 𝑟) = 𝑠)
43	41, 42	breqtrrd 3781	. . . . . . . . . . . . . 14 ⊢ ((((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) ∧ (𝑟 ∈ Q ∧ (y +_Q 𝑟) = 𝑠)) → (y +_Q 𝑞) <_Q (y +_Q 𝑟))
44	25	adantr 261	. . . . . . . . . . . . . . 15 ⊢ ((((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) ∧ (𝑟 ∈ Q ∧ (y +_Q 𝑟) = 𝑠)) → 𝑞 ∈ Q)
45		simprl 483	. . . . . . . . . . . . . . 15 ⊢ ((((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) ∧ (𝑟 ∈ Q ∧ (y +_Q 𝑟) = 𝑠)) → 𝑟 ∈ Q)
46	24	adantr 261	. . . . . . . . . . . . . . 15 ⊢ ((((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) ∧ (𝑟 ∈ Q ∧ (y +_Q 𝑟) = 𝑠)) → y ∈ Q)
47		ltanqg 6384	. . . . . . . . . . . . . . 15 ⊢ ((𝑞 ∈ Q ∧ 𝑟 ∈ Q ∧ y ∈ Q) → (𝑞 <_Q 𝑟 ↔ (y +_Q 𝑞) <_Q (y +_Q 𝑟)))
48	44, 45, 46, 47	syl3anc 1134	. . . . . . . . . . . . . 14 ⊢ ((((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) ∧ (𝑟 ∈ Q ∧ (y +_Q 𝑟) = 𝑠)) → (𝑞 <_Q 𝑟 ↔ (y +_Q 𝑞) <_Q (y +_Q 𝑟)))
49	43, 48	mpbird 156	. . . . . . . . . . . . 13 ⊢ ((((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) ∧ (𝑟 ∈ Q ∧ (y +_Q 𝑟) = 𝑠)) → 𝑞 <_Q 𝑟)
50	20	adantr 261	. . . . . . . . . . . . . 14 ⊢ ((((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) ∧ (𝑟 ∈ Q ∧ (y +_Q 𝑟) = 𝑠)) → y ∈ (2^nd ‘A))
51		simplrl 487	. . . . . . . . . . . . . . 15 ⊢ ((((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) ∧ (𝑟 ∈ Q ∧ (y +_Q 𝑟) = 𝑠)) → 𝑠 ∈ (1^st ‘B))
52	42, 51	eqeltrd 2111	. . . . . . . . . . . . . 14 ⊢ ((((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) ∧ (𝑟 ∈ Q ∧ (y +_Q 𝑟) = 𝑠)) → (y +_Q 𝑟) ∈ (1^st ‘B))
53	50, 52	jca 290	. . . . . . . . . . . . 13 ⊢ ((((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) ∧ (𝑟 ∈ Q ∧ (y +_Q 𝑟) = 𝑠)) → (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))
54	49, 45, 53	jca32 293	. . . . . . . . . . . 12 ⊢ ((((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) ∧ (𝑟 ∈ Q ∧ (y +_Q 𝑟) = 𝑠)) → (𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))))
55	54	expr 357	. . . . . . . . . . 11 ⊢ ((((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) ∧ 𝑟 ∈ Q) → ((y +_Q 𝑟) = 𝑠 → (𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B))))))
56	55	reximdva 2415	. . . . . . . . . 10 ⊢ (((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) → (∃𝑟 ∈ Q (y +_Q 𝑟) = 𝑠 → ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B))))))
57	40, 56	mpd 13	. . . . . . . . 9 ⊢ (((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) ∧ (𝑠 ∈ (1^st ‘B) ∧ (y +_Q 𝑞) <_Q 𝑠)) → ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))))
58	16, 57	rexlimddv 2431	. . . . . . . 8 ⊢ ((A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) → ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))))
59	58	eximi 1488	. . . . . . 7 ⊢ (∃y(A<_P B ∧ (𝑞 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) → ∃y∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))))
60	7, 59	sylbir 125	. . . . . 6 ⊢ ((A<_P B ∧ (𝑞 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) → ∃y∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))))
61		rexcom4 2571	. . . . . 6 ⊢ (∃𝑟 ∈ Q ∃y(𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))) ↔ ∃y∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))))
62	60, 61	sylibr 137	. . . . 5 ⊢ ((A<_P B ∧ (𝑞 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) → ∃𝑟 ∈ Q ∃y(𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))))
63		19.42v 1783	. . . . . . 7 ⊢ (∃y(𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))) ↔ (𝑞 <_Q 𝑟 ∧ ∃y(𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))))
64		19.42v 1783	. . . . . . . 8 ⊢ (∃y(𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B))) ↔ (𝑟 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B))))
65	64	anbi2i 430	. . . . . . 7 ⊢ ((𝑞 <_Q 𝑟 ∧ ∃y(𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))) ↔ (𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))))
66	63, 65	bitri 173	. . . . . 6 ⊢ (∃y(𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))) ↔ (𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))))
67	66	rexbii 2325	. . . . 5 ⊢ (∃𝑟 ∈ Q ∃y(𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ (y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))))
68	62, 67	sylib 127	. . . 4 ⊢ ((A<_P B ∧ (𝑞 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) → ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))))
69	1	ltexprlemell 6570	. . . . . 6 ⊢ (𝑟 ∈ (1^st ‘𝐶) ↔ (𝑟 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B))))
70	69	anbi2i 430	. . . . 5 ⊢ ((𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐶)) ↔ (𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))))
71	70	rexbii 2325	. . . 4 ⊢ (∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐶)) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ (𝑟 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑟) ∈ (1^st ‘B)))))
72	68, 71	sylibr 137	. . 3 ⊢ ((A<_P B ∧ (𝑞 ∈ Q ∧ ∃y(y ∈ (2^nd ‘A) ∧ (y +_Q 𝑞) ∈ (1^st ‘B)))) → ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐶)))
73	3, 72	sylanr2 385	. 2 ⊢ ((A<_P B ∧ (𝑞 ∈ Q ∧ 𝑞 ∈ (1^st ‘𝐶))) → ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐶)))
74	73	3impb 1099	1 ⊢ ((A<_P B ∧ 𝑞 ∈ Q ∧ 𝑞 ∈ (1^st ‘𝐶)) → ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐶)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 97 ↔ wb 98 ∧ w3a 884 = wceq 1242 ∃wex 1378 ∈ wcel 1390 ∃wrex 2301 {crab 2304 ⟨cop 3370 class class class wbr 3755 ‘cfv 4845 (class class class)co 5455 1^st c1st 5707 2^nd c2nd 5708 Qcnq 6264 +_Q cplq 6266 <_Q cltq 6269 Pcnp 6275 <_P cltp 6279

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 629 ax-5 1333 ax-7 1334 ax-gen 1335 ax-ie1 1379 ax-ie2 1380 ax-8 1392 ax-10 1393 ax-11 1394 ax-i12 1395 ax-bnd 1396 ax-4 1397 ax-13 1401 ax-14 1402 ax-17 1416 ax-i9 1420 ax-ial 1424 ax-i5r 1425 ax-ext 2019 ax-coll 3863 ax-sep 3866 ax-nul 3874 ax-pow 3918 ax-pr 3935 ax-un 4136 ax-setind 4220 ax-iinf 4254

This theorem depends on definitions: df-bi 110 df-dc 742 df-3or 885 df-3an 886 df-tru 1245 df-fal 1248 df-nf 1347 df-sb 1643 df-eu 1900 df-mo 1901 df-clab 2024 df-cleq 2030 df-clel 2033 df-nfc 2164 df-ne 2203 df-ral 2305 df-rex 2306 df-reu 2307 df-rab 2309 df-v 2553 df-sbc 2759 df-csb 2847 df-dif 2914 df-un 2916 df-in 2918 df-ss 2925 df-nul 3219 df-pw 3353 df-sn 3373 df-pr 3374 df-op 3376 df-uni 3572 df-int 3607 df-iun 3650 df-br 3756 df-opab 3810 df-mpt 3811 df-tr 3846 df-eprel 4017 df-id 4021 df-po 4024 df-iso 4025 df-iord 4069 df-on 4071 df-suc 4074 df-iom 4257 df-xp 4294 df-rel 4295 df-cnv 4296 df-co 4297 df-dm 4298 df-rn 4299 df-res 4300 df-ima 4301 df-iota 4810 df-fun 4847 df-fn 4848 df-f 4849 df-f1 4850 df-fo 4851 df-f1o 4852 df-fv 4853 df-ov 5458 df-oprab 5459 df-mpt2 5460 df-1st 5709 df-2nd 5710 df-recs 5861 df-irdg 5897 df-1o 5940 df-oadd 5944 df-omul 5945 df-er 6042 df-ec 6044 df-qs 6048 df-ni 6288 df-pli 6289 df-mi 6290 df-lti 6291 df-plpq 6328 df-mpq 6329 df-enq 6331 df-nqqs 6332 df-plqqs 6333 df-mqqs 6334 df-1nqqs 6335 df-ltnqqs 6337 df-inp 6448 df-iltp 6452

This theorem is referenced by: ltexprlemrnd 6577

W3C validator