reeff1olem - Intuitionistic Logic Explorer

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

Theorem reeff1olem 15007

Description: Lemma for reeff1o 15009. (Contributed by Paul Chapman, 18-Oct-2007.) (Revised by Mario Carneiro, 30-Apr-2014.)

**Assertion**
Ref	Expression
reeff1olem	⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → ∃𝑥 ∈ ℝ (exp‘𝑥) = 𝑈)

Distinct variable group: 𝑥,𝑈

Proof of Theorem reeff1olem Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ioossicc 10034	. . 3 ⊢ (0(,)𝑈) ⊆ (0[,]𝑈)
2		0re 8026	. . . . 5 ⊢ 0 ∈ ℝ
3		iccssre 10030	. . . . 5 ⊢ ((0 ∈ ℝ ∧ 𝑈 ∈ ℝ) → (0[,]𝑈) ⊆ ℝ)
4	2, 3	mpan 424	. . . 4 ⊢ (𝑈 ∈ ℝ → (0[,]𝑈) ⊆ ℝ)
5	4	adantr 276	. . 3 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → (0[,]𝑈) ⊆ ℝ)
6	1, 5	sstrid 3194	. 2 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → (0(,)𝑈) ⊆ ℝ)
7	2	a1i 9	. . 3 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → 0 ∈ ℝ)
8		simpl 109	. . 3 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → 𝑈 ∈ ℝ)
9		0lt1 8153	. . . . 5 ⊢ 0 < 1
10		1re 8025	. . . . . 6 ⊢ 1 ∈ ℝ
11		lttr 8100	. . . . . 6 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑈 ∈ ℝ) → ((0 < 1 ∧ 1 < 𝑈) → 0 < 𝑈))
12	2, 10, 11	mp3an12 1338	. . . . 5 ⊢ (𝑈 ∈ ℝ → ((0 < 1 ∧ 1 < 𝑈) → 0 < 𝑈))
13	9, 12	mpani 430	. . . 4 ⊢ (𝑈 ∈ ℝ → (1 < 𝑈 → 0 < 𝑈))
14	13	imp 124	. . 3 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → 0 < 𝑈)
15		ax-resscn 7971	. . . 4 ⊢ ℝ ⊆ ℂ
16	5, 15	sstrdi 3195	. . 3 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → (0[,]𝑈) ⊆ ℂ)
17		efcn 15004	. . . 4 ⊢ exp ∈ (ℂ–cn→ℂ)
18	17	a1i 9	. . 3 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → exp ∈ (ℂ–cn→ℂ))
19		ssel2 3178	. . . . 5 ⊢ (((0[,]𝑈) ⊆ ℝ ∧ 𝑦 ∈ (0[,]𝑈)) → 𝑦 ∈ ℝ)
20	19	reefcld 11834	. . . 4 ⊢ (((0[,]𝑈) ⊆ ℝ ∧ 𝑦 ∈ (0[,]𝑈)) → (exp‘𝑦) ∈ ℝ)
21	5, 20	sylan 283	. . 3 ⊢ (((𝑈 ∈ ℝ ∧ 1 < 𝑈) ∧ 𝑦 ∈ (0[,]𝑈)) → (exp‘𝑦) ∈ ℝ)
22		ef0 11837	. . . . 5 ⊢ (exp‘0) = 1
23		simpr 110	. . . . 5 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → 1 < 𝑈)
24	22, 23	eqbrtrid 4068	. . . 4 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → (exp‘0) < 𝑈)
25		peano2re 8162	. . . . . 6 ⊢ (𝑈 ∈ ℝ → (𝑈 + 1) ∈ ℝ)
26	25	adantr 276	. . . . 5 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → (𝑈 + 1) ∈ ℝ)
27		reefcl 11833	. . . . . 6 ⊢ (𝑈 ∈ ℝ → (exp‘𝑈) ∈ ℝ)
28	27	adantr 276	. . . . 5 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → (exp‘𝑈) ∈ ℝ)
29		ltp1 8871	. . . . . 6 ⊢ (𝑈 ∈ ℝ → 𝑈 < (𝑈 + 1))
30	29	adantr 276	. . . . 5 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → 𝑈 < (𝑈 + 1))
31	8	recnd 8055	. . . . . . 7 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → 𝑈 ∈ ℂ)
32		ax-1cn 7972	. . . . . . 7 ⊢ 1 ∈ ℂ
33		addcom 8163	. . . . . . 7 ⊢ ((𝑈 ∈ ℂ ∧ 1 ∈ ℂ) → (𝑈 + 1) = (1 + 𝑈))
34	31, 32, 33	sylancl 413	. . . . . 6 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → (𝑈 + 1) = (1 + 𝑈))
35	8, 14	elrpd 9768	. . . . . . 7 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → 𝑈 ∈ ℝ⁺)
36		efgt1p 11861	. . . . . . 7 ⊢ (𝑈 ∈ ℝ⁺ → (1 + 𝑈) < (exp‘𝑈))
37	35, 36	syl 14	. . . . . 6 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → (1 + 𝑈) < (exp‘𝑈))
38	34, 37	eqbrtrd 4055	. . . . 5 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → (𝑈 + 1) < (exp‘𝑈))
39	8, 26, 28, 30, 38	lttrd 8152	. . . 4 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → 𝑈 < (exp‘𝑈))
40	24, 39	jca 306	. . 3 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → ((exp‘0) < 𝑈 ∧ 𝑈 < (exp‘𝑈)))
41		simplll 533	. . . . . . 7 ⊢ ((((𝑈 ∈ ℝ ∧ 1 < 𝑈) ∧ 𝑦 ∈ (0[,]𝑈)) ∧ (𝑧 ∈ (0[,]𝑈) ∧ 𝑦 < 𝑧)) → 𝑈 ∈ ℝ)
42	2, 41, 3	sylancr 414	. . . . . 6 ⊢ ((((𝑈 ∈ ℝ ∧ 1 < 𝑈) ∧ 𝑦 ∈ (0[,]𝑈)) ∧ (𝑧 ∈ (0[,]𝑈) ∧ 𝑦 < 𝑧)) → (0[,]𝑈) ⊆ ℝ)
43		simplr 528	. . . . . 6 ⊢ ((((𝑈 ∈ ℝ ∧ 1 < 𝑈) ∧ 𝑦 ∈ (0[,]𝑈)) ∧ (𝑧 ∈ (0[,]𝑈) ∧ 𝑦 < 𝑧)) → 𝑦 ∈ (0[,]𝑈))
44	42, 43	sseldd 3184	. . . . 5 ⊢ ((((𝑈 ∈ ℝ ∧ 1 < 𝑈) ∧ 𝑦 ∈ (0[,]𝑈)) ∧ (𝑧 ∈ (0[,]𝑈) ∧ 𝑦 < 𝑧)) → 𝑦 ∈ ℝ)
45		simprl 529	. . . . . 6 ⊢ ((((𝑈 ∈ ℝ ∧ 1 < 𝑈) ∧ 𝑦 ∈ (0[,]𝑈)) ∧ (𝑧 ∈ (0[,]𝑈) ∧ 𝑦 < 𝑧)) → 𝑧 ∈ (0[,]𝑈))
46	42, 45	sseldd 3184	. . . . 5 ⊢ ((((𝑈 ∈ ℝ ∧ 1 < 𝑈) ∧ 𝑦 ∈ (0[,]𝑈)) ∧ (𝑧 ∈ (0[,]𝑈) ∧ 𝑦 < 𝑧)) → 𝑧 ∈ ℝ)
47	44, 46	jca 306	. . . 4 ⊢ ((((𝑈 ∈ ℝ ∧ 1 < 𝑈) ∧ 𝑦 ∈ (0[,]𝑈)) ∧ (𝑧 ∈ (0[,]𝑈) ∧ 𝑦 < 𝑧)) → (𝑦 ∈ ℝ ∧ 𝑧 ∈ ℝ))
48		simprr 531	. . . 4 ⊢ ((((𝑈 ∈ ℝ ∧ 1 < 𝑈) ∧ 𝑦 ∈ (0[,]𝑈)) ∧ (𝑧 ∈ (0[,]𝑈) ∧ 𝑦 < 𝑧)) → 𝑦 < 𝑧)
49		efltim 11863	. . . 4 ⊢ ((𝑦 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (𝑦 < 𝑧 → (exp‘𝑦) < (exp‘𝑧)))
50	47, 48, 49	sylc 62	. . 3 ⊢ ((((𝑈 ∈ ℝ ∧ 1 < 𝑈) ∧ 𝑦 ∈ (0[,]𝑈)) ∧ (𝑧 ∈ (0[,]𝑈) ∧ 𝑦 < 𝑧)) → (exp‘𝑦) < (exp‘𝑧))
51	7, 8, 8, 14, 16, 18, 21, 40, 50	ivthinc 14879	. 2 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → ∃𝑥 ∈ (0(,)𝑈)(exp‘𝑥) = 𝑈)
52		ssrexv 3248	. 2 ⊢ ((0(,)𝑈) ⊆ ℝ → (∃𝑥 ∈ (0(,)𝑈)(exp‘𝑥) = 𝑈 → ∃𝑥 ∈ ℝ (exp‘𝑥) = 𝑈))
53	6, 51, 52	sylc 62	1 ⊢ ((𝑈 ∈ ℝ ∧ 1 < 𝑈) → ∃𝑥 ∈ ℝ (exp‘𝑥) = 𝑈)

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2167 ∃wrex 2476 ⊆ wss 3157 class class class wbr 4033 ‘cfv 5258 (class class class)co 5922 ℂcc 7877 ℝcr 7878 0cc0 7879 1c1 7880 + caddc 7882 < clt 8061 ℝ⁺crp 9728 (,)cioo 9963 [,]cicc 9966 expce 11807 –cn→ccncf 14806

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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4148 ax-sep 4151 ax-nul 4159 ax-pow 4207 ax-pr 4242 ax-un 4468 ax-setind 4573 ax-iinf 4624 ax-cnex 7970 ax-resscn 7971 ax-1cn 7972 ax-1re 7973 ax-icn 7974 ax-addcl 7975 ax-addrcl 7976 ax-mulcl 7977 ax-mulrcl 7978 ax-addcom 7979 ax-mulcom 7980 ax-addass 7981 ax-mulass 7982 ax-distr 7983 ax-i2m1 7984 ax-0lt1 7985 ax-1rid 7986 ax-0id 7987 ax-rnegex 7988 ax-precex 7989 ax-cnre 7990 ax-pre-ltirr 7991 ax-pre-ltwlin 7992 ax-pre-lttrn 7993 ax-pre-apti 7994 ax-pre-ltadd 7995 ax-pre-mulgt0 7996 ax-pre-mulext 7997 ax-arch 7998 ax-caucvg 7999 ax-pre-suploc 8000 ax-addf 8001 ax-mulf 8002

