Theorem axarch 7057

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 8041 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 7095. (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 6997	. . 3 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑧 ∈ R ⟨𝑧, 0R⟩ = 𝐴)
2	1	biimpi 118	. 2 ⊢ (𝐴 ∈ ℝ → ∃𝑧 ∈ R ⟨𝑧, 0R⟩ = 𝐴)
3		archsr 6958	. . . 4 ⊢ (𝑧 ∈ R → ∃𝑤 ∈ N 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )
4	3	ad2antrl 473	. . 3 ⊢ ((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) → ∃𝑤 ∈ N 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )
5		simplrr 502	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) → ⟨𝑧, 0R⟩ = 𝐴)
6		simprr 498	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) → 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )
7		ltresr 7007	. . . . . 6 ⊢ (⟨𝑧, 0R⟩ <ℝ ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ ↔ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )
8	6, 7	sylibr 132	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) → ⟨𝑧, 0R⟩ <ℝ ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩)
9	5, 8	eqbrtrrd 3807	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) → 𝐴 <ℝ ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩)
10		pitonn 7016	. . . . . 6 ⊢ (𝑤 ∈ N → ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)})
11	10	ad2antrl 473	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) → ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)})
12		simpr 108	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) ∧ 𝑛 = ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩) → 𝑛 = ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩)
13	12	breq2d 3797	. . . . 5 ⊢ ((((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) ∧ 𝑛 = ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩) → (𝐴 <ℝ 𝑛 ↔ 𝐴 <ℝ ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩))
14	11, 13	rspcedv 2705	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) → (𝐴 <ℝ ⟨[⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ → ∃𝑛 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 <ℝ 𝑛))
15	9, 14	mpd 13	. . 3 ⊢ (((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) ∧ (𝑤 ∈ N ∧ 𝑧 <R [⟨(⟨{𝑙 ∣ 𝑙 <Q [⟨𝑤, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝑤, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )) → ∃𝑛 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 <ℝ 𝑛)
16	4, 15	rexlimddv 2481	. 2 ⊢ ((𝐴 ∈ ℝ ∧ (𝑧 ∈ R ∧ ⟨𝑧, 0R⟩ = 𝐴)) → ∃𝑛 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 <ℝ 𝑛)
17	2, 16	rexlimddv 2481	1 ⊢ (𝐴 ∈ ℝ → ∃𝑛 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 <ℝ 𝑛)

Syntax hints:   → wi 4   ∧ wa 102   = wceq 1284   ∈ wcel 1433  {cab 2067  ∀wral 2348  ∃wrex 2349  ⟨cop 3401  ∩ cint 3636   class class class wbr 3785  (class class class)co 5532  1_𝑜c1o 6017  [cec 6127  Ncnpi 6462   ~_Q ceq 6469   <_Q cltq 6475  1_Pc1p 6482   +_P cpp 6483   ~_R cer 6486  Rcnr 6487  0_Rc0r 6488   <_R cltr 6493  ℝcr 6980  1c1 6982   + caddc 6984   <_ℝ cltrr 6985

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-coll 3893  ax-sep 3896  ax-nul 3904  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-iinf 4329

This theorem depends on definitions:  df-bi 115  df-dc 776  df-3or 920  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-tr 3876  df-eprel 4044  df-id 4048  df-po 4051  df-iso 4052  df-iord 4121  df-on 4123  df-suc 4126  df-iom 4332  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-1st 5787  df-2nd 5788  df-recs 5943  df-irdg 5980  df-1o 6024  df-2o 6025  df-oadd 6028  df-omul 6029  df-er 6129  df-ec 6131  df-qs 6135  df-ni 6494  df-pli 6495  df-mi 6496  df-lti 6497  df-plpq 6534  df-mpq 6535  df-enq 6537  df-nqqs 6538  df-plqqs 6539  df-mqqs 6540  df-1nqqs 6541  df-rq 6542  df-ltnqqs 6543  df-enq0 6614  df-nq0 6615  df-0nq0 6616  df-plq0 6617  df-mq0 6618  df-inp 6656  df-i1p 6657  df-iplp 6658  df-iltp 6660  df-enr 6903  df-nr 6904  df-plr 6905  df-ltr 6907  df-0r 6908  df-1r 6909  df-c 6987  df-1 6989  df-r 6991  df-add 6992  df-lt 6994

This theorem is referenced by: (None)