0ringnnzr - Metamath Proof Explorer

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

Theorem 0ringnnzr 19471

Description: A ring is a zero ring iff it is not a nonzero ring. (Contributed by AV, 14-Apr-2019.)

**Assertion**
Ref	Expression
0ringnnzr	⊢ (𝑅 ∈ Ring → ((♯‘(Base‘𝑅)) = 1 ↔ ¬ 𝑅 ∈ NzRing))

**Proof of Theorem 0ringnnzr**
Step	Hyp	Ref	Expression
1		1re 10231	. . . . . . . 8 ⊢ 1 ∈ ℝ
2	1	ltnri 10338	. . . . . . 7 ⊢ ¬ 1 < 1
3		breq2 4808	. . . . . . 7 ⊢ ((♯‘(Base‘𝑅)) = 1 → (1 < (♯‘(Base‘𝑅)) ↔ 1 < 1))
4	2, 3	mtbiri 316	. . . . . 6 ⊢ ((♯‘(Base‘𝑅)) = 1 → ¬ 1 < (♯‘(Base‘𝑅)))
5	4	adantl 473	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (♯‘(Base‘𝑅)) = 1) → ¬ 1 < (♯‘(Base‘𝑅)))
6	5	intnand 1000	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ (♯‘(Base‘𝑅)) = 1) → ¬ (𝑅 ∈ Ring ∧ 1 < (♯‘(Base‘𝑅))))
7	6	ex 449	. . 3 ⊢ (𝑅 ∈ Ring → ((♯‘(Base‘𝑅)) = 1 → ¬ (𝑅 ∈ Ring ∧ 1 < (♯‘(Base‘𝑅)))))
8		ianor 510	. . . . 5 ⊢ (¬ (𝑅 ∈ Ring ∧ 1 < (♯‘(Base‘𝑅))) ↔ (¬ 𝑅 ∈ Ring ∨ ¬ 1 < (♯‘(Base‘𝑅))))
9		pm2.21 120	. . . . . 6 ⊢ (¬ 𝑅 ∈ Ring → (𝑅 ∈ Ring → (♯‘(Base‘𝑅)) = 1))
10		fvex 6362	. . . . . . . . . 10 ⊢ (Base‘𝑅) ∈ V
11		hashxrcl 13340	. . . . . . . . . 10 ⊢ ((Base‘𝑅) ∈ V → (♯‘(Base‘𝑅)) ∈ ℝ^*)
12	10, 11	ax-mp 5	. . . . . . . . 9 ⊢ (♯‘(Base‘𝑅)) ∈ ℝ^*
13	1	rexri 10289	. . . . . . . . 9 ⊢ 1 ∈ ℝ^*
14		xrlenlt 10295	. . . . . . . . 9 ⊢ (((♯‘(Base‘𝑅)) ∈ ℝ^* ∧ 1 ∈ ℝ^*) → ((♯‘(Base‘𝑅)) ≤ 1 ↔ ¬ 1 < (♯‘(Base‘𝑅))))
15	12, 13, 14	mp2an 710	. . . . . . . 8 ⊢ ((♯‘(Base‘𝑅)) ≤ 1 ↔ ¬ 1 < (♯‘(Base‘𝑅)))
16	15	bicomi 214	. . . . . . 7 ⊢ (¬ 1 < (♯‘(Base‘𝑅)) ↔ (♯‘(Base‘𝑅)) ≤ 1)
17		simpr 479	. . . . . . . . . 10 ⊢ (((Base‘𝑅) ≠ ∅ ∧ (♯‘(Base‘𝑅)) ≤ 1) → (♯‘(Base‘𝑅)) ≤ 1)
18	10	a1i 11	. . . . . . . . . . . . 13 ⊢ (((Base‘𝑅) ≠ ∅ ∧ (♯‘(Base‘𝑅)) ≤ 1) → (Base‘𝑅) ∈ V)
19		1nn0 11500	. . . . . . . . . . . . . 14 ⊢ 1 ∈ ℕ₀
20	19	a1i 11	. . . . . . . . . . . . 13 ⊢ (((Base‘𝑅) ≠ ∅ ∧ (♯‘(Base‘𝑅)) ≤ 1) → 1 ∈ ℕ₀)
21		hashbnd 13317	. . . . . . . . . . . . 13 ⊢ (((Base‘𝑅) ∈ V ∧ 1 ∈ ℕ₀ ∧ (♯‘(Base‘𝑅)) ≤ 1) → (Base‘𝑅) ∈ Fin)
22	18, 20, 17, 21	syl3anc 1477	. . . . . . . . . . . 12 ⊢ (((Base‘𝑅) ≠ ∅ ∧ (♯‘(Base‘𝑅)) ≤ 1) → (Base‘𝑅) ∈ Fin)
23		hashcl 13339	. . . . . . . . . . . . 13 ⊢ ((Base‘𝑅) ∈ Fin → (♯‘(Base‘𝑅)) ∈ ℕ₀)
24		simpr 479	. . . . . . . . . . . . . . . . 17 ⊢ (((Base‘𝑅) ≠ ∅ ∧ (♯‘(Base‘𝑅)) ∈ ℕ₀) → (♯‘(Base‘𝑅)) ∈ ℕ₀)
25	10	a1i 11	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((♯‘(Base‘𝑅)) ∈ ℕ₀ → (Base‘𝑅) ∈ V)
26		hasheq0 13346	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((Base‘𝑅) ∈ V → ((♯‘(Base‘𝑅)) = 0 ↔ (Base‘𝑅) = ∅))
27	25, 26	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((♯‘(Base‘𝑅)) ∈ ℕ₀ → ((♯‘(Base‘𝑅)) = 0 ↔ (Base‘𝑅) = ∅))
28	27	biimpd 219	. . . . . . . . . . . . . . . . . . 19 ⊢ ((♯‘(Base‘𝑅)) ∈ ℕ₀ → ((♯‘(Base‘𝑅)) = 0 → (Base‘𝑅) = ∅))
29	28	necon3d 2953	. . . . . . . . . . . . . . . . . 18 ⊢ ((♯‘(Base‘𝑅)) ∈ ℕ₀ → ((Base‘𝑅) ≠ ∅ → (♯‘(Base‘𝑅)) ≠ 0))
30	29	impcom 445	. . . . . . . . . . . . . . . . 17 ⊢ (((Base‘𝑅) ≠ ∅ ∧ (♯‘(Base‘𝑅)) ∈ ℕ₀) → (♯‘(Base‘𝑅)) ≠ 0)
31		elnnne0 11498	. . . . . . . . . . . . . . . . 17 ⊢ ((♯‘(Base‘𝑅)) ∈ ℕ ↔ ((♯‘(Base‘𝑅)) ∈ ℕ₀ ∧ (♯‘(Base‘𝑅)) ≠ 0))
32	24, 30, 31	sylanbrc 701	. . . . . . . . . . . . . . . 16 ⊢ (((Base‘𝑅) ≠ ∅ ∧ (♯‘(Base‘𝑅)) ∈ ℕ₀) → (♯‘(Base‘𝑅)) ∈ ℕ)
33	32	ex 449	. . . . . . . . . . . . . . 15 ⊢ ((Base‘𝑅) ≠ ∅ → ((♯‘(Base‘𝑅)) ∈ ℕ₀ → (♯‘(Base‘𝑅)) ∈ ℕ))
34	33	adantr 472	. . . . . . . . . . . . . 14 ⊢ (((Base‘𝑅) ≠ ∅ ∧ (♯‘(Base‘𝑅)) ≤ 1) → ((♯‘(Base‘𝑅)) ∈ ℕ₀ → (♯‘(Base‘𝑅)) ∈ ℕ))
35	34	com12 32	. . . . . . . . . . . . 13 ⊢ ((♯‘(Base‘𝑅)) ∈ ℕ₀ → (((Base‘𝑅) ≠ ∅ ∧ (♯‘(Base‘𝑅)) ≤ 1) → (♯‘(Base‘𝑅)) ∈ ℕ))
36	23, 35	syl 17	. . . . . . . . . . . 12 ⊢ ((Base‘𝑅) ∈ Fin → (((Base‘𝑅) ≠ ∅ ∧ (♯‘(Base‘𝑅)) ≤ 1) → (♯‘(Base‘𝑅)) ∈ ℕ))
37	22, 36	mpcom 38	. . . . . . . . . . 11 ⊢ (((Base‘𝑅) ≠ ∅ ∧ (♯‘(Base‘𝑅)) ≤ 1) → (♯‘(Base‘𝑅)) ∈ ℕ)
38		nnle1eq1 11240	. . . . . . . . . . 11 ⊢ ((♯‘(Base‘𝑅)) ∈ ℕ → ((♯‘(Base‘𝑅)) ≤ 1 ↔ (♯‘(Base‘𝑅)) = 1))
39	37, 38	syl 17	. . . . . . . . . 10 ⊢ (((Base‘𝑅) ≠ ∅ ∧ (♯‘(Base‘𝑅)) ≤ 1) → ((♯‘(Base‘𝑅)) ≤ 1 ↔ (♯‘(Base‘𝑅)) = 1))
40	17, 39	mpbid 222	. . . . . . . . 9 ⊢ (((Base‘𝑅) ≠ ∅ ∧ (♯‘(Base‘𝑅)) ≤ 1) → (♯‘(Base‘𝑅)) = 1)
41	40	ex 449	. . . . . . . 8 ⊢ ((Base‘𝑅) ≠ ∅ → ((♯‘(Base‘𝑅)) ≤ 1 → (♯‘(Base‘𝑅)) = 1))
42		ringgrp 18752	. . . . . . . . 9 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp)
43		eqid 2760	. . . . . . . . . 10 ⊢ (Base‘𝑅) = (Base‘𝑅)
44	43	grpbn0 17652	. . . . . . . . 9 ⊢ (𝑅 ∈ Grp → (Base‘𝑅) ≠ ∅)
45	42, 44	syl 17	. . . . . . . 8 ⊢ (𝑅 ∈ Ring → (Base‘𝑅) ≠ ∅)
46	41, 45	syl11 33	. . . . . . 7 ⊢ ((♯‘(Base‘𝑅)) ≤ 1 → (𝑅 ∈ Ring → (♯‘(Base‘𝑅)) = 1))
47	16, 46	sylbi 207	. . . . . 6 ⊢ (¬ 1 < (♯‘(Base‘𝑅)) → (𝑅 ∈ Ring → (♯‘(Base‘𝑅)) = 1))
48	9, 47	jaoi 393	. . . . 5 ⊢ ((¬ 𝑅 ∈ Ring ∨ ¬ 1 < (♯‘(Base‘𝑅))) → (𝑅 ∈ Ring → (♯‘(Base‘𝑅)) = 1))
49	8, 48	sylbi 207	. . . 4 ⊢ (¬ (𝑅 ∈ Ring ∧ 1 < (♯‘(Base‘𝑅))) → (𝑅 ∈ Ring → (♯‘(Base‘𝑅)) = 1))
50	49	com12 32	. . 3 ⊢ (𝑅 ∈ Ring → (¬ (𝑅 ∈ Ring ∧ 1 < (♯‘(Base‘𝑅))) → (♯‘(Base‘𝑅)) = 1))
51	7, 50	impbid 202	. 2 ⊢ (𝑅 ∈ Ring → ((♯‘(Base‘𝑅)) = 1 ↔ ¬ (𝑅 ∈ Ring ∧ 1 < (♯‘(Base‘𝑅)))))
52	43	isnzr2hash 19466	. . . 4 ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ 1 < (♯‘(Base‘𝑅))))
53	52	bicomi 214	. . 3 ⊢ ((𝑅 ∈ Ring ∧ 1 < (♯‘(Base‘𝑅))) ↔ 𝑅 ∈ NzRing)
54	53	notbii 309	. 2 ⊢ (¬ (𝑅 ∈ Ring ∧ 1 < (♯‘(Base‘𝑅))) ↔ ¬ 𝑅 ∈ NzRing)
55	51, 54	syl6bb 276	1 ⊢ (𝑅 ∈ Ring → ((♯‘(Base‘𝑅)) = 1 ↔ ¬ 𝑅 ∈ NzRing))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∨ wo 382 ∧ wa 383 = wceq 1632 ∈ wcel 2139 ≠ wne 2932 Vcvv 3340 ∅c0 4058 class class class wbr 4804 ‘cfv 6049 Fincfn 8121 0cc0 10128 1c1 10129 ℝ^*cxr 10265 < clt 10266 ≤ cle 10267 ℕcn 11212 ℕ₀cn0 11484 ♯chash 13311 Basecbs 16059 Grpcgrp 17623 Ringcrg 18747 NzRingcnzr 19459

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-8 2141 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 ax-rep 4923 ax-sep 4933 ax-nul 4941 ax-pow 4992 ax-pr 5055 ax-un 7114 ax-cnex 10184 ax-resscn 10185 ax-1cn 10186 ax-icn 10187 ax-addcl 10188 ax-addrcl 10189 ax-mulcl 10190 ax-mulrcl 10191 ax-mulcom 10192 ax-addass 10193 ax-mulass 10194 ax-distr 10195 ax-i2m1 10196 ax-1ne0 10197 ax-1rid 10198 ax-rnegex 10199 ax-rrecex 10200 ax-cnre 10201 ax-pre-lttri 10202 ax-pre-lttrn 10203 ax-pre-ltadd 10204 ax-pre-mulgt0 10205

