ltexprlemupu - Intuitionistic Logic Explorer

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

Theorem ltexprlemupu 6702

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

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

**Assertion**
Ref	Expression
ltexprlemupu	⊢ ((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) → (∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐶)) → 𝑟 ∈ (2^nd ‘𝐶)))

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

**Proof of Theorem ltexprlemupu**
Step	Hyp	Ref	Expression
1		simplr 482	. . . . . 6 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))) → 𝑟 ∈ Q)
2		simprrr 492	. . . . . . 7 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))) → (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵)))
3	2	simpld 105	. . . . . 6 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))) → 𝑦 ∈ (1^st ‘𝐴))
4		simprl 483	. . . . . . . 8 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))) → 𝑞 <_Q 𝑟)
5		simpll 481	. . . . . . . . 9 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))) → 𝐴<_P 𝐵)
6		simprrl 491	. . . . . . . . . 10 ⊢ ((𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵)))) → 𝑦 ∈ (1^st ‘𝐴))
7	6	adantl 262	. . . . . . . . 9 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))) → 𝑦 ∈ (1^st ‘𝐴))
8		ltrelpr 6603	. . . . . . . . . . . . 13 ⊢ <_P ⊆ (P × P)
9	8	brel 4392	. . . . . . . . . . . 12 ⊢ (𝐴<_P 𝐵 → (𝐴 ∈ P ∧ 𝐵 ∈ P))
10	9	simpld 105	. . . . . . . . . . 11 ⊢ (𝐴<_P 𝐵 → 𝐴 ∈ P)
11		prop 6573	. . . . . . . . . . 11 ⊢ (𝐴 ∈ P → ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P)
12	10, 11	syl 14	. . . . . . . . . 10 ⊢ (𝐴<_P 𝐵 → ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P)
13		elprnql 6579	. . . . . . . . . 10 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑦 ∈ (1^st ‘𝐴)) → 𝑦 ∈ Q)
14	12, 13	sylan 267	. . . . . . . . 9 ⊢ ((𝐴<_P 𝐵 ∧ 𝑦 ∈ (1^st ‘𝐴)) → 𝑦 ∈ Q)
15	5, 7, 14	syl2anc 391	. . . . . . . 8 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))) → 𝑦 ∈ Q)
16		ltanqi 6500	. . . . . . . 8 ⊢ ((𝑞 <_Q 𝑟 ∧ 𝑦 ∈ Q) → (𝑦 +_Q 𝑞) <_Q (𝑦 +_Q 𝑟))
17	4, 15, 16	syl2anc 391	. . . . . . 7 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))) → (𝑦 +_Q 𝑞) <_Q (𝑦 +_Q 𝑟))
18	9	simprd 107	. . . . . . . . 9 ⊢ (𝐴<_P 𝐵 → 𝐵 ∈ P)
19	5, 18	syl 14	. . . . . . . 8 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))) → 𝐵 ∈ P)
20	2	simprd 107	. . . . . . . 8 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))) → (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))
21		prop 6573	. . . . . . . . 9 ⊢ (𝐵 ∈ P → ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P)
22		prcunqu 6583	. . . . . . . . 9 ⊢ ((⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵)) → ((𝑦 +_Q 𝑞) <_Q (𝑦 +_Q 𝑟) → (𝑦 +_Q 𝑟) ∈ (2^nd ‘𝐵)))
23	21, 22	sylan 267	. . . . . . . 8 ⊢ ((𝐵 ∈ P ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵)) → ((𝑦 +_Q 𝑞) <_Q (𝑦 +_Q 𝑟) → (𝑦 +_Q 𝑟) ∈ (2^nd ‘𝐵)))
24	19, 20, 23	syl2anc 391	. . . . . . 7 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))) → ((𝑦 +_Q 𝑞) <_Q (𝑦 +_Q 𝑟) → (𝑦 +_Q 𝑟) ∈ (2^nd ‘𝐵)))
25	17, 24	mpd 13	. . . . . 6 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))) → (𝑦 +_Q 𝑟) ∈ (2^nd ‘𝐵))
26	1, 3, 25	jca32 293	. . . . 5 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))) → (𝑟 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑟) ∈ (2^nd ‘𝐵))))
27	26	eximi 1491	. . . 4 ⊢ (∃𝑦((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))) → ∃𝑦(𝑟 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑟) ∈ (2^nd ‘𝐵))))
28		ltexprlem.1	. . . . . . . . . 10 ⊢ 𝐶 = ⟨{𝑥 ∈ Q ∣ ∃𝑦(𝑦 ∈ (2^nd ‘𝐴) ∧ (𝑦 +_Q 𝑥) ∈ (1^st ‘𝐵))}, {𝑥 ∈ Q ∣ ∃𝑦(𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑥) ∈ (2^nd ‘𝐵))}⟩
29	28	ltexprlemelu 6697	. . . . . . . . 9 ⊢ (𝑞 ∈ (2^nd ‘𝐶) ↔ (𝑞 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))
30		19.42v 1786	. . . . . . . . 9 ⊢ (∃𝑦(𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))) ↔ (𝑞 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))
31	29, 30	bitr4i 176	. . . . . . . 8 ⊢ (𝑞 ∈ (2^nd ‘𝐶) ↔ ∃𝑦(𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))
32	31	anbi2i 430	. . . . . . 7 ⊢ ((𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐶)) ↔ (𝑞 <_Q 𝑟 ∧ ∃𝑦(𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵)))))
33		19.42v 1786	. . . . . . 7 ⊢ (∃𝑦(𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵)))) ↔ (𝑞 <_Q 𝑟 ∧ ∃𝑦(𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵)))))
34	32, 33	bitr4i 176	. . . . . 6 ⊢ ((𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐶)) ↔ ∃𝑦(𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵)))))
35	34	anbi2i 430	. . . . 5 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐶))) ↔ ((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ ∃𝑦(𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))))
36		19.42v 1786	. . . . 5 ⊢ (∃𝑦((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))) ↔ ((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ ∃𝑦(𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))))
37	35, 36	bitr4i 176	. . . 4 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐶))) ↔ ∃𝑦((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ (𝑞 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑞) ∈ (2^nd ‘𝐵))))))
38	28	ltexprlemelu 6697	. . . . 5 ⊢ (𝑟 ∈ (2^nd ‘𝐶) ↔ (𝑟 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑟) ∈ (2^nd ‘𝐵))))
39		19.42v 1786	. . . . 5 ⊢ (∃𝑦(𝑟 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑟) ∈ (2^nd ‘𝐵))) ↔ (𝑟 ∈ Q ∧ ∃𝑦(𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑟) ∈ (2^nd ‘𝐵))))
40	38, 39	bitr4i 176	. . . 4 ⊢ (𝑟 ∈ (2^nd ‘𝐶) ↔ ∃𝑦(𝑟 ∈ Q ∧ (𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑟) ∈ (2^nd ‘𝐵))))
41	27, 37, 40	3imtr4i 190	. . 3 ⊢ (((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) ∧ (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐶))) → 𝑟 ∈ (2^nd ‘𝐶))
42	41	ex 108	. 2 ⊢ ((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) → ((𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐶)) → 𝑟 ∈ (2^nd ‘𝐶)))
43	42	rexlimdvw 2436	1 ⊢ ((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) → (∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐶)) → 𝑟 ∈ (2^nd ‘𝐶)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 97 = 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-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-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-enq 6445 df-nqqs 6446 df-plqqs 6447 df-ltnqqs 6451 df-inp 6564 df-iltp 6568

This theorem is referenced by: ltexprlemrnd 6703

W3C validator