ellogdm - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ellogdm		Structured version Visualization version GIF version

Theorem ellogdm 25804

Description: Elementhood in the "continuous domain" of the complex logarithm. (Contributed by Mario Carneiro, 18-Feb-2015.)

**Hypothesis**
Ref	Expression
logcn.d	⊢ 𝐷 = (ℂ ∖ (-∞(,]0))

**Assertion**
Ref	Expression
ellogdm	⊢ (𝐴 ∈ 𝐷 ↔ (𝐴 ∈ ℂ ∧ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ⁺)))

**Proof of Theorem ellogdm**
Step	Hyp	Ref	Expression
1		logcn.d	. . 3 ⊢ 𝐷 = (ℂ ∖ (-∞(,]0))
2	1	eleq2i 2830	. 2 ⊢ (𝐴 ∈ 𝐷 ↔ 𝐴 ∈ (ℂ ∖ (-∞(,]0)))
3		eldif 3896	. 2 ⊢ (𝐴 ∈ (ℂ ∖ (-∞(,]0)) ↔ (𝐴 ∈ ℂ ∧ ¬ 𝐴 ∈ (-∞(,]0)))
4		mnfxr 11042	. . . . . . 7 ⊢ -∞ ∈ ℝ^*
5		0re 10987	. . . . . . 7 ⊢ 0 ∈ ℝ
6		elioc2 13152	. . . . . . 7 ⊢ ((-∞ ∈ ℝ^* ∧ 0 ∈ ℝ) → (𝐴 ∈ (-∞(,]0) ↔ (𝐴 ∈ ℝ ∧ -∞ < 𝐴 ∧ 𝐴 ≤ 0)))
7	4, 5, 6	mp2an 689	. . . . . 6 ⊢ (𝐴 ∈ (-∞(,]0) ↔ (𝐴 ∈ ℝ ∧ -∞ < 𝐴 ∧ 𝐴 ≤ 0))
8		df-3an 1088	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ -∞ < 𝐴 ∧ 𝐴 ≤ 0) ↔ ((𝐴 ∈ ℝ ∧ -∞ < 𝐴) ∧ 𝐴 ≤ 0))
9		mnflt 12869	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → -∞ < 𝐴)
10	9	pm4.71i 560	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ ↔ (𝐴 ∈ ℝ ∧ -∞ < 𝐴))
11	10	anbi1i 624	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) ↔ ((𝐴 ∈ ℝ ∧ -∞ < 𝐴) ∧ 𝐴 ≤ 0))
12		lenlt 11063	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 ≤ 0 ↔ ¬ 0 < 𝐴))
13	5, 12	mpan2 688	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (𝐴 ≤ 0 ↔ ¬ 0 < 𝐴))
14		elrp 12742	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℝ⁺ ↔ (𝐴 ∈ ℝ ∧ 0 < 𝐴))
15	14	baib 536	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ → (𝐴 ∈ ℝ⁺ ↔ 0 < 𝐴))
16	15	notbid 318	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (¬ 𝐴 ∈ ℝ⁺ ↔ ¬ 0 < 𝐴))
17	13, 16	bitr4d 281	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (𝐴 ≤ 0 ↔ ¬ 𝐴 ∈ ℝ⁺))
18	17	pm5.32i 575	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) ↔ (𝐴 ∈ ℝ ∧ ¬ 𝐴 ∈ ℝ⁺))
19	11, 18	bitr3i 276	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ -∞ < 𝐴) ∧ 𝐴 ≤ 0) ↔ (𝐴 ∈ ℝ ∧ ¬ 𝐴 ∈ ℝ⁺))
20	7, 8, 19	3bitri 297	. . . . 5 ⊢ (𝐴 ∈ (-∞(,]0) ↔ (𝐴 ∈ ℝ ∧ ¬ 𝐴 ∈ ℝ⁺))
21	20	notbii 320	. . . 4 ⊢ (¬ 𝐴 ∈ (-∞(,]0) ↔ ¬ (𝐴 ∈ ℝ ∧ ¬ 𝐴 ∈ ℝ⁺))
22		iman 402	. . . 4 ⊢ ((𝐴 ∈ ℝ → 𝐴 ∈ ℝ⁺) ↔ ¬ (𝐴 ∈ ℝ ∧ ¬ 𝐴 ∈ ℝ⁺))
23	21, 22	bitr4i 277	. . 3 ⊢ (¬ 𝐴 ∈ (-∞(,]0) ↔ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ⁺))
24	23	anbi2i 623	. 2 ⊢ ((𝐴 ∈ ℂ ∧ ¬ 𝐴 ∈ (-∞(,]0)) ↔ (𝐴 ∈ ℂ ∧ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ⁺)))
25	2, 3, 24	3bitri 297	1 ⊢ (𝐴 ∈ 𝐷 ↔ (𝐴 ∈ ℂ ∧ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ⁺)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ∖ cdif 3883 class class class wbr 5073 (class class class)co 7267 ℂcc 10879 ℝcr 10880 0cc0 10881 -∞cmnf 11017 ℝ^*cxr 11018 < clt 11019 ≤ cle 11020 ℝ⁺crp 12740 (,]cioc 13090

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5221 ax-nul 5228 ax-pow 5286 ax-pr 5350 ax-un 7578 ax-cnex 10937 ax-resscn 10938 ax-1cn 10939 ax-addrcl 10942 ax-rnegex 10952 ax-cnre 10954 ax-pre-lttri 10955 ax-pre-lttrn 10956

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3431 df-sbc 3716 df-csb 3832 df-dif 3889 df-un 3891 df-in 3893 df-ss 3903 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5074 df-opab 5136 df-mpt 5157 df-id 5484 df-po 5498 df-so 5499 df-xp 5590 df-rel 5591 df-cnv 5592 df-co 5593 df-dm 5594 df-rn 5595 df-res 5596 df-ima 5597 df-iota 6384 df-fun 6428 df-fn 6429 df-f 6430 df-f1 6431 df-fo 6432 df-f1o 6433 df-fv 6434 df-ov 7270 df-oprab 7271 df-mpo 7272 df-er 8485 df-en 8721 df-dom 8722 df-sdom 8723 df-pnf 11021 df-mnf 11022 df-xr 11023 df-ltxr 11024 df-le 11025 df-rp 12741 df-ioc 13094

This theorem is referenced by: logdmn0 25805 logdmnrp 25806 logdmss 25807 logcnlem2 25808 logcnlem3 25809 logcnlem4 25810 logcnlem5 25811 logcn 25812 dvloglem 25813 logf1o2 25815 cxpcn 25908 cxpcn2 25909 dmlogdmgm 26183 rpdmgm 26184 lgamgulmlem2 26189 lgamcvg2 26214 logdivsqrle 32638 binomcxplemdvbinom 41952

W3C validator