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

Theorem dmmulpq 7747
Description: Domain of multiplication on positive fractions. (Contributed by NM, 24-Aug-1995.)
Assertion
Ref Expression
dmmulpq dom ·Q = (Q × Q)

Proof of Theorem dmmulpq
Dummy variables 𝑥 𝑦 𝑧 𝑣 𝑤 𝑢 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dmoprab 6169 . . 3 dom {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥Q𝑦Q) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧((𝑥Q𝑦Q) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))}
2 df-mqqs 7717 . . . 4 ·Q = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥Q𝑦Q) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))}
32dmeqi 4982 . . 3 dom ·Q = dom {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥Q𝑦Q) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))}
4 dmaddpqlem 7744 . . . . . . . . 9 (𝑥Q → ∃𝑤𝑣 𝑥 = [⟨𝑤, 𝑣⟩] ~Q )
5 dmaddpqlem 7744 . . . . . . . . 9 (𝑦Q → ∃𝑢𝑓 𝑦 = [⟨𝑢, 𝑓⟩] ~Q )
64, 5anim12i 338 . . . . . . . 8 ((𝑥Q𝑦Q) → (∃𝑤𝑣 𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ ∃𝑢𝑓 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ))
7 ee4anv 1994 . . . . . . . 8 (∃𝑤𝑣𝑢𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ↔ (∃𝑤𝑣 𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ ∃𝑢𝑓 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ))
86, 7sylibr 134 . . . . . . 7 ((𝑥Q𝑦Q) → ∃𝑤𝑣𝑢𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ))
9 enqex 7727 . . . . . . . . . . . . . 14 ~Q ∈ V
10 ecexg 6811 . . . . . . . . . . . . . 14 ( ~Q ∈ V → [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ∈ V)
119, 10ax-mp 5 . . . . . . . . . . . . 13 [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ∈ V
1211isseti 2830 . . . . . . . . . . . 12 𝑧 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q
13 ax-ia3 108 . . . . . . . . . . . . 13 ((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → (𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q → ((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q )))
1413eximdv 1933 . . . . . . . . . . . 12 ((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → (∃𝑧 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q → ∃𝑧((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q )))
1512, 14mpi 15 . . . . . . . . . . 11 ((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → ∃𝑧((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))
16152eximi 1654 . . . . . . . . . 10 (∃𝑢𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → ∃𝑢𝑓𝑧((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))
17 exrot3 1742 . . . . . . . . . 10 (∃𝑧𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ) ↔ ∃𝑢𝑓𝑧((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))
1816, 17sylibr 134 . . . . . . . . 9 (∃𝑢𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → ∃𝑧𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))
19182eximi 1654 . . . . . . . 8 (∃𝑤𝑣𝑢𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → ∃𝑤𝑣𝑧𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))
20 exrot3 1742 . . . . . . . 8 (∃𝑧𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ) ↔ ∃𝑤𝑣𝑧𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))
2119, 20sylibr 134 . . . . . . 7 (∃𝑤𝑣𝑢𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → ∃𝑧𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))
228, 21syl 14 . . . . . 6 ((𝑥Q𝑦Q) → ∃𝑧𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))
2322pm4.71i 395 . . . . 5 ((𝑥Q𝑦Q) ↔ ((𝑥Q𝑦Q) ∧ ∃𝑧𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q )))
24 19.42v 1962 . . . . 5 (∃𝑧((𝑥Q𝑦Q) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q )) ↔ ((𝑥Q𝑦Q) ∧ ∃𝑧𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q )))
2523, 24bitr4i 187 . . . 4 ((𝑥Q𝑦Q) ↔ ∃𝑧((𝑥Q𝑦Q) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q )))
2625opabbii 4198 . . 3 {⟨𝑥, 𝑦⟩ ∣ (𝑥Q𝑦Q)} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧((𝑥Q𝑦Q) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))}
271, 3, 263eqtr4i 2269 . 2 dom ·Q = {⟨𝑥, 𝑦⟩ ∣ (𝑥Q𝑦Q)}
28 df-xp 4780 . 2 (Q × Q) = {⟨𝑥, 𝑦⟩ ∣ (𝑥Q𝑦Q)}
2927, 28eqtr4i 2262 1 dom ·Q = (Q × Q)
Colors of variables:    wff set class
This proof depends on syntax axioms:  wa 104   = wceq 1402  wex 1545  wcel 2209  Vcvv 2821  cop 3712  {copab 4191   × cxp 4772  dom cdm 4774  (class class class)co 6085  {coprab 6086  [cec 6805   ·pQ cmpq 7644   ~Q ceq 7646  Qcnq 7647   ·Q cmq 7650
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-iinf 4735
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-iom 4738  df-xp 4780  df-cnv 4782  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-oprab 6089  df-ec 6809  df-qs 6813  df-ni 7671  df-enq 7714  df-nqqs 7715  df-mqqs 7717
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator