Theorem sgn3da 15164

Description: A conditional containing a signum is true if it is true in all three possible cases. (Contributed by Thierry Arnoux, 1-Oct-2018.)

Hypotheses

Ref	Expression
sgn3da.0	⊢ (𝜑 → 𝐴 ∈ ℝ*)
sgn3da.1	⊢ ((sgn‘𝐴) = 0 → (𝜓 ↔ 𝜒))
sgn3da.2	⊢ ((sgn‘𝐴) = 1 → (𝜓 ↔ 𝜃))
sgn3da.3	⊢ ((sgn‘𝐴) = -1 → (𝜓 ↔ 𝜏))
sgn3da.4	⊢ ((𝜑 ∧ 𝐴 = 0) → 𝜒)
sgn3da.5	⊢ ((𝜑 ∧ 0 < 𝐴) → 𝜃)
sgn3da.6	⊢ ((𝜑 ∧ 𝐴 < 0) → 𝜏)

Assertion

Ref	Expression
sgn3da	⊢ (𝜑 → 𝜓)

Proof of Theorem sgn3da

Step	Hyp	Ref	Expression
1		sgn3da.0	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℝ*)
2		sgnval 15151	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ* → (sgn‘𝐴) = if(𝐴 = 0, 0, if(𝐴 < 0, -1, 1)))
3	1, 2	syl 18	. . . . . . . 8 ⊢ (𝜑 → (sgn‘𝐴) = if(𝐴 = 0, 0, if(𝐴 < 0, -1, 1)))
4	3	eqeq2d 2777	. . . . . . 7 ⊢ (𝜑 → (0 = (sgn‘𝐴) ↔ 0 = if(𝐴 = 0, 0, if(𝐴 < 0, -1, 1))))
5	4	pm5.32i 585	. . . . . 6 ⊢ ((𝜑 ∧ 0 = (sgn‘𝐴)) ↔ (𝜑 ∧ 0 = if(𝐴 = 0, 0, if(𝐴 < 0, -1, 1))))
6		sgn3da.1	. . . . . . . . 9 ⊢ ((sgn‘𝐴) = 0 → (𝜓 ↔ 𝜒))
7	6	eqcoms 2774	. . . . . . . 8 ⊢ (0 = (sgn‘𝐴) → (𝜓 ↔ 𝜒))
8	7	bicomd 226	. . . . . . 7 ⊢ (0 = (sgn‘𝐴) → (𝜒 ↔ 𝜓))
9	8	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 0 = (sgn‘𝐴)) → (𝜒 ↔ 𝜓))
10	5, 9	sylbir 238	. . . . 5 ⊢ ((𝜑 ∧ 0 = if(𝐴 = 0, 0, if(𝐴 < 0, -1, 1))) → (𝜒 ↔ 𝜓))
11	10	expcom 419	. . . 4 ⊢ (0 = if(𝐴 = 0, 0, if(𝐴 < 0, -1, 1)) → (𝜑 → (𝜒 ↔ 𝜓)))
12	11	pm5.74d 276	. . 3 ⊢ (0 = if(𝐴 = 0, 0, if(𝐴 < 0, -1, 1)) → ((𝜑 → 𝜒) ↔ (𝜑 → 𝜓)))
13	3	eqeq2d 2777	. . . . . . 7 ⊢ (𝜑 → (if(𝐴 < 0, -1, 1) = (sgn‘𝐴) ↔ if(𝐴 < 0, -1, 1) = if(𝐴 = 0, 0, if(𝐴 < 0, -1, 1))))
14	13	pm5.32i 585	. . . . . 6 ⊢ ((𝜑 ∧ if(𝐴 < 0, -1, 1) = (sgn‘𝐴)) ↔ (𝜑 ∧ if(𝐴 < 0, -1, 1) = if(𝐴 = 0, 0, if(𝐴 < 0, -1, 1))))
15		eqeq1 2770	. . . . . . . . 9 ⊢ (-1 = if(𝐴 < 0, -1, 1) → (-1 = (sgn‘𝐴) ↔ if(𝐴 < 0, -1, 1) = (sgn‘𝐴)))
16	15	imbi1d 344	. . . . . . . 8 ⊢ (-1 = if(𝐴 < 0, -1, 1) → ((-1 = (sgn‘𝐴) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜓)) ↔ (if(𝐴 < 0, -1, 1) = (sgn‘𝐴) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜓))))
17		eqeq1 2770	. . . . . . . . 9 ⊢ (1 = if(𝐴 < 0, -1, 1) → (1 = (sgn‘𝐴) ↔ if(𝐴 < 0, -1, 1) = (sgn‘𝐴)))
18	17	imbi1d 344	. . . . . . . 8 ⊢ (1 = if(𝐴 < 0, -1, 1) → ((1 = (sgn‘𝐴) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜓)) ↔ (if(𝐴 < 0, -1, 1) = (sgn‘𝐴) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜓))))
19		sgn3da.6	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐴 < 0) → 𝜏)
20	19	adantr 486	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐴 < 0) ∧ (𝐴 < 0 → 𝜏)) → 𝜏)
21		simp2 1155	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐴 < 0) ∧ 𝜏 ∧ 𝐴 < 0) → 𝜏)
22	21	3expia 1139	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐴 < 0) ∧ 𝜏) → (𝐴 < 0 → 𝜏))
23	20, 22	impbida 813	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐴 < 0) → ((𝐴 < 0 → 𝜏) ↔ 𝜏))
24		pm3.24 408	. . . . . . . . . . . . . . . . 17 ⊢ ¬ (𝐴 < 0 ∧ ¬ 𝐴 < 0)
25	24	pm2.21i 120	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 < 0 ∧ ¬ 𝐴 < 0) → 𝜃)
26	25	adantl 487	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝐴 < 0 ∧ ¬ 𝐴 < 0)) → 𝜃)
27	26	expr 462	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝐴 < 0) → (¬ 𝐴 < 0 → 𝜃))
28		tbtru 1578	. . . . . . . . . . . . . 14 ⊢ ((¬ 𝐴 < 0 → 𝜃) ↔ ((¬ 𝐴 < 0 → 𝜃) ↔ ⊤))
29	27, 28	sylib 221	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐴 < 0) → ((¬ 𝐴 < 0 → 𝜃) ↔ ⊤))
30	23, 29	anbi12d 644	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 < 0) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ (𝜏 ∧ ⊤)))
31		ancom 466	. . . . . . . . . . . . 13 ⊢ ((𝜏 ∧ ⊤) ↔ (⊤ ∧ 𝜏))
32		truan 1581	. . . . . . . . . . . . 13 ⊢ ((⊤ ∧ 𝜏) ↔ 𝜏)
33	31, 32	bitri 278	. . . . . . . . . . . 12 ⊢ ((𝜏 ∧ ⊤) ↔ 𝜏)
34	30, 33	bitrdi 290	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 < 0) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜏))
35	34	3adant3 1150	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 < 0 ∧ -1 = (sgn‘𝐴)) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜏))
36		sgn3da.3	. . . . . . . . . . . 12 ⊢ ((sgn‘𝐴) = -1 → (𝜓 ↔ 𝜏))
37	36	eqcoms 2774	. . . . . . . . . . 11 ⊢ (-1 = (sgn‘𝐴) → (𝜓 ↔ 𝜏))
38	37	3ad2ant3 1153	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 < 0 ∧ -1 = (sgn‘𝐴)) → (𝜓 ↔ 𝜏))
39	35, 38	bitr4d 285	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 < 0 ∧ -1 = (sgn‘𝐴)) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜓))
40	39	3expia 1139	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 < 0) → (-1 = (sgn‘𝐴) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜓)))
41	19	3adant2 1149	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ ¬ 𝐴 < 0 ∧ 𝐴 < 0) → 𝜏)
42	41	3expia 1139	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ¬ 𝐴 < 0) → (𝐴 < 0 → 𝜏))
43		tbtru 1578	. . . . . . . . . . . . . 14 ⊢ ((𝐴 < 0 → 𝜏) ↔ ((𝐴 < 0 → 𝜏) ↔ ⊤))
44	42, 43	sylib 221	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ 𝐴 < 0) → ((𝐴 < 0 → 𝜏) ↔ ⊤))
45		pm3.35 815	. . . . . . . . . . . . . . 15 ⊢ ((¬ 𝐴 < 0 ∧ (¬ 𝐴 < 0 → 𝜃)) → 𝜃)
46	45	adantll 727	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ ¬ 𝐴 < 0) ∧ (¬ 𝐴 < 0 → 𝜃)) → 𝜃)
47		simp2 1155	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ ¬ 𝐴 < 0) ∧ 𝜃 ∧ ¬ 𝐴 < 0) → 𝜃)
48	47	3expia 1139	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ ¬ 𝐴 < 0) ∧ 𝜃) → (¬ 𝐴 < 0 → 𝜃))
49	46, 48	impbida 813	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ 𝐴 < 0) → ((¬ 𝐴 < 0 → 𝜃) ↔ 𝜃))
50	44, 49	anbi12d 644	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝐴 < 0) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ (⊤ ∧ 𝜃)))
51		truan 1581	. . . . . . . . . . . 12 ⊢ ((⊤ ∧ 𝜃) ↔ 𝜃)
52	50, 51	bitrdi 290	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝐴 < 0) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜃))
53	52	3adant3 1150	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 < 0 ∧ 1 = (sgn‘𝐴)) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜃))
54		sgn3da.2	. . . . . . . . . . . 12 ⊢ ((sgn‘𝐴) = 1 → (𝜓 ↔ 𝜃))
55	54	eqcoms 2774	. . . . . . . . . . 11 ⊢ (1 = (sgn‘𝐴) → (𝜓 ↔ 𝜃))
56	55	3ad2ant3 1153	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 < 0 ∧ 1 = (sgn‘𝐴)) → (𝜓 ↔ 𝜃))
57	53, 56	bitr4d 285	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐴 < 0 ∧ 1 = (sgn‘𝐴)) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜓))
58	57	3expia 1139	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐴 < 0) → (1 = (sgn‘𝐴) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜓)))
59	16, 18, 40, 58	ifbothda 4531	. . . . . . 7 ⊢ (𝜑 → (if(𝐴 < 0, -1, 1) = (sgn‘𝐴) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜓)))
60	59	imp 412	. . . . . 6 ⊢ ((𝜑 ∧ if(𝐴 < 0, -1, 1) = (sgn‘𝐴)) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜓))
61	14, 60	sylbir 238	. . . . 5 ⊢ ((𝜑 ∧ if(𝐴 < 0, -1, 1) = if(𝐴 = 0, 0, if(𝐴 < 0, -1, 1))) → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜓))
62	61	expcom 419	. . . 4 ⊢ (if(𝐴 < 0, -1, 1) = if(𝐴 = 0, 0, if(𝐴 < 0, -1, 1)) → (𝜑 → (((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)) ↔ 𝜓)))
63	62	pm5.74d 276	. . 3 ⊢ (if(𝐴 < 0, -1, 1) = if(𝐴 = 0, 0, if(𝐴 < 0, -1, 1)) → ((𝜑 → ((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃))) ↔ (𝜑 → 𝜓)))
64		sgn3da.4	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 0) → 𝜒)
65	64	expcom 419	. . . 4 ⊢ (𝐴 = 0 → (𝜑 → 𝜒))
66	65	adantl 487	. . 3 ⊢ ((⊤ ∧ 𝐴 = 0) → (𝜑 → 𝜒))
67	19	ex 418	. . . . . . 7 ⊢ (𝜑 → (𝐴 < 0 → 𝜏))
68	67	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐴 = 0) → (𝐴 < 0 → 𝜏))
69		simp1 1154	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐴 = 0 ∧ ¬ 𝐴 < 0) → 𝜑)
70		df-ne 2962	. . . . . . . . . . . 12 ⊢ (𝐴 ≠ 0 ↔ ¬ 𝐴 = 0)
71		0xr 11274	. . . . . . . . . . . . 13 ⊢ 0 ∈ ℝ*
72		xrlttri2 13185	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℝ* ∧ 0 ∈ ℝ*) → (𝐴 ≠ 0 ↔ (𝐴 < 0 ∨ 0 < 𝐴)))
73	1, 71, 72	sylancl 598	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴 ≠ 0 ↔ (𝐴 < 0 ∨ 0 < 𝐴)))
74	70, 73	bitr3id 288	. . . . . . . . . . 11 ⊢ (𝜑 → (¬ 𝐴 = 0 ↔ (𝐴 < 0 ∨ 0 < 𝐴)))
75	74	biimpa 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 = 0) → (𝐴 < 0 ∨ 0 < 𝐴))
76	75	ord 878	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐴 = 0) → (¬ 𝐴 < 0 → 0 < 𝐴))
77	76	3impia 1135	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐴 = 0 ∧ ¬ 𝐴 < 0) → 0 < 𝐴)
78		sgn3da.5	. . . . . . . 8 ⊢ ((𝜑 ∧ 0 < 𝐴) → 𝜃)
79	69, 77, 78	syl2anc 596	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐴 = 0 ∧ ¬ 𝐴 < 0) → 𝜃)
80	79	3expia 1139	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐴 = 0) → (¬ 𝐴 < 0 → 𝜃))
81	68, 80	jca 521	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐴 = 0) → ((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃)))
82	81	expcom 419	. . . 4 ⊢ (¬ 𝐴 = 0 → (𝜑 → ((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃))))
83	82	adantl 487	. . 3 ⊢ ((⊤ ∧ ¬ 𝐴 = 0) → (𝜑 → ((𝐴 < 0 → 𝜏) ∧ (¬ 𝐴 < 0 → 𝜃))))
84	12, 63, 66, 83	ifbothda 4531	. 2 ⊢ (⊤ → (𝜑 → 𝜓))
85	84	mptru 1577	1 ⊢ (𝜑 → 𝜓)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570  ⊤wtru 1571   ∈ wcel 2146   ≠ wne 2961  ifcif 4492   class class class wbr 5114  ‘cfv 6543  0cc0 11118  1c1 11119  ℝ^*cxr 11260   < clt 11261  -cneg 11460  sgncsgn 15149

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745  ax-cnex 11174  ax-resscn 11175  ax-1cn 11176  ax-icn 11177  ax-addcl 11178  ax-addrcl 11179  ax-mulcl 11180  ax-i2m1 11186  ax-rnegex 11189  ax-cnre 11191  ax-pre-lttri 11192  ax-pre-lttrn 11193

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-po 5574  df-so 5575  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-er 8703  df-en 8953  df-dom 8954  df-sdom 8955  df-pnf 11263  df-mnf 11264  df-xr 11265  df-ltxr 11266  df-neg 11462  df-sgn 15150

This theorem is used by:  sgn0bi  15166  sgnnbi  15167  sgnpbi  15168  sgnsub  15169  sgnmul  15170  sgnsgn  33212