| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ax1rid | Structured version Visualization version GIF version | ||
| Description: 1 is an identity element for real multiplication. Axiom 14 of 22 for real and complex numbers, derived from ZF set theory. Weakened from the original axiom in the form of statement in mulrid 11142, based on ideas by Eric Schmidt. This construction-dependent theorem should not be referenced directly; instead, use ax-1rid 11108. (Contributed by Scott Fenton, 3-Jan-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| ax1rid | ⊢ (𝐴 ∈ ℝ → (𝐴 · 1) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-r 11048 | . 2 ⊢ ℝ = (R × {0R}) | |
| 2 | oveq1 7375 | . . 3 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → (〈𝑥, 𝑦〉 · 1) = (𝐴 · 1)) | |
| 3 | id 22 | . . 3 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → 〈𝑥, 𝑦〉 = 𝐴) | |
| 4 | 2, 3 | eqeq12d 2753 | . 2 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → ((〈𝑥, 𝑦〉 · 1) = 〈𝑥, 𝑦〉 ↔ (𝐴 · 1) = 𝐴)) |
| 5 | elsni 4599 | . . 3 ⊢ (𝑦 ∈ {0R} → 𝑦 = 0R) | |
| 6 | df-1 11046 | . . . . . . 7 ⊢ 1 = 〈1R, 0R〉 | |
| 7 | 6 | oveq2i 7379 | . . . . . 6 ⊢ (〈𝑥, 0R〉 · 1) = (〈𝑥, 0R〉 · 〈1R, 0R〉) |
| 8 | 1sr 11004 | . . . . . . . 8 ⊢ 1R ∈ R | |
| 9 | mulresr 11062 | . . . . . . . 8 ⊢ ((𝑥 ∈ R ∧ 1R ∈ R) → (〈𝑥, 0R〉 · 〈1R, 0R〉) = 〈(𝑥 ·R 1R), 0R〉) | |
| 10 | 8, 9 | mpan2 692 | . . . . . . 7 ⊢ (𝑥 ∈ R → (〈𝑥, 0R〉 · 〈1R, 0R〉) = 〈(𝑥 ·R 1R), 0R〉) |
| 11 | 1idsr 11021 | . . . . . . . 8 ⊢ (𝑥 ∈ R → (𝑥 ·R 1R) = 𝑥) | |
| 12 | 11 | opeq1d 4837 | . . . . . . 7 ⊢ (𝑥 ∈ R → 〈(𝑥 ·R 1R), 0R〉 = 〈𝑥, 0R〉) |
| 13 | 10, 12 | eqtrd 2772 | . . . . . 6 ⊢ (𝑥 ∈ R → (〈𝑥, 0R〉 · 〈1R, 0R〉) = 〈𝑥, 0R〉) |
| 14 | 7, 13 | eqtrid 2784 | . . . . 5 ⊢ (𝑥 ∈ R → (〈𝑥, 0R〉 · 1) = 〈𝑥, 0R〉) |
| 15 | opeq2 4832 | . . . . . . 7 ⊢ (𝑦 = 0R → 〈𝑥, 𝑦〉 = 〈𝑥, 0R〉) | |
| 16 | 15 | oveq1d 7383 | . . . . . 6 ⊢ (𝑦 = 0R → (〈𝑥, 𝑦〉 · 1) = (〈𝑥, 0R〉 · 1)) |
| 17 | 16, 15 | eqeq12d 2753 | . . . . 5 ⊢ (𝑦 = 0R → ((〈𝑥, 𝑦〉 · 1) = 〈𝑥, 𝑦〉 ↔ (〈𝑥, 0R〉 · 1) = 〈𝑥, 0R〉)) |
| 18 | 14, 17 | imbitrrid 246 | . . . 4 ⊢ (𝑦 = 0R → (𝑥 ∈ R → (〈𝑥, 𝑦〉 · 1) = 〈𝑥, 𝑦〉)) |
| 19 | 18 | impcom 407 | . . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 = 0R) → (〈𝑥, 𝑦〉 · 1) = 〈𝑥, 𝑦〉) |
| 20 | 5, 19 | sylan2 594 | . 2 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ {0R}) → (〈𝑥, 𝑦〉 · 1) = 〈𝑥, 𝑦〉) |
| 21 | 1, 4, 20 | optocl 5726 | 1 ⊢ (𝐴 ∈ ℝ → (𝐴 · 1) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 {csn 4582 〈cop 4588 (class class class)co 7368 Rcnr 10788 0Rc0r 10789 1Rc1r 10790 ·R cmr 10793 ℝcr 11037 1c1 11039 · cmul 11043 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-inf2 9562 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-oadd 8411 df-omul 8412 df-er 8645 df-ec 8647 df-qs 8651 df-ni 10795 df-pli 10796 df-mi 10797 df-lti 10798 df-plpq 10831 df-mpq 10832 df-ltpq 10833 df-enq 10834 df-nq 10835 df-erq 10836 df-plq 10837 df-mq 10838 df-1nq 10839 df-rq 10840 df-ltnq 10841 df-np 10904 df-1p 10905 df-plp 10906 df-mp 10907 df-ltp 10908 df-enr 10978 df-nr 10979 df-plr 10980 df-mr 10981 df-0r 10983 df-1r 10984 df-m1r 10985 df-c 11044 df-1 11046 df-r 11048 df-mul 11050 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |