ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  00sr GIF version

Theorem 00sr 7967
Description: A signed real times 0 is 0. (Contributed by NM, 10-Apr-1996.)
Assertion
Ref Expression
00sr (𝐴R → (𝐴 ·R 0R) = 0R)

Proof of Theorem 00sr
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-nr 7925 . 2 R = ((P × P) / ~R )
2 oveq1 6014 . . 3 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑥, 𝑦⟩] ~R ·R 0R) = (𝐴 ·R 0R))
32eqeq1d 2238 . 2 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (([⟨𝑥, 𝑦⟩] ~R ·R 0R) = 0R ↔ (𝐴 ·R 0R) = 0R))
4 1pr 7752 . . . . 5 1PP
5 mulsrpr 7944 . . . . 5 (((𝑥P𝑦P) ∧ (1PP ∧ 1PP)) → ([⟨𝑥, 𝑦⟩] ~R ·R [⟨1P, 1P⟩] ~R ) = [⟨((𝑥 ·P 1P) +P (𝑦 ·P 1P)), ((𝑥 ·P 1P) +P (𝑦 ·P 1P))⟩] ~R )
64, 4, 5mpanr12 439 . . . 4 ((𝑥P𝑦P) → ([⟨𝑥, 𝑦⟩] ~R ·R [⟨1P, 1P⟩] ~R ) = [⟨((𝑥 ·P 1P) +P (𝑦 ·P 1P)), ((𝑥 ·P 1P) +P (𝑦 ·P 1P))⟩] ~R )
7 mulclpr 7770 . . . . . . . . . 10 ((𝑥P ∧ 1PP) → (𝑥 ·P 1P) ∈ P)
84, 7mpan2 425 . . . . . . . . 9 (𝑥P → (𝑥 ·P 1P) ∈ P)
9 mulclpr 7770 . . . . . . . . . 10 ((𝑦P ∧ 1PP) → (𝑦 ·P 1P) ∈ P)
104, 9mpan2 425 . . . . . . . . 9 (𝑦P → (𝑦 ·P 1P) ∈ P)
11 addclpr 7735 . . . . . . . . 9 (((𝑥 ·P 1P) ∈ P ∧ (𝑦 ·P 1P) ∈ P) → ((𝑥 ·P 1P) +P (𝑦 ·P 1P)) ∈ P)
128, 10, 11syl2an 289 . . . . . . . 8 ((𝑥P𝑦P) → ((𝑥 ·P 1P) +P (𝑦 ·P 1P)) ∈ P)
1312, 12anim12i 338 . . . . . . 7 (((𝑥P𝑦P) ∧ (𝑥P𝑦P)) → (((𝑥 ·P 1P) +P (𝑦 ·P 1P)) ∈ P ∧ ((𝑥 ·P 1P) +P (𝑦 ·P 1P)) ∈ P))
14 eqid 2229 . . . . . . . 8 (((𝑥 ·P 1P) +P (𝑦 ·P 1P)) +P 1P) = (((𝑥 ·P 1P) +P (𝑦 ·P 1P)) +P 1P)
15 enreceq 7934 . . . . . . . 8 (((((𝑥 ·P 1P) +P (𝑦 ·P 1P)) ∈ P ∧ ((𝑥 ·P 1P) +P (𝑦 ·P 1P)) ∈ P) ∧ (1PP ∧ 1PP)) → ([⟨((𝑥 ·P 1P) +P (𝑦 ·P 1P)), ((𝑥 ·P 1P) +P (𝑦 ·P 1P))⟩] ~R = [⟨1P, 1P⟩] ~R ↔ (((𝑥 ·P 1P) +P (𝑦 ·P 1P)) +P 1P) = (((𝑥 ·P 1P) +P (𝑦 ·P 1P)) +P 1P)))
1614, 15mpbiri 168 . . . . . . 7 (((((𝑥 ·P 1P) +P (𝑦 ·P 1P)) ∈ P ∧ ((𝑥 ·P 1P) +P (𝑦 ·P 1P)) ∈ P) ∧ (1PP ∧ 1PP)) → [⟨((𝑥 ·P 1P) +P (𝑦 ·P 1P)), ((𝑥 ·P 1P) +P (𝑦 ·P 1P))⟩] ~R = [⟨1P, 1P⟩] ~R )
1713, 16sylan 283 . . . . . 6 ((((𝑥P𝑦P) ∧ (𝑥P𝑦P)) ∧ (1PP ∧ 1PP)) → [⟨((𝑥 ·P 1P) +P (𝑦 ·P 1P)), ((𝑥 ·P 1P) +P (𝑦 ·P 1P))⟩] ~R = [⟨1P, 1P⟩] ~R )
184, 4, 17mpanr12 439 . . . . 5 (((𝑥P𝑦P) ∧ (𝑥P𝑦P)) → [⟨((𝑥 ·P 1P) +P (𝑦 ·P 1P)), ((𝑥 ·P 1P) +P (𝑦 ·P 1P))⟩] ~R = [⟨1P, 1P⟩] ~R )
1918anidms 397 . . . 4 ((𝑥P𝑦P) → [⟨((𝑥 ·P 1P) +P (𝑦 ·P 1P)), ((𝑥 ·P 1P) +P (𝑦 ·P 1P))⟩] ~R = [⟨1P, 1P⟩] ~R )
206, 19eqtrd 2262 . . 3 ((𝑥P𝑦P) → ([⟨𝑥, 𝑦⟩] ~R ·R [⟨1P, 1P⟩] ~R ) = [⟨1P, 1P⟩] ~R )
21 df-0r 7929 . . . 4 0R = [⟨1P, 1P⟩] ~R
2221oveq2i 6018 . . 3 ([⟨𝑥, 𝑦⟩] ~R ·R 0R) = ([⟨𝑥, 𝑦⟩] ~R ·R [⟨1P, 1P⟩] ~R )
2320, 22, 213eqtr4g 2287 . 2 ((𝑥P𝑦P) → ([⟨𝑥, 𝑦⟩] ~R ·R 0R) = 0R)
241, 3, 23ecoptocl 6777 1 (𝐴R → (𝐴 ·R 0R) = 0R)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1395  wcel 2200  cop 3669  (class class class)co 6007  [cec 6686  Pcnp 7489  1Pc1p 7490   +P cpp 7491   ·P cmp 7492   ~R cer 7494  Rcnr 7495  0Rc0r 7496   ·R cmr 7500
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-eprel 4380  df-id 4384  df-po 4387  df-iso 4388  df-iord 4457  df-on 4459  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-recs 6457  df-irdg 6522  df-1o 6568  df-2o 6569  df-oadd 6572  df-omul 6573  df-er 6688  df-ec 6690  df-qs 6694  df-ni 7502  df-pli 7503  df-mi 7504  df-lti 7505  df-plpq 7542  df-mpq 7543  df-enq 7545  df-nqqs 7546  df-plqqs 7547  df-mqqs 7548  df-1nqqs 7549  df-rq 7550  df-ltnqqs 7551  df-enq0 7622  df-nq0 7623  df-0nq0 7624  df-plq0 7625  df-mq0 7626  df-inp 7664  df-i1p 7665  df-iplp 7666  df-imp 7667  df-enr 7924  df-nr 7925  df-mr 7927  df-0r 7929
This theorem is referenced by:  pn0sr  7969  mulresr  8036  axi2m1  8073  axcnre  8079
  Copyright terms: Public domain W3C validator