recexprlemopu - Intuitionistic Logic Explorer

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

Theorem recexprlemopu 7711

Description: The upper cut of 𝐵 is open. Lemma for recexpr 7722. (Contributed by Jim Kingdon, 28-Dec-2019.)

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

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

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

**Proof of Theorem recexprlemopu**
Step	Hyp	Ref	Expression
1		recexpr.1	. . . 4 ⊢ 𝐵 = ⟨{𝑥 ∣ ∃𝑦(𝑥 <_Q 𝑦 ∧ (_Q‘𝑦) ∈ (2^nd ‘𝐴))}, {𝑥 ∣ ∃𝑦(𝑦 <_Q 𝑥 ∧ (_Q‘𝑦) ∈ (1^st ‘𝐴))}⟩
2	1	recexprlemelu 7707	. . 3 ⊢ (𝑟 ∈ (2^nd ‘𝐵) ↔ ∃𝑦(𝑦 <_Q 𝑟 ∧ (*_Q‘𝑦) ∈ (1^st ‘𝐴)))
3		ltbtwnnqq 7499	. . . . . 6 ⊢ (𝑦 <_Q 𝑟 ↔ ∃𝑞 ∈ Q (𝑦 <_Q 𝑞 ∧ 𝑞 <_Q 𝑟))
4	3	biimpi 120	. . . . 5 ⊢ (𝑦 <_Q 𝑟 → ∃𝑞 ∈ Q (𝑦 <_Q 𝑞 ∧ 𝑞 <_Q 𝑟))
5		simplr 528	. . . . . . . 8 ⊢ (((𝑦 <_Q 𝑞 ∧ 𝑞 <_Q 𝑟) ∧ (*_Q‘𝑦) ∈ (1^st ‘𝐴)) → 𝑞 <_Q 𝑟)
6		19.8a 1604	. . . . . . . . . 10 ⊢ ((𝑦 <_Q 𝑞 ∧ (_Q‘𝑦) ∈ (1^st ‘𝐴)) → ∃𝑦(𝑦 <_Q 𝑞 ∧ (_Q‘𝑦) ∈ (1^st ‘𝐴)))
7	1	recexprlemelu 7707	. . . . . . . . . 10 ⊢ (𝑞 ∈ (2^nd ‘𝐵) ↔ ∃𝑦(𝑦 <_Q 𝑞 ∧ (*_Q‘𝑦) ∈ (1^st ‘𝐴)))
8	6, 7	sylibr 134	. . . . . . . . 9 ⊢ ((𝑦 <_Q 𝑞 ∧ (*_Q‘𝑦) ∈ (1^st ‘𝐴)) → 𝑞 ∈ (2^nd ‘𝐵))
9	8	adantlr 477	. . . . . . . 8 ⊢ (((𝑦 <_Q 𝑞 ∧ 𝑞 <_Q 𝑟) ∧ (*_Q‘𝑦) ∈ (1^st ‘𝐴)) → 𝑞 ∈ (2^nd ‘𝐵))
10	5, 9	jca 306	. . . . . . 7 ⊢ (((𝑦 <_Q 𝑞 ∧ 𝑞 <_Q 𝑟) ∧ (*_Q‘𝑦) ∈ (1^st ‘𝐴)) → (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐵)))
11	10	expcom 116	. . . . . 6 ⊢ ((*_Q‘𝑦) ∈ (1^st ‘𝐴) → ((𝑦 <_Q 𝑞 ∧ 𝑞 <_Q 𝑟) → (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐵))))
12	11	reximdv 2598	. . . . 5 ⊢ ((*_Q‘𝑦) ∈ (1^st ‘𝐴) → (∃𝑞 ∈ Q (𝑦 <_Q 𝑞 ∧ 𝑞 <_Q 𝑟) → ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐵))))
13	4, 12	mpan9 281	. . . 4 ⊢ ((𝑦 <_Q 𝑟 ∧ (*_Q‘𝑦) ∈ (1^st ‘𝐴)) → ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐵)))
14	13	exlimiv 1612	. . 3 ⊢ (∃𝑦(𝑦 <_Q 𝑟 ∧ (*_Q‘𝑦) ∈ (1^st ‘𝐴)) → ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐵)))
15	2, 14	sylbi 121	. 2 ⊢ (𝑟 ∈ (2^nd ‘𝐵) → ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐵)))
16	15	3ad2ant3 1022	1 ⊢ ((𝐴 ∈ P ∧ 𝑟 ∈ Q ∧ 𝑟 ∈ (2^nd ‘𝐵)) → ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐵)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 = wceq 1364 ∃wex 1506 ∈ wcel 2167 {cab 2182 ∃wrex 2476 ⟨cop 3626 class class class wbr 4034 ‘cfv 5259 1^st c1st 6205 2^nd c2nd 6206 Qcnq 7364 *_Qcrq 7368 <_Q cltq 7369 Pcnp 7375

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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4149 ax-sep 4152 ax-nul 4160 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-iinf 4625

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 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-ral 2480 df-rex 2481 df-reu 2482 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3452 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-tr 4133 df-eprel 4325 df-id 4329 df-po 4332 df-iso 4333 df-iord 4402 df-on 4404 df-suc 4407 df-iom 4628 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-f1 5264 df-fo 5265 df-f1o 5266 df-fv 5267 df-ov 5928 df-oprab 5929 df-mpo 5930 df-1st 6207 df-2nd 6208 df-recs 6372 df-irdg 6437 df-1o 6483 df-oadd 6487 df-omul 6488 df-er 6601 df-ec 6603 df-qs 6607 df-ni 7388 df-pli 7389 df-mi 7390 df-lti 7391 df-plpq 7428 df-mpq 7429 df-enq 7431 df-nqqs 7432 df-plqqs 7433 df-mqqs 7434 df-1nqqs 7435 df-rq 7436 df-ltnqqs 7437

This theorem is referenced by: recexprlemrnd 7713

W3C validator