archrecpr - Intuitionistic Logic Explorer

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

Theorem archrecpr 8031

Description: Archimedean principle for positive reals (reciprocal version). (Contributed by Jim Kingdon, 25-Nov-2020.)

**Assertion**
Ref	Expression
archrecpr	⊢ (𝐴 ∈ P → ∃𝑗 ∈ N ⟨{𝑙 ∣ 𝑙 <_Q (_Q‘[⟨𝑗, 1_o⟩] ~_Q )}, {𝑢 ∣ (_Q‘[⟨𝑗, 1_o⟩] ~_Q ) <_Q 𝑢}⟩<_P 𝐴)

Distinct variable groups: 𝐴,𝑗 𝑗,𝑙,𝑢 Allowed substitution hints: 𝐴(𝑢, 𝑙)

Proof of Theorem archrecpr Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		prop 7842	. . . 4 ⊢ (𝐴 ∈ P → ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P)
2		prml 7844	. . . 4 ⊢ (⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P → ∃𝑥 ∈ Q 𝑥 ∈ (1^st ‘𝐴))
3	1, 2	syl 14	. . 3 ⊢ (𝐴 ∈ P → ∃𝑥 ∈ Q 𝑥 ∈ (1^st ‘𝐴))
4		archrecnq 8030	. . . . 5 ⊢ (𝑥 ∈ Q → ∃𝑗 ∈ N (*_Q‘[⟨𝑗, 1_o⟩] ~_Q ) <_Q 𝑥)
5	4	ad2antrl 494	. . . 4 ⊢ ((𝐴 ∈ P ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (1^st ‘𝐴))) → ∃𝑗 ∈ N (*_Q‘[⟨𝑗, 1_o⟩] ~_Q ) <_Q 𝑥)
6	1	ad2antrr 492	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (1^st ‘𝐴))) ∧ 𝑗 ∈ N) → ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P)
7		simplrr 542	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (1^st ‘𝐴))) ∧ 𝑗 ∈ N) → 𝑥 ∈ (1^st ‘𝐴))
8		prcdnql 7851	. . . . . 6 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑥 ∈ (1^st ‘𝐴)) → ((_Q‘[⟨𝑗, 1_o⟩] ~_Q ) <_Q 𝑥 → (_Q‘[⟨𝑗, 1_o⟩] ~_Q ) ∈ (1^st ‘𝐴)))
9	6, 7, 8	syl2anc 415	. . . . 5 ⊢ (((𝐴 ∈ P ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (1^st ‘𝐴))) ∧ 𝑗 ∈ N) → ((_Q‘[⟨𝑗, 1_o⟩] ~_Q ) <_Q 𝑥 → (_Q‘[⟨𝑗, 1_o⟩] ~_Q ) ∈ (1^st ‘𝐴)))
10	9	reximdva 2652	. . . 4 ⊢ ((𝐴 ∈ P ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (1^st ‘𝐴))) → (∃𝑗 ∈ N (_Q‘[⟨𝑗, 1_o⟩] ~_Q ) <_Q 𝑥 → ∃𝑗 ∈ N (_Q‘[⟨𝑗, 1_o⟩] ~_Q ) ∈ (1^st ‘𝐴)))
11	5, 10	mpd 13	. . 3 ⊢ ((𝐴 ∈ P ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (1^st ‘𝐴))) → ∃𝑗 ∈ N (*_Q‘[⟨𝑗, 1_o⟩] ~_Q ) ∈ (1^st ‘𝐴))
12	3, 11	rexlimddv 2673	. 2 ⊢ (𝐴 ∈ P → ∃𝑗 ∈ N (*_Q‘[⟨𝑗, 1_o⟩] ~_Q ) ∈ (1^st ‘𝐴))
13		nnnq 7789	. . . . . 6 ⊢ (𝑗 ∈ N → [⟨𝑗, 1_o⟩] ~_Q ∈ Q)
14		recclnq 7759	. . . . . 6 ⊢ ([⟨𝑗, 1_o⟩] ~_Q ∈ Q → (*_Q‘[⟨𝑗, 1_o⟩] ~_Q ) ∈ Q)
15	13, 14	syl 14	. . . . 5 ⊢ (𝑗 ∈ N → (*_Q‘[⟨𝑗, 1_o⟩] ~_Q ) ∈ Q)
16	15	adantl 277	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝑗 ∈ N) → (*_Q‘[⟨𝑗, 1_o⟩] ~_Q ) ∈ Q)
17		simpl 109	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝑗 ∈ N) → 𝐴 ∈ P)
18		nqprl 7918	. . . 4 ⊢ (((_Q‘[⟨𝑗, 1_o⟩] ~_Q ) ∈ Q ∧ 𝐴 ∈ P) → ((_Q‘[⟨𝑗, 1_o⟩] ~_Q ) ∈ (1^st ‘𝐴) ↔ ⟨{𝑙 ∣ 𝑙 <_Q (_Q‘[⟨𝑗, 1_o⟩] ~_Q )}, {𝑢 ∣ (_Q‘[⟨𝑗, 1_o⟩] ~_Q ) <_Q 𝑢}⟩<_P 𝐴))
19	16, 17, 18	syl2anc 415	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝑗 ∈ N) → ((_Q‘[⟨𝑗, 1_o⟩] ~_Q ) ∈ (1^st ‘𝐴) ↔ ⟨{𝑙 ∣ 𝑙 <_Q (_Q‘[⟨𝑗, 1_o⟩] ~_Q )}, {𝑢 ∣ (*_Q‘[⟨𝑗, 1_o⟩] ~_Q ) <_Q 𝑢}⟩<_P 𝐴))
20	19	rexbidva 2547	. 2 ⊢ (𝐴 ∈ P → (∃𝑗 ∈ N (_Q‘[⟨𝑗, 1_o⟩] ~_Q ) ∈ (1^st ‘𝐴) ↔ ∃𝑗 ∈ N ⟨{𝑙 ∣ 𝑙 <_Q (_Q‘[⟨𝑗, 1_o⟩] ~_Q )}, {𝑢 ∣ (*_Q‘[⟨𝑗, 1_o⟩] ~_Q ) <_Q 𝑢}⟩<_P 𝐴))
21	12, 20	mpbid 147	1 ⊢ (𝐴 ∈ P → ∃𝑗 ∈ N ⟨{𝑙 ∣ 𝑙 <_Q (_Q‘[⟨𝑗, 1_o⟩] ~_Q )}, {𝑢 ∣ (_Q‘[⟨𝑗, 1_o⟩] ~_Q ) <_Q 𝑢}⟩<_P 𝐴)

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2209 {cab 2224 ∃wrex 2529 ⟨cop 3712 class class class wbr 4130 ‘cfv 5377 1^st c1st 6372 2^nd c2nd 6373 1_oc1o 6680 [cec 6805 Ncnpi 7639 ~_Q ceq 7646 Qcnq 7647 *_Qcrq 7651 <_Q cltq 7652 Pcnp 7658 <_P cltp 7662

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 df-iltp 7837

This theorem is used by: caucvgprprlemlim 8078

W3C validator