| 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 7374 | . . 3 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → (〈𝑥, 𝑦〉 · 1) = (𝐴 · 1)) | |
| 3 | id 22 | . . 3 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → 〈𝑥, 𝑦〉 = 𝐴) | |
| 4 | 2, 3 | eqeq12d 2752 | . 2 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → ((〈𝑥, 𝑦〉 · 1) = 〈𝑥, 𝑦〉 ↔ (𝐴 · 1) = 𝐴)) |
| 5 | elsni 4584 | . . 3 ⊢ (𝑦 ∈ {0R} → 𝑦 = 0R) | |
| 6 | df-1 11046 | . . . . . . 7 ⊢ 1 = 〈1R, 0R〉 | |
| 7 | 6 | oveq2i 7378 | . . . . . 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 4822 | . . . . . . 7 ⊢ (𝑥 ∈ R → 〈(𝑥 ·R 1R), 0R〉 = 〈𝑥, 0R〉) |
| 13 | 10, 12 | eqtrd 2771 | . . . . . 6 ⊢ (𝑥 ∈ R → (〈𝑥, 0R〉 · 〈1R, 0R〉) = 〈𝑥, 0R〉) |
| 14 | 7, 13 | eqtrid 2783 | . . . . 5 ⊢ (𝑥 ∈ R → (〈𝑥, 0R〉 · 1) = 〈𝑥, 0R〉) |
| 15 | opeq2 4817 | . . . . . . 7 ⊢ (𝑦 = 0R → 〈𝑥, 𝑦〉 = 〈𝑥, 0R〉) | |
| 16 | 15 | oveq1d 7382 | . . . . . 6 ⊢ (𝑦 = 0R → (〈𝑥, 𝑦〉 · 1) = (〈𝑥, 0R〉 · 1)) |
| 17 | 16, 15 | eqeq12d 2752 | . . . . 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 5725 | 1 ⊢ (𝐴 ∈ ℝ → (𝐴 · 1) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 {csn 4567 〈cop 4573 (class class class)co 7367 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 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-oadd 8409 df-omul 8410 df-er 8643 df-ec 8645 df-qs 8649 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 |