recexprlempr - Intuitionistic Logic Explorer

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

Theorem recexprlempr 7999

Description: 𝐵 is a positive real. Lemma for recexpr 8005. (Contributed by Jim Kingdon, 27-Dec-2019.)

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

**Assertion**
Ref	Expression
recexprlempr	⊢ (𝐴 ∈ P → 𝐵 ∈ P)

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

Proof of Theorem recexprlempr Dummy variables 𝑟 𝑞 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		recexpr.1	. . . 4 ⊢ 𝐵 = ⟨{𝑥 ∣ ∃𝑦(𝑥 <_Q 𝑦 ∧ (_Q‘𝑦) ∈ (2^nd ‘𝐴))}, {𝑥 ∣ ∃𝑦(𝑦 <_Q 𝑥 ∧ (_Q‘𝑦) ∈ (1^st ‘𝐴))}⟩
2	1	recexprlemm 7991	. . 3 ⊢ (𝐴 ∈ P → (∃𝑞 ∈ Q 𝑞 ∈ (1^st ‘𝐵) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2^nd ‘𝐵)))
3		ltrelnq 7732	. . . . . . . . . . 11 ⊢ <_Q ⊆ (Q × Q)
4	3	brel 4827	. . . . . . . . . 10 ⊢ (𝑥 <_Q 𝑦 → (𝑥 ∈ Q ∧ 𝑦 ∈ Q))
5	4	simpld 112	. . . . . . . . 9 ⊢ (𝑥 <_Q 𝑦 → 𝑥 ∈ Q)
6	5	adantr 276	. . . . . . . 8 ⊢ ((𝑥 <_Q 𝑦 ∧ (*_Q‘𝑦) ∈ (2^nd ‘𝐴)) → 𝑥 ∈ Q)
7	6	exlimiv 1651	. . . . . . 7 ⊢ (∃𝑦(𝑥 <_Q 𝑦 ∧ (*_Q‘𝑦) ∈ (2^nd ‘𝐴)) → 𝑥 ∈ Q)
8	7	abssi 3323	. . . . . 6 ⊢ {𝑥 ∣ ∃𝑦(𝑥 <_Q 𝑦 ∧ (*_Q‘𝑦) ∈ (2^nd ‘𝐴))} ⊆ Q
9		nqex 7730	. . . . . . 7 ⊢ Q ∈ V
10	9	elpw2 4293	. . . . . 6 ⊢ ({𝑥 ∣ ∃𝑦(𝑥 <_Q 𝑦 ∧ (_Q‘𝑦) ∈ (2^nd ‘𝐴))} ∈ 𝒫 Q ↔ {𝑥 ∣ ∃𝑦(𝑥 <_Q 𝑦 ∧ (_Q‘𝑦) ∈ (2^nd ‘𝐴))} ⊆ Q)
11	8, 10	mpbir 146	. . . . 5 ⊢ {𝑥 ∣ ∃𝑦(𝑥 <_Q 𝑦 ∧ (*_Q‘𝑦) ∈ (2^nd ‘𝐴))} ∈ 𝒫 Q
12	3	brel 4827	. . . . . . . . . 10 ⊢ (𝑦 <_Q 𝑥 → (𝑦 ∈ Q ∧ 𝑥 ∈ Q))
13	12	simprd 114	. . . . . . . . 9 ⊢ (𝑦 <_Q 𝑥 → 𝑥 ∈ Q)
14	13	adantr 276	. . . . . . . 8 ⊢ ((𝑦 <_Q 𝑥 ∧ (*_Q‘𝑦) ∈ (1^st ‘𝐴)) → 𝑥 ∈ Q)
15	14	exlimiv 1651	. . . . . . 7 ⊢ (∃𝑦(𝑦 <_Q 𝑥 ∧ (*_Q‘𝑦) ∈ (1^st ‘𝐴)) → 𝑥 ∈ Q)
16	15	abssi 3323	. . . . . 6 ⊢ {𝑥 ∣ ∃𝑦(𝑦 <_Q 𝑥 ∧ (*_Q‘𝑦) ∈ (1^st ‘𝐴))} ⊆ Q
17	9	elpw2 4293	. . . . . 6 ⊢ ({𝑥 ∣ ∃𝑦(𝑦 <_Q 𝑥 ∧ (_Q‘𝑦) ∈ (1^st ‘𝐴))} ∈ 𝒫 Q ↔ {𝑥 ∣ ∃𝑦(𝑦 <_Q 𝑥 ∧ (_Q‘𝑦) ∈ (1^st ‘𝐴))} ⊆ Q)
18	16, 17	mpbir 146	. . . . 5 ⊢ {𝑥 ∣ ∃𝑦(𝑦 <_Q 𝑥 ∧ (*_Q‘𝑦) ∈ (1^st ‘𝐴))} ∈ 𝒫 Q
19		opelxpi 4806	. . . . 5 ⊢ (({𝑥 ∣ ∃𝑦(𝑥 <_Q 𝑦 ∧ (_Q‘𝑦) ∈ (2^nd ‘𝐴))} ∈ 𝒫 Q ∧ {𝑥 ∣ ∃𝑦(𝑦 <_Q 𝑥 ∧ (_Q‘𝑦) ∈ (1^st ‘𝐴))} ∈ 𝒫 Q) → ⟨{𝑥 ∣ ∃𝑦(𝑥 <_Q 𝑦 ∧ (_Q‘𝑦) ∈ (2^nd ‘𝐴))}, {𝑥 ∣ ∃𝑦(𝑦 <_Q 𝑥 ∧ (_Q‘𝑦) ∈ (1^st ‘𝐴))}⟩ ∈ (𝒫 Q × 𝒫 Q))
20	11, 18, 19	mp2an 430	. . . 4 ⊢ ⟨{𝑥 ∣ ∃𝑦(𝑥 <_Q 𝑦 ∧ (_Q‘𝑦) ∈ (2^nd ‘𝐴))}, {𝑥 ∣ ∃𝑦(𝑦 <_Q 𝑥 ∧ (_Q‘𝑦) ∈ (1^st ‘𝐴))}⟩ ∈ (𝒫 Q × 𝒫 Q)
21	1, 20	eqeltri 2311	. . 3 ⊢ 𝐵 ∈ (𝒫 Q × 𝒫 Q)
22	2, 21	jctil 312	. 2 ⊢ (𝐴 ∈ P → (𝐵 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞 ∈ Q 𝑞 ∈ (1^st ‘𝐵) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2^nd ‘𝐵))))
23	1	recexprlemrnd 7996	. . 3 ⊢ (𝐴 ∈ P → (∀𝑞 ∈ Q (𝑞 ∈ (1^st ‘𝐵) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐵))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2^nd ‘𝐵) ↔ ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐵)))))
24	1	recexprlemdisj 7997	. . 3 ⊢ (𝐴 ∈ P → ∀𝑞 ∈ Q ¬ (𝑞 ∈ (1^st ‘𝐵) ∧ 𝑞 ∈ (2^nd ‘𝐵)))
25	1	recexprlemloc 7998	. . 3 ⊢ (𝐴 ∈ P → ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <_Q 𝑟 → (𝑞 ∈ (1^st ‘𝐵) ∨ 𝑟 ∈ (2^nd ‘𝐵))))
26	23, 24, 25	3jca 1208	. 2 ⊢ (𝐴 ∈ P → ((∀𝑞 ∈ Q (𝑞 ∈ (1^st ‘𝐵) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐵))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2^nd ‘𝐵) ↔ ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐵)))) ∧ ∀𝑞 ∈ Q ¬ (𝑞 ∈ (1^st ‘𝐵) ∧ 𝑞 ∈ (2^nd ‘𝐵)) ∧ ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <_Q 𝑟 → (𝑞 ∈ (1^st ‘𝐵) ∨ 𝑟 ∈ (2^nd ‘𝐵)))))
27		elnp1st2nd 7843	. 2 ⊢ (𝐵 ∈ P ↔ ((𝐵 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞 ∈ Q 𝑞 ∈ (1^st ‘𝐵) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2^nd ‘𝐵))) ∧ ((∀𝑞 ∈ Q (𝑞 ∈ (1^st ‘𝐵) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐵))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2^nd ‘𝐵) ↔ ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐵)))) ∧ ∀𝑞 ∈ Q ¬ (𝑞 ∈ (1^st ‘𝐵) ∧ 𝑞 ∈ (2^nd ‘𝐵)) ∧ ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <_Q 𝑟 → (𝑞 ∈ (1^st ‘𝐵) ∨ 𝑟 ∈ (2^nd ‘𝐵))))))
28	22, 26, 27	sylanbrc 421	1 ⊢ (𝐴 ∈ P → 𝐵 ∈ P)

Colors of variables: wff set class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 720 ∧ w3a 1009 = wceq 1402 ∃wex 1545 ∈ wcel 2209 {cab 2224 ∀wral 2528 ∃wrex 2529 ⊆ wss 3220 𝒫 cpw 3688 ⟨cop 3712 class class class wbr 4130 × cxp 4772 ‘cfv 5377 1^st c1st 6372 2^nd c2nd 6373 Qcnq 7647 *_Qcrq 7651 <_Q cltq 7652 Pcnp 7658

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735

This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-eprel 4434 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-irdg 6641 df-1o 6687 df-oadd 6691 df-omul 6692 df-er 6807 df-ec 6809 df-qs 6813 df-ni 7671 df-pli 7672 df-mi 7673 df-lti 7674 df-plpq 7711 df-mpq 7712 df-enq 7714 df-nqqs 7715 df-plqqs 7716 df-mqqs 7717 df-1nqqs 7718 df-rq 7719 df-ltnqqs 7720 df-inp 7833

This theorem is used by: recexprlem1ssl 8000 recexprlem1ssu 8001 recexprlemss1l 8002 recexprlemss1u 8003 recexprlemex 8004 recexpr 8005

W3C validator