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

Theorem mulidnq 7592
Description: Multiplication identity element for positive fractions. (Contributed by NM, 3-Mar-1996.)
Assertion
Ref Expression
mulidnq (𝐴Q → (𝐴 ·Q 1Q) = 𝐴)

Proof of Theorem mulidnq
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-nqqs 7551 . 2 Q = ((N × N) / ~Q )
2 oveq1 6017 . . 3 ([⟨𝑥, 𝑦⟩] ~Q = 𝐴 → ([⟨𝑥, 𝑦⟩] ~Q ·Q 1Q) = (𝐴 ·Q 1Q))
3 id 19 . . 3 ([⟨𝑥, 𝑦⟩] ~Q = 𝐴 → [⟨𝑥, 𝑦⟩] ~Q = 𝐴)
42, 3eqeq12d 2244 . 2 ([⟨𝑥, 𝑦⟩] ~Q = 𝐴 → (([⟨𝑥, 𝑦⟩] ~Q ·Q 1Q) = [⟨𝑥, 𝑦⟩] ~Q ↔ (𝐴 ·Q 1Q) = 𝐴))
5 df-1nqqs 7554 . . . . 5 1Q = [⟨1o, 1o⟩] ~Q
65oveq2i 6021 . . . 4 ([⟨𝑥, 𝑦⟩] ~Q ·Q 1Q) = ([⟨𝑥, 𝑦⟩] ~Q ·Q [⟨1o, 1o⟩] ~Q )
7 1pi 7518 . . . . 5 1oN
8 mulpipqqs 7576 . . . . 5 (((𝑥N𝑦N) ∧ (1oN ∧ 1oN)) → ([⟨𝑥, 𝑦⟩] ~Q ·Q [⟨1o, 1o⟩] ~Q ) = [⟨(𝑥 ·N 1o), (𝑦 ·N 1o)⟩] ~Q )
97, 7, 8mpanr12 439 . . . 4 ((𝑥N𝑦N) → ([⟨𝑥, 𝑦⟩] ~Q ·Q [⟨1o, 1o⟩] ~Q ) = [⟨(𝑥 ·N 1o), (𝑦 ·N 1o)⟩] ~Q )
106, 9eqtrid 2274 . . 3 ((𝑥N𝑦N) → ([⟨𝑥, 𝑦⟩] ~Q ·Q 1Q) = [⟨(𝑥 ·N 1o), (𝑦 ·N 1o)⟩] ~Q )
11 mulcompig 7534 . . . . . . 7 ((1oN𝑥N) → (1o ·N 𝑥) = (𝑥 ·N 1o))
127, 11mpan 424 . . . . . 6 (𝑥N → (1o ·N 𝑥) = (𝑥 ·N 1o))
1312adantr 276 . . . . 5 ((𝑥N𝑦N) → (1o ·N 𝑥) = (𝑥 ·N 1o))
14 mulcompig 7534 . . . . . . 7 ((1oN𝑦N) → (1o ·N 𝑦) = (𝑦 ·N 1o))
157, 14mpan 424 . . . . . 6 (𝑦N → (1o ·N 𝑦) = (𝑦 ·N 1o))
1615adantl 277 . . . . 5 ((𝑥N𝑦N) → (1o ·N 𝑦) = (𝑦 ·N 1o))
1713, 16opeq12d 3865 . . . 4 ((𝑥N𝑦N) → ⟨(1o ·N 𝑥), (1o ·N 𝑦)⟩ = ⟨(𝑥 ·N 1o), (𝑦 ·N 1o)⟩)
1817eceq1d 6729 . . 3 ((𝑥N𝑦N) → [⟨(1o ·N 𝑥), (1o ·N 𝑦)⟩] ~Q = [⟨(𝑥 ·N 1o), (𝑦 ·N 1o)⟩] ~Q )
19 mulcanenqec 7589 . . . 4 ((1oN𝑥N𝑦N) → [⟨(1o ·N 𝑥), (1o ·N 𝑦)⟩] ~Q = [⟨𝑥, 𝑦⟩] ~Q )
207, 19mp3an1 1358 . . 3 ((𝑥N𝑦N) → [⟨(1o ·N 𝑥), (1o ·N 𝑦)⟩] ~Q = [⟨𝑥, 𝑦⟩] ~Q )
2110, 18, 203eqtr2d 2268 . 2 ((𝑥N𝑦N) → ([⟨𝑥, 𝑦⟩] ~Q ·Q 1Q) = [⟨𝑥, 𝑦⟩] ~Q )
221, 4, 21ecoptocl 6782 1 (𝐴Q → (𝐴 ·Q 1Q) = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1395  wcel 2200  cop 3669  (class class class)co 6010  1oc1o 6566  [cec 6691  Ncnpi 7475   ·N cmi 7477   ~Q ceq 7482  Qcnq 7483  1Qc1q 7484   ·Q cmq 7486
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 4259  ax-pr 4294  ax-un 4525  ax-setind 4630  ax-iinf 4681
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-id 4385  df-iord 4458  df-on 4460  df-suc 4463  df-iom 4684  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-f1o 5328  df-fv 5329  df-ov 6013  df-oprab 6014  df-mpo 6015  df-1st 6295  df-2nd 6296  df-recs 6462  df-irdg 6527  df-1o 6573  df-oadd 6577  df-omul 6578  df-er 6693  df-ec 6695  df-qs 6699  df-ni 7507  df-mi 7509  df-mpq 7548  df-enq 7550  df-nqqs 7551  df-mqqs 7553  df-1nqqs 7554
This theorem is referenced by:  recmulnqg  7594  rec1nq  7598  ltaddnq  7610  halfnqq  7613  prarloclemarch  7621  ltrnqg  7623  addnqprllem  7730  addnqprulem  7731  addnqprl  7732  addnqpru  7733  appdivnq  7766  prmuloc2  7770  mulnqprl  7771  mulnqpru  7772  1idprl  7793  1idpru  7794  recexprlem1ssl  7836  recexprlem1ssu  7837
  Copyright terms: Public domain W3C validator