This theorem depends on definitions: df-bi 117 df-stab 832 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3451 df-if 3562 df-pw 3607 df-sn 3628 df-pr 3629 df-op 3631 df-uni 3840 df-int 3875 df-iun 3918 df-disj 4011 df-br 4034 df-opab 4095 df-mpt 4096 df-tr 4132 df-id 4328 df-po 4331 df-iso 4332 df-iord 4401 df-on 4403 df-ilim 4404 df-suc 4406 df-iom 4627 df-xp 4669 df-rel 4670 df-cnv 4671 df-co 4672 df-dm 4673 df-rn 4674 df-res 4675 df-ima 4676 df-iota 5219 df-fun 5260 df-fn 5261 df-f 5262 df-f1 5263 df-fo 5264 df-f1o 5265 df-fv 5266 df-isom 5267 df-riota 5877 df-ov 5925 df-oprab 5926 df-mpo 5927 df-of 6135 df-1st 6198 df-2nd 6199 df-recs 6363 df-irdg 6428 df-frec 6449 df-1o 6474 df-oadd 6478 df-er 6592 df-map 6709 df-pm 6710 df-en 6800 df-dom 6801 df-fin 6802 df-sup 7050 df-inf 7051 df-pnf 8063 df-mnf 8064 df-xr 8065 df-ltxr 8066 df-le 8067 df-sub 8199 df-neg 8200 df-reap 8602 df-ap 8609 df-div 8700 df-inn 8991 df-2 9049 df-3 9050 df-4 9051 df-n0 9250 df-z 9327 df-uz 9602 df-q 9694 df-rp 9729 df-xneg 9847 df-xadd 9848 df-ioo 9967 df-ico 9969 df-icc 9970 df-fz 10084 df-fzo 10218 df-seqfrec 10540 df-exp 10631 df-fac 10818 df-bc 10840 df-ihash 10868 df-shft 10980 df-cj 11007 df-re 11008 df-im 11009 df-rsqrt 11163 df-abs 11164 df-clim 11444 df-sumdc 11519 df-ef 11813 df-rest 12912 df-topgen 12931 df-psmet 14099 df-xmet 14100 df-met 14101 df-bl 14102 df-mopn 14103 df-top 14234 df-topon 14247 df-bases 14279 df-ntr 14332 df-cn 14424 df-cnp 14425 df-tx 14489 df-cncf 14807 df-limced 14892 df-dvap 14893

This theorem is referenced by: reeff1oleme 15008 reeff1o 15009

W3C validator