Theorem rngone0 38620

Description: Obsolete theorem, use ringidcl 20393 instead. The base set of a ring is not empty. (Contributed by FL, 24-Jan-2010.) (New usage is discouraged.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
rngone0.1	⊢ 𝐺 = (1st ‘𝑅)
rngone0.2	⊢ 𝑋 = ran 𝐺

Assertion

Ref	Expression
rngone0	⊢ (𝑅 ∈ RingOps → 𝑋 ≠ ∅)

Proof of Theorem rngone0

Step	Hyp	Ref	Expression
1		rngone0.1	. . 3 ⊢ 𝐺 = (1st ‘𝑅)
2	1	rngogrpo 38619	. 2 ⊢ (𝑅 ∈ RingOps → 𝐺 ∈ GrpOp)
3		rngone0.2	. . 3 ⊢ 𝑋 = ran 𝐺
4	3	grpon0 30925	. 2 ⊢ (𝐺 ∈ GrpOp → 𝑋 ≠ ∅)
5	2, 4	syl 18	1 ⊢ (𝑅 ∈ RingOps → 𝑋 ≠ ∅)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146   ≠ wne 2960  ∅c0 4286  ran crn 5664  ‘cfv 6540  1^st c1st 7990  GrpOpcgr 30912  RingOpscrngo 38603

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 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7742

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fo 6546  df-fv 6548  df-ov 7422  df-1st 7992  df-2nd 7993  df-grpo 30916  df-ablo 30968  df-rngo 38604

This theorem is used by:  rngoueqz  38649