Theorem axarch 8223

Description: Archimedean axiom. The Archimedean property is more naturally stated once we have defined ℕ. Unless we find another way to state it, we'll just use the right hand side of dfnn2 9260 in stating what we mean by "natural number" in the context of this axiom.

This construction-dependent theorem should not be referenced directly; instead, use ax-arch 8263. (Contributed by Jim Kingdon, 22-Apr-2020.) (New usage is discouraged.)

Assertion

Ref	Expression
axarch	⊢ (𝐴 ∈ ℝ → ∃𝑛 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 <ℝ 𝑛)

Distinct variable group:   𝐴,𝑛,𝑥,𝑦

Proof of Theorem axarch

Dummy variables 𝑙 𝑢 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elreal 8160	. . 3 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑧 ∈ R ⟨𝑧, 0R⟩ = 𝐴)
2	1	biimpi 120	. 2 ⊢ (𝐴 ∈ ℝ → ∃𝑧 ∈ R ⟨𝑧, 0R⟩ = 𝐴)
3		archsr 8114	. . . 4 ⊢ (𝑧 ∈ R → ∃𝑤 ∈ N 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )
4	3	ad2antrl 490	. . 3 ⊢ ((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) → ∃𝑤 ∈ N 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )
5		simplrr 538	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) → ⟨𝑧, 0R⟩ = 𝐴)
6		simprr 533	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) → 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )
7		ltresr 8171	. . . . . 6 ⊢ (⟨𝑧, 0R⟩ <ℝ ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ ↔ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )
8	6, 7	sylibr 134	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) → ⟨𝑧, 0R⟩ <ℝ ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩)
9	5, 8	eqbrtrrd 4139	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) → 𝐴 <ℝ ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩)
10		pitonn 8180	. . . . . 6 ⊢ (𝑤 ∈ N → ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)})
11	10	ad2antrl 490	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) → ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)})
12		simpr 110	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) ∧ 𝑛 = ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩) → 𝑛 = ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩)
13	12	breq2d 4127	. . . . 5 ⊢ ((((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) ∧ 𝑛 = ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩) → (𝐴 <ℝ 𝑛 ↔ 𝐴 <ℝ ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩))
14	11, 13	rspcedv 2927	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) → (𝐴 <ℝ ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ → ∃𝑛 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 <ℝ 𝑛))
15	9, 14	mpd 13	. . 3 ⊢ (((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) → ∃𝑛 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 <ℝ 𝑛)
16	4, 15	rexlimddv 2667	. 2 ⊢ ((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) → ∃𝑛 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 <ℝ 𝑛)
17	2, 16	rexlimddv 2667	1 ⊢ (𝐴 ∈ ℝ → ∃𝑛 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 <ℝ 𝑛)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1398   ∈ wcel 2205  {cab 2220  ∀wral 2522  ∃wrex 2523  ⟨cop 3698  ∩ cint 3955   class class class wbr 4115  (class class class)co 6059  1_oc1o 6654  [cec 6779  Ncnpi 7604   ~_Q ceq 7611   <_Q cltq 7617  1_Pc1p 7624   +_P cpp 7625   ~_R cer 7628  Rcnr 7629  0_Rc0r 7630   <_R cltr 7635  ℝcr 8143  1c1 8145   + caddc 8147   <_ℝ cltrr 8148

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4231  ax-sep 4234  ax-nul 4242  ax-pow 4293  ax-pr 4328  ax-un 4560  ax-setind 4665  ax-iinf 4716

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3677  df-sn 3701  df-pr 3702  df-op 3704  df-uni 3921  df-int 3956  df-iun 3999  df-br 4116  df-opab 4178  df-mpt 4179  df-tr 4215  df-eprel 4416  df-id 4420  df-po 4423  df-iso 4424  df-iord 4493  df-on 4495  df-suc 4498  df-iom 4719  df-xp 4761  df-rel 4762  df-cnv 4763  df-co 4764  df-dm 4765  df-rn 4766  df-res 4767  df-ima 4768  df-iota 5318  df-fun 5360  df-fn 5361  df-f 5362  df-f1 5363  df-fo 5364  df-f1o 5365  df-fv 5366  df-ov 6062  df-oprab 6063  df-mpo 6064  df-1st 6348  df-2nd 6349  df-recs 6550  df-irdg 6615  df-1o 6661  df-2o 6662  df-oadd 6665  df-omul 6666  df-er 6781  df-ec 6783  df-qs 6787  df-ni 7636  df-pli 7637  df-mi 7638  df-lti 7639  df-plpq 7676  df-mpq 7677  df-enq 7679  df-nqqs 7680  df-plqqs 7681  df-mqqs 7682  df-1nqqs 7683  df-rq 7684  df-ltnqqs 7685  df-enq0 7756  df-nq0 7757  df-0nq0 7758  df-plq0 7759  df-mq0 7760  df-inp 7798  df-i1p 7799  df-iplp 7800  df-iltp 7802  df-enr 8058  df-nr 8059  df-plr 8060  df-ltr 8062  df-0r 8063  df-1r 8064  df-c 8150  df-1 8152  df-r 8154  df-add 8155  df-lt 8157

This theorem is referenced by: (None)