Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > f1rhm0to0ALT | Structured version Visualization version GIF version |
Description: Alternate proof for f1rhm0to0 18563. Using ghmf1 17512 does not make the proof shorter and requires disjoint variable restrictions! (Contributed by AV, 24-Oct-2019.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
f1rhm0to0.a | ⊢ 𝐴 = (Base‘𝑅) |
f1rhm0to0.b | ⊢ 𝐵 = (Base‘𝑆) |
f1rhm0to0.n | ⊢ 𝑁 = (0g‘𝑆) |
f1rhm0to0.0 | ⊢ 0 = (0g‘𝑅) |
Ref | Expression |
---|---|
f1rhm0to0ALT | ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 𝑁 ↔ 𝑋 = 0 )) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rhmghm 18548 | . . . . . . . 8 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝐹 ∈ (𝑅 GrpHom 𝑆)) | |
2 | 1 | adantr 480 | . . . . . . 7 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑋 ∈ 𝐴) → 𝐹 ∈ (𝑅 GrpHom 𝑆)) |
3 | f1rhm0to0.a | . . . . . . . 8 ⊢ 𝐴 = (Base‘𝑅) | |
4 | f1rhm0to0.b | . . . . . . . 8 ⊢ 𝐵 = (Base‘𝑆) | |
5 | f1rhm0to0.0 | . . . . . . . 8 ⊢ 0 = (0g‘𝑅) | |
6 | f1rhm0to0.n | . . . . . . . 8 ⊢ 𝑁 = (0g‘𝑆) | |
7 | 3, 4, 5, 6 | ghmf1 17512 | . . . . . . 7 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → (𝐹:𝐴–1-1→𝐵 ↔ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 𝑁 → 𝑥 = 0 ))) |
8 | 2, 7 | syl 17 | . . . . . 6 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑋 ∈ 𝐴) → (𝐹:𝐴–1-1→𝐵 ↔ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 𝑁 → 𝑥 = 0 ))) |
9 | fveq2 6103 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋)) | |
10 | 9 | eqeq1d 2612 | . . . . . . . . 9 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥) = 𝑁 ↔ (𝐹‘𝑋) = 𝑁)) |
11 | eqeq1 2614 | . . . . . . . . 9 ⊢ (𝑥 = 𝑋 → (𝑥 = 0 ↔ 𝑋 = 0 )) | |
12 | 10, 11 | imbi12d 333 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → (((𝐹‘𝑥) = 𝑁 → 𝑥 = 0 ) ↔ ((𝐹‘𝑋) = 𝑁 → 𝑋 = 0 ))) |
13 | 12 | rspcv 3278 | . . . . . . 7 ⊢ (𝑋 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 𝑁 → 𝑥 = 0 ) → ((𝐹‘𝑋) = 𝑁 → 𝑋 = 0 ))) |
14 | 13 | adantl 481 | . . . . . 6 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑋 ∈ 𝐴) → (∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 𝑁 → 𝑥 = 0 ) → ((𝐹‘𝑋) = 𝑁 → 𝑋 = 0 ))) |
15 | 8, 14 | sylbid 229 | . . . . 5 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑋 ∈ 𝐴) → (𝐹:𝐴–1-1→𝐵 → ((𝐹‘𝑋) = 𝑁 → 𝑋 = 0 ))) |
16 | 15 | ex 449 | . . . 4 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝑋 ∈ 𝐴 → (𝐹:𝐴–1-1→𝐵 → ((𝐹‘𝑋) = 𝑁 → 𝑋 = 0 )))) |
17 | 16 | com23 84 | . . 3 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝐹:𝐴–1-1→𝐵 → (𝑋 ∈ 𝐴 → ((𝐹‘𝑋) = 𝑁 → 𝑋 = 0 )))) |
18 | 17 | 3imp 1249 | . 2 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 𝑁 → 𝑋 = 0 )) |
19 | fveq2 6103 | . . . 4 ⊢ (𝑋 = 0 → (𝐹‘𝑋) = (𝐹‘ 0 )) | |
20 | 5, 6 | ghmid 17489 | . . . . . 6 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → (𝐹‘ 0 ) = 𝑁) |
21 | 1, 20 | syl 17 | . . . . 5 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝐹‘ 0 ) = 𝑁) |
22 | 21 | 3ad2ant1 1075 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → (𝐹‘ 0 ) = 𝑁) |
23 | 19, 22 | sylan9eqr 2666 | . . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) ∧ 𝑋 = 0 ) → (𝐹‘𝑋) = 𝑁) |
24 | 23 | ex 449 | . 2 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → (𝑋 = 0 → (𝐹‘𝑋) = 𝑁)) |
25 | 18, 24 | impbid 201 | 1 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 𝑁 ↔ 𝑋 = 0 )) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ∀wral 2896 –1-1→wf1 5801 ‘cfv 5804 (class class class)co 6549 Basecbs 15695 0gc0g 15923 GrpHom cghm 17480 RingHom crh 18535 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-map 7746 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-ndx 15698 df-slot 15699 df-base 15700 df-sets 15701 df-plusg 15781 df-0g 15925 df-mgm 17065 df-sgrp 17107 df-mnd 17118 df-mhm 17158 df-grp 17248 df-minusg 17249 df-sbg 17250 df-ghm 17481 df-mgp 18313 df-ur 18325 df-ring 18372 df-rnghom 18538 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |