Theorem axarch 8222

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 9256 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 8262. (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 8159	. . 3 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑧 ∈ R ⟨𝑧, 0R⟩ = 𝐴)
2	1	biimpi 120	. 2 ⊢ (𝐴 ∈ ℝ → ∃𝑧 ∈ R ⟨𝑧, 0R⟩ = 𝐴)
3		archsr 8113	. . . 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 8170	. . . . . 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 4138	. . . 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 8179	. . . . . 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 4126	. . . . 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 3697  ∩ cint 3954   class class class wbr 4114  (class class class)co 6058  1_oc1o 6653  [cec 6778  Ncnpi 7603   ~_Q ceq 7610   <_Q cltq 7616  1_Pc1p 7623   +_P cpp 7624   ~_R cer 7627  Rcnr 7628  0_Rc0r 7629   <_R cltr 7634  ℝcr 8142  1c1 8144   + caddc 8146   <_ℝ cltrr 8147

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 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715

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 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-eprel 4415  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-irdg 6614  df-1o 6660  df-2o 6661  df-oadd 6664  df-omul 6665  df-er 6780  df-ec 6782  df-qs 6786  df-ni 7635  df-pli 7636  df-mi 7637  df-lti 7638  df-plpq 7675  df-mpq 7676  df-enq 7678  df-nqqs 7679  df-plqqs 7680  df-mqqs 7681  df-1nqqs 7682  df-rq 7683  df-ltnqqs 7684  df-enq0 7755  df-nq0 7756  df-0nq0 7757  df-plq0 7758  df-mq0 7759  df-inp 7797  df-i1p 7798  df-iplp 7799  df-iltp 7801  df-enr 8057  df-nr 8058  df-plr 8059  df-ltr 8061  df-0r 8062  df-1r 8063  df-c 8149  df-1 8151  df-r 8153  df-add 8154  df-lt 8156

This theorem is referenced by: (None)