Theorem stadd3i 32280

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 32248	. . . . . 6 ⊢ (𝑆 ∈ States → (𝐴 ∈ Cℋ → (𝑆‘𝐴) ∈ ℝ))
3	1, 2	mpi 20	. . . . 5 ⊢ (𝑆 ∈ States → (𝑆‘𝐴) ∈ ℝ)
4	3	recnd 11318	. . . 4 ⊢ (𝑆 ∈ States → (𝑆‘𝐴) ∈ ℂ)
5		stle.2	. . . . . 6 ⊢ 𝐵 ∈ Cℋ
6		stcl 32248	. . . . . 6 ⊢ (𝑆 ∈ States → (𝐵 ∈ Cℋ → (𝑆‘𝐵) ∈ ℝ))
7	5, 6	mpi 20	. . . . 5 ⊢ (𝑆 ∈ States → (𝑆‘𝐵) ∈ ℝ)
8	7	recnd 11318	. . . 4 ⊢ (𝑆 ∈ States → (𝑆‘𝐵) ∈ ℂ)
9		stm1add3.3	. . . . . 6 ⊢ 𝐶 ∈ Cℋ
10		stcl 32248	. . . . . 6 ⊢ (𝑆 ∈ States → (𝐶 ∈ Cℋ → (𝑆‘𝐶) ∈ ℝ))
11	9, 10	mpi 20	. . . . 5 ⊢ (𝑆 ∈ States → (𝑆‘𝐶) ∈ ℝ)
12	11	recnd 11318	. . . 4 ⊢ (𝑆 ∈ States → (𝑆‘𝐶) ∈ ℂ)
13	4, 8, 12	addassd 11312	. . 3 ⊢ (𝑆 ∈ States → (((𝑆‘𝐴) + (𝑆‘𝐵)) + (𝑆‘𝐶)) = ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))))
14	13	eqeq1d 2742	. 2 ⊢ (𝑆 ∈ States → ((((𝑆‘𝐴) + (𝑆‘𝐵)) + (𝑆‘𝐶)) = 3 ↔ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) = 3))
15		eqcom 2747	. . . 4 ⊢ (((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) = 3 ↔ 3 = ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))))
16	7, 11	readdcld 11319	. . . . . . 7 ⊢ (𝑆 ∈ States → ((𝑆‘𝐵) + (𝑆‘𝐶)) ∈ ℝ)
17	3, 16	readdcld 11319	. . . . . 6 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ∈ ℝ)
18		ltne 11387	. . . . . . 7 ⊢ ((((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ∈ ℝ ∧ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3) → 3 ≠ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))))
19	18	ex 412	. . . . . 6 ⊢ (((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ∈ ℝ → (((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3 → 3 ≠ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶)))))
20	17, 19	syl 17	. . . . 5 ⊢ (𝑆 ∈ States → (((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3 → 3 ≠ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶)))))
21	20	necon2bd 2962	. . . 4 ⊢ (𝑆 ∈ States → (3 = ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) → ¬ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3))
22	15, 21	biimtrid 242	. . 3 ⊢ (𝑆 ∈ States → (((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) = 3 → ¬ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3))
23		1re 11290	. . . . . . . . . . 11 ⊢ 1 ∈ ℝ
24	23, 23	readdcli 11305	. . . . . . . . . 10 ⊢ (1 + 1) ∈ ℝ
25	24	a1i 11	. . . . . . . . 9 ⊢ (𝑆 ∈ States → (1 + 1) ∈ ℝ)
26		1red 11291	. . . . . . . . . 10 ⊢ (𝑆 ∈ States → 1 ∈ ℝ)
27		stle1 32257	. . . . . . . . . . 11 ⊢ (𝑆 ∈ States → (𝐵 ∈ Cℋ → (𝑆‘𝐵) ≤ 1))
28	5, 27	mpi 20	. . . . . . . . . 10 ⊢ (𝑆 ∈ States → (𝑆‘𝐵) ≤ 1)
29		stle1 32257	. . . . . . . . . . 11 ⊢ (𝑆 ∈ States → (𝐶 ∈ Cℋ → (𝑆‘𝐶) ≤ 1))
30	9, 29	mpi 20	. . . . . . . . . 10 ⊢ (𝑆 ∈ States → (𝑆‘𝐶) ≤ 1)
31	7, 11, 26, 26, 28, 30	le2addd 11909	. . . . . . . . 9 ⊢ (𝑆 ∈ States → ((𝑆‘𝐵) + (𝑆‘𝐶)) ≤ (1 + 1))
32	16, 25, 3, 31	leadd2dd 11905	. . . . . . . 8 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ≤ ((𝑆‘𝐴) + (1 + 1)))
33	32	adantr 480	. . . . . . 7 ⊢ ((𝑆 ∈ States ∧ (𝑆‘𝐴) < 1) → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ≤ ((𝑆‘𝐴) + (1 + 1)))
34		ltadd1 11757	. . . . . . . . . 10 ⊢ (((𝑆‘𝐴) ∈ ℝ ∧ 1 ∈ ℝ ∧ (1 + 1) ∈ ℝ) → ((𝑆‘𝐴) < 1 ↔ ((𝑆‘𝐴) + (1 + 1)) < (1 + (1 + 1))))
35	34	biimpd 229	. . . . . . . . 9 ⊢ (((𝑆‘𝐴) ∈ ℝ ∧ 1 ∈ ℝ ∧ (1 + 1) ∈ ℝ) → ((𝑆‘𝐴) < 1 → ((𝑆‘𝐴) + (1 + 1)) < (1 + (1 + 1))))
36	3, 26, 25, 35	syl3anc 1371	. . . . . . . 8 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) < 1 → ((𝑆‘𝐴) + (1 + 1)) < (1 + (1 + 1))))
37	36	imp 406	. . . . . . 7 ⊢ ((𝑆 ∈ States ∧ (𝑆‘𝐴) < 1) → ((𝑆‘𝐴) + (1 + 1)) < (1 + (1 + 1)))
38		readdcl 11267	. . . . . . . . . 10 ⊢ (((𝑆‘𝐴) ∈ ℝ ∧ (1 + 1) ∈ ℝ) → ((𝑆‘𝐴) + (1 + 1)) ∈ ℝ)
39	3, 24, 38	sylancl 585	. . . . . . . . 9 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) + (1 + 1)) ∈ ℝ)
40	23, 24	readdcli 11305	. . . . . . . . . 10 ⊢ (1 + (1 + 1)) ∈ ℝ
41	40	a1i 11	. . . . . . . . 9 ⊢ (𝑆 ∈ States → (1 + (1 + 1)) ∈ ℝ)
42		lelttr 11380	. . . . . . . . 9 ⊢ ((((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ∈ ℝ ∧ ((𝑆‘𝐴) + (1 + 1)) ∈ ℝ ∧ (1 + (1 + 1)) ∈ ℝ) → ((((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ≤ ((𝑆‘𝐴) + (1 + 1)) ∧ ((𝑆‘𝐴) + (1 + 1)) < (1 + (1 + 1))) → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < (1 + (1 + 1))))
43	17, 39, 41, 42	syl3anc 1371	. . . . . . . 8 ⊢ (𝑆 ∈ States → ((((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ≤ ((𝑆‘𝐴) + (1 + 1)) ∧ ((𝑆‘𝐴) + (1 + 1)) < (1 + (1 + 1))) → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < (1 + (1 + 1))))
44	43	adantr 480	. . . . . . 7 ⊢ ((𝑆 ∈ States ∧ (𝑆‘𝐴) < 1) → ((((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) ≤ ((𝑆‘𝐴) + (1 + 1)) ∧ ((𝑆‘𝐴) + (1 + 1)) < (1 + (1 + 1))) → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < (1 + (1 + 1))))
45	33, 37, 44	mp2and 698	. . . . . 6 ⊢ ((𝑆 ∈ States ∧ (𝑆‘𝐴) < 1) → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < (1 + (1 + 1)))
46		df-3 12357	. . . . . . 7 ⊢ 3 = (2 + 1)
47		df-2 12356	. . . . . . . 8 ⊢ 2 = (1 + 1)
48	47	oveq1i 7458	. . . . . . 7 ⊢ (2 + 1) = ((1 + 1) + 1)
49		ax-1cn 11242	. . . . . . . 8 ⊢ 1 ∈ ℂ
50	49, 49, 49	addassi 11300	. . . . . . 7 ⊢ ((1 + 1) + 1) = (1 + (1 + 1))
51	46, 48, 50	3eqtrri 2773	. . . . . 6 ⊢ (1 + (1 + 1)) = 3
52	45, 51	breqtrdi 5207	. . . . 5 ⊢ ((𝑆 ∈ States ∧ (𝑆‘𝐴) < 1) → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3)
53	52	ex 412	. . . 4 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) < 1 → ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3))
54	53	con3d 152	. . 3 ⊢ (𝑆 ∈ States → (¬ ((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) < 3 → ¬ (𝑆‘𝐴) < 1))
55		stle1 32257	. . . . . 6 ⊢ (𝑆 ∈ States → (𝐴 ∈ Cℋ → (𝑆‘𝐴) ≤ 1))
56	1, 55	mpi 20	. . . . 5 ⊢ (𝑆 ∈ States → (𝑆‘𝐴) ≤ 1)
57		leloe 11376	. . . . . 6 ⊢ (((𝑆‘𝐴) ∈ ℝ ∧ 1 ∈ ℝ) → ((𝑆‘𝐴) ≤ 1 ↔ ((𝑆‘𝐴) < 1 ∨ (𝑆‘𝐴) = 1)))
58	3, 23, 57	sylancl 585	. . . . 5 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) ≤ 1 ↔ ((𝑆‘𝐴) < 1 ∨ (𝑆‘𝐴) = 1)))
59	56, 58	mpbid 232	. . . 4 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) < 1 ∨ (𝑆‘𝐴) = 1))
60	59	ord 863	. . 3 ⊢ (𝑆 ∈ States → (¬ (𝑆‘𝐴) < 1 → (𝑆‘𝐴) = 1))
61	22, 54, 60	3syld 60	. 2 ⊢ (𝑆 ∈ States → (((𝑆‘𝐴) + ((𝑆‘𝐵) + (𝑆‘𝐶))) = 3 → (𝑆‘𝐴) = 1))
62	14, 61	sylbid 240	1 ⊢ (𝑆 ∈ States → ((((𝑆‘𝐴) + (𝑆‘𝐵)) + (𝑆‘𝐶)) = 3 → (𝑆‘𝐴) = 1))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 846   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108   ≠ wne 2946   class class class wbr 5166  ‘cfv 6573  (class class class)co 7448  ℝcr 11183  1c1 11185   + caddc 11187   < clt 11324   ≤ cle 11325  2c2 12348  3c3 12349   C_ℋ cch 30961  Statescst 30994

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-cnex 11240  ax-resscn 11241  ax-1cn 11242  ax-icn 11243  ax-addcl 11244  ax-addrcl 11245  ax-mulcl 11246  ax-mulrcl 11247  ax-mulcom 11248  ax-addass 11249  ax-mulass 11250  ax-distr 11251  ax-i2m1 11252  ax-1ne0 11253  ax-1rid 11254  ax-rnegex 11255  ax-rrecex 11256  ax-cnre 11257  ax-pre-lttri 11258  ax-pre-lttrn 11259  ax-pre-ltadd 11260  ax-hilex 31031

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-po 5607  df-so 5608  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-er 8763  df-map 8886  df-en 9004  df-dom 9005  df-sdom 9006  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-2 12356  df-3 12357  df-icc 13414  df-sh 31239  df-ch 31253  df-st 32243

This theorem is referenced by:  golem2  32304