This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2047 df-eu 2611 df-mo 2612 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ne 2933 df-nel 3036 df-ral 3055 df-rex 3056 df-reu 3057 df-rmo 3058 df-rab 3059 df-v 3342 df-sbc 3577 df-csb 3675 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-pss 3731 df-nul 4059 df-if 4231 df-pw 4304 df-sn 4322 df-pr 4324 df-tp 4326 df-op 4328 df-uni 4589 df-int 4628 df-iun 4674 df-br 4805 df-opab 4865 df-mpt 4882 df-tr 4905 df-id 5174 df-eprel 5179 df-po 5187 df-so 5188 df-fr 5225 df-we 5227 df-xp 5272 df-rel 5273 df-cnv 5274 df-co 5275 df-dm 5276 df-rn 5277 df-res 5278 df-ima 5279 df-pred 5841 df-ord 5887 df-on 5888 df-lim 5889 df-suc 5890 df-iota 6012 df-fun 6051 df-fn 6052 df-f 6053 df-f1 6054 df-fo 6055 df-f1o 6056 df-fv 6057 df-riota 6774 df-ov 6816 df-oprab 6817 df-mpt2 6818 df-om 7231 df-1st 7333 df-2nd 7334 df-wrecs 7576 df-recs 7637 df-rdg 7675 df-1o 7729 df-oadd 7733 df-er 7911 df-en 8122 df-dom 8123 df-sdom 8124 df-fin 8125 df-card 8955 df-cda 9182 df-pnf 10268 df-mnf 10269 df-xr 10270 df-ltxr 10271 df-le 10272 df-sub 10460 df-neg 10461 df-nn 11213 df-2 11271 df-n0 11485 df-xnn0 11556 df-z 11570 df-uz 11880 df-fz 12520 df-hash 13312 df-ndx 16062 df-slot 16063 df-base 16065 df-sets 16066 df-plusg 16156 df-0g 16304 df-mgm 17443 df-sgrp 17485 df-mnd 17496 df-grp 17626 df-minusg 17627 df-mgp 18690 df-ur 18702 df-ring 18749 df-nzr 19460

This theorem is referenced by: rng1nnzr 19476 lmod0rng 42378 0ringdif 42380 0ring1eq0 42382 lindszr 42768

W3C validator