| 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 11287, based on ideas by Eric Schmidt. This construction-dependent theorem should not be referenced directly; instead, use ax-1rid 11251. (Contributed by Scott Fenton, 3-Jan-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| ax1rid | ⊢ (𝐴 ∈ ℝ → (𝐴 · 1) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-r 11191 | . 2 ⊢ ℝ = (R × {0R}) | |
| 2 | oveq1 7419 | . . 3 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → (〈𝑥, 𝑦〉 · 1) = (𝐴 · 1)) | |
| 3 | id 23 | . . 3 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → 〈𝑥, 𝑦〉 = 𝐴) | |
| 4 | 2, 3 | eqeq12d 2777 | . 2 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → ((〈𝑥, 𝑦〉 · 1) = 〈𝑥, 𝑦〉 ↔ (𝐴 · 1) = 𝐴)) |
| 5 | elsni 4601 | . . 3 ⊢ (𝑦 ∈ {0R} → 𝑦 = 0R) | |
| 6 | df-1 11189 | . . . . . . 7 ⊢ 1 = 〈1R, 0R〉 | |
| 7 | 6 | oveq2i 7423 | . . . . . 6 ⊢ (〈𝑥, 0R〉 · 1) = (〈𝑥, 0R〉 · 〈1R, 0R〉) |
| 8 | 1sr 11147 | . . . . . . . 8 ⊢ 1R ∈ R | |
| 9 | mulresr 11205 | . . . . . . . 8 ⊢ ((𝑥 ∈ R ∧ 1R ∈ R) → (〈𝑥, 0R〉 · 〈1R, 0R〉) = 〈(𝑥 ·R 1R), 0R〉) | |
| 10 | 8, 9 | mpan2 704 | . . . . . . 7 ⊢ (𝑥 ∈ R → (〈𝑥, 0R〉 · 〈1R, 0R〉) = 〈(𝑥 ·R 1R), 0R〉) |
| 11 | 1idsr 11164 | . . . . . . . 8 ⊢ (𝑥 ∈ R → (𝑥 ·R 1R) = 𝑥) | |
| 12 | 11 | opeq1d 4839 | . . . . . . 7 ⊢ (𝑥 ∈ R → 〈(𝑥 ·R 1R), 0R〉 = 〈𝑥, 0R〉) |
| 13 | 10, 12 | eqtrd 2796 | . . . . . 6 ⊢ (𝑥 ∈ R → (〈𝑥, 0R〉 · 〈1R, 0R〉) = 〈𝑥, 0R〉) |
| 14 | 7, 13 | eqtrid 2808 | . . . . 5 ⊢ (𝑥 ∈ R → (〈𝑥, 0R〉 · 1) = 〈𝑥, 0R〉) |
| 15 | opeq2 4834 | . . . . . . 7 ⊢ (𝑦 = 0R → 〈𝑥, 𝑦〉 = 〈𝑥, 0R〉) | |
| 16 | 15 | oveq1d 7427 | . . . . . 6 ⊢ (𝑦 = 0R → (〈𝑥, 𝑦〉 · 1) = (〈𝑥, 0R〉 · 1)) |
| 17 | 16, 15 | eqeq12d 2777 | . . . . 5 ⊢ (𝑦 = 0R → ((〈𝑥, 𝑦〉 · 1) = 〈𝑥, 𝑦〉 ↔ (〈𝑥, 0R〉 · 1) = 〈𝑥, 0R〉)) |
| 18 | 14, 17 | imbitrrid 249 | . . . 4 ⊢ (𝑦 = 0R → (𝑥 ∈ R → (〈𝑥, 𝑦〉 · 1) = 〈𝑥, 𝑦〉)) |
| 19 | 18 | impcom 413 | . . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 = 0R) → (〈𝑥, 𝑦〉 · 1) = 〈𝑥, 𝑦〉) |
| 20 | 5, 19 | sylan2 605 | . 2 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ {0R}) → (〈𝑥, 𝑦〉 · 1) = 〈𝑥, 𝑦〉) |
| 21 | 1, 4, 20 | optocl 5745 | 1 ⊢ (𝐴 ∈ ℝ → (𝐴 · 1) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 {csn 4584 〈cop 4590 (class class class)co 7412 Rcnr 10931 0Rc0r 10932 1Rc1r 10933 ·R cmr 10936 ℝcr 11180 1c1 11182 · cmul 11186 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-inf2 9626 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-oadd 8464 df-omul 8465 df-er 8701 df-ec 8703 df-qs 8707 df-ni 10938 df-pli 10939 df-mi 10940 df-lti 10941 df-plpq 10974 df-mpq 10975 df-ltpq 10976 df-enq 10977 df-nq 10978 df-erq 10979 df-plq 10980 df-mq 10981 df-1nq 10982 df-rq 10983 df-ltnq 10984 df-np 11047 df-1p 11048 df-plp 11049 df-mp 11050 df-ltp 11051 df-enr 11121 df-nr 11122 df-plr 11123 df-mr 11124 df-0r 11126 df-1r 11127 df-m1r 11128 df-c 11187 df-1 11189 df-r 11191 df-mul 11193 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |