Theorem ringinvnz1ne0 14292

Description: In a unital ring, a left invertible element is different from zero iff 1 ≠ 0. (Contributed by FL, 18-Apr-2010.) (Revised by AV, 24-Aug-2021.)

Hypotheses

Ref	Expression
ringinvnzdiv.b	⊢ 𝐵 = (Base‘𝑅)
ringinvnzdiv.t	⊢ · = (.r‘𝑅)
ringinvnzdiv.u	⊢ 1 = (1r‘𝑅)
ringinvnzdiv.z	⊢ 0 = (0g‘𝑅)
ringinvnzdiv.r	⊢ (𝜑 → 𝑅 ∈ Ring)
ringinvnzdiv.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
ringinvnzdiv.a	⊢ (𝜑 → ∃𝑎 ∈ 𝐵 (𝑎 · 𝑋) = 1 )

Assertion

Ref	Expression
ringinvnz1ne0	⊢ (𝜑 → (𝑋 ≠ 0 ↔ 1 ≠ 0 ))

Distinct variable groups:   𝑋,𝑎   0 ,𝑎   1 ,𝑎   · ,𝑎   𝜑,𝑎

Allowed substitution hints:   𝐵(𝑎)   𝑅(𝑎)

Proof of Theorem ringinvnz1ne0

Step	Hyp	Ref	Expression
1		oveq2 6066	. . . . 5 ⊢ (𝑋 = 0 → (𝑎 · 𝑋) = (𝑎 · 0 ))
2		ringinvnzdiv.r	. . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ Ring)
3		ringinvnzdiv.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝑅)
4		ringinvnzdiv.t	. . . . . . . 8 ⊢ · = (.r‘𝑅)
5		ringinvnzdiv.z	. . . . . . . 8 ⊢ 0 = (0g‘𝑅)
6	3, 4, 5	ringrz 14287	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑎 ∈ 𝐵) → (𝑎 · 0 ) = 0 )
7	2, 6	sylan 283	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑎 · 0 ) = 0 )
8		eqeq12 2247	. . . . . . . 8 ⊢ (((𝑎 · 𝑋) = 1 ∧ (𝑎 · 0 ) = 0 ) → ((𝑎 · 𝑋) = (𝑎 · 0 ) ↔ 1 = 0 ))
9	8	biimpd 144	. . . . . . 7 ⊢ (((𝑎 · 𝑋) = 1 ∧ (𝑎 · 0 ) = 0 ) → ((𝑎 · 𝑋) = (𝑎 · 0 ) → 1 = 0 ))
10	9	ex 115	. . . . . 6 ⊢ ((𝑎 · 𝑋) = 1 → ((𝑎 · 0 ) = 0 → ((𝑎 · 𝑋) = (𝑎 · 0 ) → 1 = 0 )))
11	7, 10	mpan9 281	. . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) → ((𝑎 · 𝑋) = (𝑎 · 0 ) → 1 = 0 ))
12	1, 11	syl5 32	. . . 4 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) → (𝑋 = 0 → 1 = 0 ))
13		oveq2 6066	. . . . 5 ⊢ ( 1 = 0 → (𝑋 · 1 ) = (𝑋 · 0 ))
14		ringinvnzdiv.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
15		ringinvnzdiv.u	. . . . . . . . . 10 ⊢ 1 = (1r‘𝑅)
16	3, 4, 15	ringridm 14267	. . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑋 · 1 ) = 𝑋)
17	3, 4, 5	ringrz 14287	. . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) = 0 )
18	16, 17	eqeq12d 2249	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → ((𝑋 · 1 ) = (𝑋 · 0 ) ↔ 𝑋 = 0 ))
19	18	biimpd 144	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → ((𝑋 · 1 ) = (𝑋 · 0 ) → 𝑋 = 0 ))
20	2, 14, 19	syl2anc 411	. . . . . 6 ⊢ (𝜑 → ((𝑋 · 1 ) = (𝑋 · 0 ) → 𝑋 = 0 ))
21	20	ad2antrr 488	. . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) → ((𝑋 · 1 ) = (𝑋 · 0 ) → 𝑋 = 0 ))
22	13, 21	syl5 32	. . . 4 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) → ( 1 = 0 → 𝑋 = 0 ))
23	12, 22	impbid 129	. . 3 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ (𝑎 · 𝑋) = 1 ) → (𝑋 = 0 ↔ 1 = 0 ))
24		ringinvnzdiv.a	. . 3 ⊢ (𝜑 → ∃𝑎 ∈ 𝐵 (𝑎 · 𝑋) = 1 )
25	23, 24	r19.29a 2688	. 2 ⊢ (𝜑 → (𝑋 = 0 ↔ 1 = 0 ))
26	25	necon3bid 2455	1 ⊢ (𝜑 → (𝑋 ≠ 0 ↔ 1 ≠ 0 ))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1398   ∈ wcel 2205   ≠ wne 2414  ∃wrex 2523  ‘cfv 5357  (class class class)co 6058  Basecbs 13296  ._rcmulr 13375  0_gc0g 13553  1_rcur 14202  Ringcrg 14239

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-pre-ltirr 8255  ax-pre-ltadd 8259

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-pnf 8326  df-mnf 8327  df-ltxr 8329  df-inn 9255  df-2 9313  df-3 9314  df-ndx 13299  df-slot 13300  df-base 13302  df-sets 13303  df-plusg 13387  df-mulr 13388  df-0g 13555  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-grp 13758  df-mgp 14160  df-ur 14203  df-ring 14241

This theorem is referenced by: (None)