Theorem stadd3i 32729

Description: If the sum of 3 states is 3, then each state is 1. (Contributed by NM, 13-Nov-1999.) (New usage is discouraged.)

Hypotheses

Ref	Expression
stle.1	⊢ 𝐴 ∈ Cℋ
stle.2	⊢ 𝐵 ∈ Cℋ
stm1add3.3	⊢ 𝐶 ∈ Cℋ

Assertion

Ref	Expression
stadd3i	⊢ (𝑆 ∈ States → ((((𝑆‘𝐴) + (𝑆‘𝐵)) + (𝑆‘𝐶)) = 3 → (𝑆‘𝐴) = 1))

Proof of Theorem stadd3i

Step	Hyp	Ref	Expression
1		stle.1	. . . . . 6 ⊢ 𝐴 ∈ Cℋ
2		stcl 32697	. . . . . 6 ⊢ (𝑆 ∈ States → (𝐴 ∈ Cℋ → (𝑆‘𝐴) ∈ ℝ))
3	1, 2	mpi 21	. . . . 5 ⊢ (𝑆 ∈ States → (𝑆‘𝐴) ∈ ℝ)
4	3	recnd 11261	. . . 4 ⊢ (𝑆 ∈ States → (𝑆‘𝐴) ∈ ℂ)
5		stle.2	. . . . . 6 ⊢ 𝐵 ∈ Cℋ
6		stcl 32697	. . . . . 6 ⊢ (𝑆 ∈ States → (𝐵 ∈ Cℋ → (𝑆‘𝐵) ∈ ℝ))
7	5, 6	mpi 21	. . . . 5 ⊢ (𝑆 ∈ States → (𝑆‘𝐵) ∈ ℝ)
8	7	recnd 11261	. . . 4 ⊢ (𝑆 ∈ States → (𝑆‘𝐵) ∈ ℂ)
9		stm1add3.3	. . . . . 6 ⊢ 𝐶 ∈ Cℋ
10		stcl 32697	. . . . . 6 ⊢ (𝑆 ∈ States → (𝐶 ∈ Cℋ → (𝑆‘𝐶) ∈ ℝ))
11	9, 10	mpi 21	. . . . 5 ⊢ (𝑆 ∈ States → (𝑆‘𝐶) ∈ ℝ)
12	11	recnd 11261	. . . 4 ⊢ (𝑆 ∈ States → (𝑆‘𝐶) ∈ ℂ)
13	4, 8, 12	addassd 11255	. . 3 ⊢ (𝑆 ∈ States → (((𝑆‘𝐴) + (𝑆‘𝐵)) + (𝑆‘𝐶)) = ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))))
14	13	eqeq1d 2762	. 2 ⊢ (𝑆 ∈ States → ((((𝑆‘𝐴) + (𝑆‘𝐵)) + (𝑆‘𝐶)) = 3 ↔ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) = 3))
15		eqcom 2767	. . . 4 ⊢ (((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) = 3 ↔ 3 = ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))))
16	7, 11	readdcld 11262	. . . . . . 7 ⊢ (𝑆 ∈ States → ((𝑆‘𝐵) + (𝑆‘𝐶)) ∈ ℝ)
17	3, 16	readdcld 11262	. . . . . 6 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ∈ ℝ)
18		ltne 11331	. . . . . . 7 ⊢ ((((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ∈ ℝ ∧ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3) → 3 ≠ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))))
19	18	ex 418	. . . . . 6 ⊢ (((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ∈ ℝ → (((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3 → 3 ≠ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶)))))
20	17, 19	syl 18	. . . . 5 ⊢ (𝑆 ∈ States → (((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3 → 3 ≠ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶)))))
21	20	necon2bd 2971	. . . 4 ⊢ (𝑆 ∈ States → (3 = ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) → ¬ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3))
22	15, 21	biimtrid 245	. . 3 ⊢ (𝑆 ∈ States → (((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) = 3 → ¬ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3))
23		1re 11232	. . . . . . . . . . 11 ⊢ 1 ∈ ℝ
24	23, 23	readdcli 11248	. . . . . . . . . 10 ⊢ (1 + 1) ∈ ℝ
25	24	a1i 11	. . . . . . . . 9 ⊢ (𝑆 ∈ States → (1 + 1) ∈ ℝ)
26		1red 11233	. . . . . . . . . 10 ⊢ (𝑆 ∈ States → 1 ∈ ℝ)
27		stle1 32706	. . . . . . . . . . 11 ⊢ (𝑆 ∈ States → (𝐵 ∈ Cℋ → (𝑆‘𝐵) ≤ 1))
28	5, 27	mpi 21	. . . . . . . . . 10 ⊢ (𝑆 ∈ States → (𝑆‘𝐵) ≤ 1)
29		stle1 32706	. . . . . . . . . . 11 ⊢ (𝑆 ∈ States → (𝐶 ∈ Cℋ → (𝑆‘𝐶) ≤ 1))
30	9, 29	mpi 21	. . . . . . . . . 10 ⊢ (𝑆 ∈ States → (𝑆‘𝐶) ≤ 1)
31	7, 11, 26, 26, 28, 30	le2addd 11857	. . . . . . . . 9 ⊢ (𝑆 ∈ States → ((𝑆‘𝐵) + (𝑆‘𝐶)) ≤ (1 + 1))
32	16, 25, 3, 31	leadd2dd 11853	. . . . . . . 8 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ≤ ((𝑆‘𝐴) + (1 + 1)))
33	32	adantr 486	. . . . . . 7 ⊢ ((𝑆 ∈ States ∧ (𝑆‘𝐴) < 1) → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ≤ ((𝑆‘𝐴) + (1 + 1)))
34		ltadd1 11705	. . . . . . . . . 10 ⊢ (((𝑆‘𝐴) ∈ ℝ ∧ 1 ∈ ℝ ∧ (1 + 1) ∈ ℝ) → ((𝑆‘𝐴) < 1 ↔ ((𝑆‘𝐴) + (1 + 1)) < (1 + (1 + 1))))
35	34	biimpd 232	. . . . . . . . 9 ⊢ (((𝑆‘𝐴) ∈ ℝ ∧ 1 ∈ ℝ ∧ (1 + 1) ∈ ℝ) → ((𝑆‘𝐴) < 1 → ((𝑆‘𝐴) + (1 + 1)) < (1 + (1 + 1))))
36	3, 26, 25, 35	syl3anc 1398	. . . . . . . 8 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) < 1 → ((𝑆‘𝐴) + (1 + 1)) < (1 + (1 + 1))))
37	36	imp 412	. . . . . . 7 ⊢ ((𝑆 ∈ States ∧ (𝑆‘𝐴) < 1) → ((𝑆‘𝐴) + (1 + 1)) < (1 + (1 + 1)))
38		readdcl 11207	. . . . . . . . . 10 ⊢ (((𝑆‘𝐴) ∈ ℝ ∧ (1 + 1) ∈ ℝ) → ((𝑆‘𝐴) + (1 + 1)) ∈ ℝ)
39	3, 24, 38	sylancl 598	. . . . . . . . 9 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) + (1 + 1)) ∈ ℝ)
40	23, 24	readdcli 11248	. . . . . . . . . 10 ⊢ (1 + (1 + 1)) ∈ ℝ
41	40	a1i 11	. . . . . . . . 9 ⊢ (𝑆 ∈ States → (1 + (1 + 1)) ∈ ℝ)
42		lelttr 11324	. . . . . . . . 9 ⊢ ((((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ∈ ℝ ∧ ((𝑆‘𝐴) + (1 + 1)) ∈ ℝ ∧ (1 + (1 + 1)) ∈ ℝ) → ((((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ≤ ((𝑆‘𝐴) + (1 + 1)) ∧ ((𝑆‘𝐴) + (1 + 1)) < (1 + (1 + 1))) → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < (1 + (1 + 1))))
43	17, 39, 41, 42	syl3anc 1398	. . . . . . . 8 ⊢ (𝑆 ∈ States → ((((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ≤ ((𝑆‘𝐴) + (1 + 1)) ∧ ((𝑆‘𝐴) + (1 + 1)) < (1 + (1 + 1))) → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < (1 + (1 + 1))))
44	43	adantr 486	. . . . . . 7 ⊢ ((𝑆 ∈ States ∧ (𝑆‘𝐴) < 1) → ((((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ≤ ((𝑆‘𝐴) + (1 + 1)) ∧ ((𝑆‘𝐴) + (1 + 1)) < (1 + (1 + 1))) → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < (1 + (1 + 1))))
45	33, 37, 44	mp2and 712	. . . . . 6 ⊢ ((𝑆 ∈ States ∧ (𝑆‘𝐴) < 1) → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < (1 + (1 + 1)))
46		df-3 12328	. . . . . . 7 ⊢ 3 = (2 + 1)
47		df-2 12327	. . . . . . . 8 ⊢ 2 = (1 + 1)
48	47	oveq1i 7423	. . . . . . 7 ⊢ (2 + 1) = ((1 + 1) + 1)
49		ax-1cn 11182	. . . . . . . 8 ⊢ 1 ∈ ℂ
50	49, 49, 49	addassi 11243	. . . . . . 7 ⊢ ((1 + 1) + 1) = (1 + (1 + 1))
51	46, 48, 50	3eqtrri 2788	. . . . . 6 ⊢ (1 + (1 + 1)) = 3
52	45, 51	breqtrdi 5146	. . . . 5 ⊢ ((𝑆 ∈ States ∧ (𝑆‘𝐴) < 1) → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3)
53	52	ex 418	. . . 4 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) < 1 → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3))
54	53	con3d 153	. . 3 ⊢ (𝑆 ∈ States → (¬ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3 → ¬ (𝑆‘𝐴) < 1))
55		stle1 32706	. . . . . 6 ⊢ (𝑆 ∈ States → (𝐴 ∈ Cℋ → (𝑆‘𝐴) ≤ 1))
56	1, 55	mpi 21	. . . . 5 ⊢ (𝑆 ∈ States → (𝑆‘𝐴) ≤ 1)
57		leloe 11320	. . . . . 6 ⊢ (((𝑆‘𝐴) ∈ ℝ ∧ 1 ∈ ℝ) → ((𝑆‘𝐴) ≤ 1 ↔ ((𝑆‘𝐴) < 1 ∨ (𝑆‘𝐴) = 1)))
58	3, 23, 57	sylancl 598	. . . . 5 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) ≤ 1 ↔ ((𝑆‘𝐴) < 1 ∨ (𝑆‘𝐴) = 1)))
59	56, 58	mpbid 235	. . . 4 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) < 1 ∨ (𝑆‘𝐴) = 1))
60	59	ord 878	. . 3 ⊢ (𝑆 ∈ States → (¬ (𝑆‘𝐴) < 1 → (𝑆‘𝐴) = 1))
61	22, 54, 60	3syld 61	. 2 ⊢ (𝑆 ∈ States → (((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) = 3 → (𝑆‘𝐴) = 1))
62	14, 61	sylbid 243	1 ⊢ (𝑆 ∈ States → ((((𝑆‘𝐴) + (𝑆‘𝐵)) + (𝑆‘𝐶)) = 3 → (𝑆‘𝐴) = 1))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2955   class class class wbr 5103  ‘cfv 6533  (class class class)co 7413  ℝcr 11123  1c1 11125   + caddc 11127   < clt 11267   ≤ cle 11268  2c2 12319  3c3 12320   C_ℋ cch 31410  Statescst 31443

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736  ax-cnex 11180  ax-resscn 11181  ax-1cn 11182  ax-icn 11183  ax-addcl 11184  ax-addrcl 11185  ax-mulcl 11186  ax-mulrcl 11187  ax-mulcom 11188  ax-addass 11189  ax-mulass 11190  ax-distr 11191  ax-i2m1 11192  ax-1ne0 11193  ax-1rid 11194  ax-rnegex 11195  ax-rrecex 11196  ax-cnre 11197  ax-pre-lttri 11198  ax-pre-lttrn 11199  ax-pre-ltadd 11200  ax-hilex 31480

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-po 5563  df-so 5564  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-er 8696  df-map 8828  df-en 8953  df-dom 8954  df-sdom 8955  df-pnf 11269  df-mnf 11270  df-xr 11271  df-ltxr 11272  df-le 11273  df-2 12327  df-3 12328  df-icc 13405  df-sh 31688  df-ch 31702  df-st 32692

This theorem is used by:  golem2  32753