recexprlemm - Intuitionistic Logic Explorer

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

Theorem recexprlemm 7641

Description: 𝐵 is inhabited. Lemma for recexpr 7655. (Contributed by Jim Kingdon, 27-Dec-2019.)

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

**Assertion**
Ref	Expression
recexprlemm	⊢ (𝐴 ∈ P → (∃𝑞 ∈ Q 𝑞 ∈ (1^st ‘𝐵) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2^nd ‘𝐵)))

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

**Proof of Theorem recexprlemm**
Step	Hyp	Ref	Expression
1		prop 7492	. . 3 ⊢ (𝐴 ∈ P → ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P)
2		prmu 7495	. . 3 ⊢ (⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P → ∃𝑥 ∈ Q 𝑥 ∈ (2^nd ‘𝐴))
3		recclnq 7409	. . . . . . 7 ⊢ (𝑥 ∈ Q → (*_Q‘𝑥) ∈ Q)
4		nsmallnqq 7429	. . . . . . 7 ⊢ ((_Q‘𝑥) ∈ Q → ∃𝑞 ∈ Q 𝑞 <_Q (_Q‘𝑥))
5	3, 4	syl 14	. . . . . 6 ⊢ (𝑥 ∈ Q → ∃𝑞 ∈ Q 𝑞 <_Q (*_Q‘𝑥))
6	5	adantr 276	. . . . 5 ⊢ ((𝑥 ∈ Q ∧ 𝑥 ∈ (2^nd ‘𝐴)) → ∃𝑞 ∈ Q 𝑞 <_Q (*_Q‘𝑥))
7		recrecnq 7411	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ Q → (_Q‘(_Q‘𝑥)) = 𝑥)
8	7	eleq1d 2258	. . . . . . . . . . 11 ⊢ (𝑥 ∈ Q → ((_Q‘(_Q‘𝑥)) ∈ (2^nd ‘𝐴) ↔ 𝑥 ∈ (2^nd ‘𝐴)))
9	8	anbi2d 464	. . . . . . . . . 10 ⊢ (𝑥 ∈ Q → ((𝑞 <_Q (_Q‘𝑥) ∧ (_Q‘(_Q‘𝑥)) ∈ (2^nd ‘𝐴)) ↔ (𝑞 <_Q (_Q‘𝑥) ∧ 𝑥 ∈ (2^nd ‘𝐴))))
10		breq2 4022	. . . . . . . . . . . . 13 ⊢ (𝑦 = (_Q‘𝑥) → (𝑞 <_Q 𝑦 ↔ 𝑞 <_Q (_Q‘𝑥)))
11		fveq2 5530	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (_Q‘𝑥) → (_Q‘𝑦) = (_Q‘(_Q‘𝑥)))
12	11	eleq1d 2258	. . . . . . . . . . . . 13 ⊢ (𝑦 = (_Q‘𝑥) → ((_Q‘𝑦) ∈ (2^nd ‘𝐴) ↔ (_Q‘(_Q‘𝑥)) ∈ (2^nd ‘𝐴)))
13	10, 12	anbi12d 473	. . . . . . . . . . . 12 ⊢ (𝑦 = (_Q‘𝑥) → ((𝑞 <_Q 𝑦 ∧ (_Q‘𝑦) ∈ (2^nd ‘𝐴)) ↔ (𝑞 <_Q (_Q‘𝑥) ∧ (_Q‘(*_Q‘𝑥)) ∈ (2^nd ‘𝐴))))
14	13	spcegv 2840	. . . . . . . . . . 11 ⊢ ((_Q‘𝑥) ∈ Q → ((𝑞 <_Q (_Q‘𝑥) ∧ (_Q‘(_Q‘𝑥)) ∈ (2^nd ‘𝐴)) → ∃𝑦(𝑞 <_Q 𝑦 ∧ (*_Q‘𝑦) ∈ (2^nd ‘𝐴))))
15	3, 14	syl 14	. . . . . . . . . 10 ⊢ (𝑥 ∈ Q → ((𝑞 <_Q (_Q‘𝑥) ∧ (_Q‘(_Q‘𝑥)) ∈ (2^nd ‘𝐴)) → ∃𝑦(𝑞 <_Q 𝑦 ∧ (_Q‘𝑦) ∈ (2^nd ‘𝐴))))
16	9, 15	sylbird 170	. . . . . . . . 9 ⊢ (𝑥 ∈ Q → ((𝑞 <_Q (_Q‘𝑥) ∧ 𝑥 ∈ (2^nd ‘𝐴)) → ∃𝑦(𝑞 <_Q 𝑦 ∧ (_Q‘𝑦) ∈ (2^nd ‘𝐴))))
17		recexpr.1	. . . . . . . . . 10 ⊢ 𝐵 = ⟨{𝑥 ∣ ∃𝑦(𝑥 <_Q 𝑦 ∧ (_Q‘𝑦) ∈ (2^nd ‘𝐴))}, {𝑥 ∣ ∃𝑦(𝑦 <_Q 𝑥 ∧ (_Q‘𝑦) ∈ (1^st ‘𝐴))}⟩
18	17	recexprlemell 7639	. . . . . . . . 9 ⊢ (𝑞 ∈ (1^st ‘𝐵) ↔ ∃𝑦(𝑞 <_Q 𝑦 ∧ (*_Q‘𝑦) ∈ (2^nd ‘𝐴)))
19	16, 18	imbitrrdi 162	. . . . . . . 8 ⊢ (𝑥 ∈ Q → ((𝑞 <_Q (*_Q‘𝑥) ∧ 𝑥 ∈ (2^nd ‘𝐴)) → 𝑞 ∈ (1^st ‘𝐵)))
20	19	expcomd 1452	. . . . . . 7 ⊢ (𝑥 ∈ Q → (𝑥 ∈ (2^nd ‘𝐴) → (𝑞 <_Q (*_Q‘𝑥) → 𝑞 ∈ (1^st ‘𝐵))))
21	20	imp 124	. . . . . 6 ⊢ ((𝑥 ∈ Q ∧ 𝑥 ∈ (2^nd ‘𝐴)) → (𝑞 <_Q (*_Q‘𝑥) → 𝑞 ∈ (1^st ‘𝐵)))
22	21	reximdv 2591	. . . . 5 ⊢ ((𝑥 ∈ Q ∧ 𝑥 ∈ (2^nd ‘𝐴)) → (∃𝑞 ∈ Q 𝑞 <_Q (*_Q‘𝑥) → ∃𝑞 ∈ Q 𝑞 ∈ (1^st ‘𝐵)))
23	6, 22	mpd 13	. . . 4 ⊢ ((𝑥 ∈ Q ∧ 𝑥 ∈ (2^nd ‘𝐴)) → ∃𝑞 ∈ Q 𝑞 ∈ (1^st ‘𝐵))
24	23	rexlimiva 2602	. . 3 ⊢ (∃𝑥 ∈ Q 𝑥 ∈ (2^nd ‘𝐴) → ∃𝑞 ∈ Q 𝑞 ∈ (1^st ‘𝐵))
25	1, 2, 24	3syl 17	. 2 ⊢ (𝐴 ∈ P → ∃𝑞 ∈ Q 𝑞 ∈ (1^st ‘𝐵))
26		prml 7494	. . 3 ⊢ (⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P → ∃𝑥 ∈ Q 𝑥 ∈ (1^st ‘𝐴))
27		1nq 7383	. . . . . . . 8 ⊢ 1_Q ∈ Q
28		addclnq 7392	. . . . . . . 8 ⊢ (((_Q‘𝑥) ∈ Q ∧ 1_Q ∈ Q) → ((_Q‘𝑥) +_Q 1_Q) ∈ Q)
29	3, 27, 28	sylancl 413	. . . . . . 7 ⊢ (𝑥 ∈ Q → ((*_Q‘𝑥) +_Q 1_Q) ∈ Q)
30		ltaddnq 7424	. . . . . . . 8 ⊢ (((_Q‘𝑥) ∈ Q ∧ 1_Q ∈ Q) → (_Q‘𝑥) <_Q ((*_Q‘𝑥) +_Q 1_Q))
31	3, 27, 30	sylancl 413	. . . . . . 7 ⊢ (𝑥 ∈ Q → (_Q‘𝑥) <_Q ((_Q‘𝑥) +_Q 1_Q))
32		breq2 4022	. . . . . . . 8 ⊢ (𝑟 = ((_Q‘𝑥) +_Q 1_Q) → ((_Q‘𝑥) <_Q 𝑟 ↔ (_Q‘𝑥) <_Q ((_Q‘𝑥) +_Q 1_Q)))
33	32	rspcev 2856	. . . . . . 7 ⊢ ((((_Q‘𝑥) +_Q 1_Q) ∈ Q ∧ (_Q‘𝑥) <_Q ((_Q‘𝑥) +_Q 1_Q)) → ∃𝑟 ∈ Q (_Q‘𝑥) <_Q 𝑟)
34	29, 31, 33	syl2anc 411	. . . . . 6 ⊢ (𝑥 ∈ Q → ∃𝑟 ∈ Q (*_Q‘𝑥) <_Q 𝑟)
35	34	adantr 276	. . . . 5 ⊢ ((𝑥 ∈ Q ∧ 𝑥 ∈ (1^st ‘𝐴)) → ∃𝑟 ∈ Q (*_Q‘𝑥) <_Q 𝑟)
36	7	eleq1d 2258	. . . . . . . . . . 11 ⊢ (𝑥 ∈ Q → ((_Q‘(_Q‘𝑥)) ∈ (1^st ‘𝐴) ↔ 𝑥 ∈ (1^st ‘𝐴)))
37	36	anbi2d 464	. . . . . . . . . 10 ⊢ (𝑥 ∈ Q → (((_Q‘𝑥) <_Q 𝑟 ∧ (_Q‘(_Q‘𝑥)) ∈ (1^st ‘𝐴)) ↔ ((_Q‘𝑥) <_Q 𝑟 ∧ 𝑥 ∈ (1^st ‘𝐴))))
38		breq1 4021	. . . . . . . . . . . . 13 ⊢ (𝑦 = (_Q‘𝑥) → (𝑦 <_Q 𝑟 ↔ (_Q‘𝑥) <_Q 𝑟))
39	11	eleq1d 2258	. . . . . . . . . . . . 13 ⊢ (𝑦 = (_Q‘𝑥) → ((_Q‘𝑦) ∈ (1^st ‘𝐴) ↔ (_Q‘(_Q‘𝑥)) ∈ (1^st ‘𝐴)))
40	38, 39	anbi12d 473	. . . . . . . . . . . 12 ⊢ (𝑦 = (_Q‘𝑥) → ((𝑦 <_Q 𝑟 ∧ (_Q‘𝑦) ∈ (1^st ‘𝐴)) ↔ ((_Q‘𝑥) <_Q 𝑟 ∧ (_Q‘(*_Q‘𝑥)) ∈ (1^st ‘𝐴))))
41	40	spcegv 2840	. . . . . . . . . . 11 ⊢ ((_Q‘𝑥) ∈ Q → (((_Q‘𝑥) <_Q 𝑟 ∧ (_Q‘(_Q‘𝑥)) ∈ (1^st ‘𝐴)) → ∃𝑦(𝑦 <_Q 𝑟 ∧ (*_Q‘𝑦) ∈ (1^st ‘𝐴))))
42	3, 41	syl 14	. . . . . . . . . 10 ⊢ (𝑥 ∈ Q → (((_Q‘𝑥) <_Q 𝑟 ∧ (_Q‘(_Q‘𝑥)) ∈ (1^st ‘𝐴)) → ∃𝑦(𝑦 <_Q 𝑟 ∧ (_Q‘𝑦) ∈ (1^st ‘𝐴))))
43	37, 42	sylbird 170	. . . . . . . . 9 ⊢ (𝑥 ∈ Q → (((_Q‘𝑥) <_Q 𝑟 ∧ 𝑥 ∈ (1^st ‘𝐴)) → ∃𝑦(𝑦 <_Q 𝑟 ∧ (_Q‘𝑦) ∈ (1^st ‘𝐴))))
44	17	recexprlemelu 7640	. . . . . . . . 9 ⊢ (𝑟 ∈ (2^nd ‘𝐵) ↔ ∃𝑦(𝑦 <_Q 𝑟 ∧ (*_Q‘𝑦) ∈ (1^st ‘𝐴)))
45	43, 44	imbitrrdi 162	. . . . . . . 8 ⊢ (𝑥 ∈ Q → (((*_Q‘𝑥) <_Q 𝑟 ∧ 𝑥 ∈ (1^st ‘𝐴)) → 𝑟 ∈ (2^nd ‘𝐵)))
46	45	expcomd 1452	. . . . . . 7 ⊢ (𝑥 ∈ Q → (𝑥 ∈ (1^st ‘𝐴) → ((*_Q‘𝑥) <_Q 𝑟 → 𝑟 ∈ (2^nd ‘𝐵))))
47	46	imp 124	. . . . . 6 ⊢ ((𝑥 ∈ Q ∧ 𝑥 ∈ (1^st ‘𝐴)) → ((*_Q‘𝑥) <_Q 𝑟 → 𝑟 ∈ (2^nd ‘𝐵)))
48	47	reximdv 2591	. . . . 5 ⊢ ((𝑥 ∈ Q ∧ 𝑥 ∈ (1^st ‘𝐴)) → (∃𝑟 ∈ Q (*_Q‘𝑥) <_Q 𝑟 → ∃𝑟 ∈ Q 𝑟 ∈ (2^nd ‘𝐵)))
49	35, 48	mpd 13	. . . 4 ⊢ ((𝑥 ∈ Q ∧ 𝑥 ∈ (1^st ‘𝐴)) → ∃𝑟 ∈ Q 𝑟 ∈ (2^nd ‘𝐵))
50	49	rexlimiva 2602	. . 3 ⊢ (∃𝑥 ∈ Q 𝑥 ∈ (1^st ‘𝐴) → ∃𝑟 ∈ Q 𝑟 ∈ (2^nd ‘𝐵))
51	1, 26, 50	3syl 17	. 2 ⊢ (𝐴 ∈ P → ∃𝑟 ∈ Q 𝑟 ∈ (2^nd ‘𝐵))
52	25, 51	jca 306	1 ⊢ (𝐴 ∈ P → (∃𝑞 ∈ Q 𝑞 ∈ (1^st ‘𝐵) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2^nd ‘𝐵)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∃wex 1503 ∈ wcel 2160 {cab 2175 ∃wrex 2469 ⟨cop 3610 class class class wbr 4018 ‘cfv 5231 (class class class)co 5891 1^st c1st 6157 2^nd c2nd 6158 Qcnq 7297 1_Qc1q 7298 +_Q cplq 7299 *_Qcrq 7301 <_Q cltq 7302 Pcnp 7308

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 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-coll 4133 ax-sep 4136 ax-nul 4144 ax-pow 4189 ax-pr 4224 ax-un 4448 ax-setind 4551 ax-iinf 4602

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 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-ral 2473 df-rex 2474 df-reu 2475 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-nul 3438 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-int 3860 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-tr 4117 df-eprel 4304 df-id 4308 df-iord 4381 df-on 4383 df-suc 4386 df-iom 4605 df-xp 4647 df-rel 4648 df-cnv 4649 df-co 4650 df-dm 4651 df-rn 4652 df-res 4653 df-ima 4654 df-iota 5193 df-fun 5233 df-fn 5234 df-f 5235 df-f1 5236 df-fo 5237 df-f1o 5238 df-fv 5239 df-ov 5894 df-oprab 5895 df-mpo 5896 df-1st 6159 df-2nd 6160 df-recs 6324 df-irdg 6389 df-1o 6435 df-oadd 6439 df-omul 6440 df-er 6553 df-ec 6555 df-qs 6559 df-ni 7321 df-pli 7322 df-mi 7323 df-lti 7324 df-plpq 7361 df-mpq 7362 df-enq 7364 df-nqqs 7365 df-plqqs 7366 df-mqqs 7367 df-1nqqs 7368 df-rq 7369 df-ltnqqs 7370 df-inp 7483

This theorem is referenced by: recexprlempr 7649

W3C validator