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

Theorem dmmulpq 7599
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 6101 . . 3 dom {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥Q𝑦Q) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧((𝑥Q𝑦Q) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))}
2 df-mqqs 7569 . . . 4 ·Q = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥Q𝑦Q) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))}
32dmeqi 4932 . . 3 dom ·Q = dom {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥Q𝑦Q) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))}
4 dmaddpqlem 7596 . . . . . . . . 9 (𝑥Q → ∃𝑤𝑣 𝑥 = [⟨𝑤, 𝑣⟩] ~Q )
5 dmaddpqlem 7596 . . . . . . . . 9 (𝑦Q → ∃𝑢𝑓 𝑦 = [⟨𝑢, 𝑓⟩] ~Q )
64, 5anim12i 338 . . . . . . . 8 ((𝑥Q𝑦Q) → (∃𝑤𝑣 𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ ∃𝑢𝑓 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ))
7 ee4anv 1987 . . . . . . . 8 (∃𝑤𝑣𝑢𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ↔ (∃𝑤𝑣 𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ ∃𝑢𝑓 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ))
86, 7sylibr 134 . . . . . . 7 ((𝑥Q𝑦Q) → ∃𝑤𝑣𝑢𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ))
9 enqex 7579 . . . . . . . . . . . . . 14 ~Q ∈ V
10 ecexg 6705 . . . . . . . . . . . . . 14 ( ~Q ∈ V → [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ∈ V)
119, 10ax-mp 5 . . . . . . . . . . . . 13 [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ∈ V
1211isseti 2811 . . . . . . . . . . . 12 𝑧 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q
13 ax-ia3 108 . . . . . . . . . . . . 13 ((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → (𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q → ((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q )))
1413eximdv 1928 . . . . . . . . . . . 12 ((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → (∃𝑧 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q → ∃𝑧((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q )))
1512, 14mpi 15 . . . . . . . . . . 11 ((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → ∃𝑧((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))
16152eximi 1649 . . . . . . . . . 10 (∃𝑢𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → ∃𝑢𝑓𝑧((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))
17 exrot3 1738 . . . . . . . . . 10 (∃𝑧𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ) ↔ ∃𝑢𝑓𝑧((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))
1816, 17sylibr 134 . . . . . . . . 9 (∃𝑢𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → ∃𝑧𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))
19182eximi 1649 . . . . . . . 8 (∃𝑤𝑣𝑢𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → ∃𝑤𝑣𝑧𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))
20 exrot3 1738 . . . . . . . 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 391 . . . . 5 ((𝑥Q𝑦Q) ↔ ((𝑥Q𝑦Q) ∧ ∃𝑧𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q )))
24 19.42v 1955 . . . . 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 4156 . . 3 {⟨𝑥, 𝑦⟩ ∣ (𝑥Q𝑦Q)} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧((𝑥Q𝑦Q) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ ·pQ𝑢, 𝑓⟩)] ~Q ))}
271, 3, 263eqtr4i 2262 . 2 dom ·Q = {⟨𝑥, 𝑦⟩ ∣ (𝑥Q𝑦Q)}
28 df-xp 4731 . 2 (Q × Q) = {⟨𝑥, 𝑦⟩ ∣ (𝑥Q𝑦Q)}
2927, 28eqtr4i 2255 1 dom ·Q = (Q × Q)
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1397  wex 1540  wcel 2202  Vcvv 2802  cop 3672  {copab 4149   × cxp 4723  dom cdm 4725  (class class class)co 6017  {coprab 6018  [cec 6699   ·pQ cmpq 7496   ~Q ceq 7498  Qcnq 7499   ·Q cmq 7502
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-iom 4689  df-xp 4731  df-cnv 4733  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-oprab 6021  df-ec 6703  df-qs 6707  df-ni 7523  df-enq 7566  df-nqqs 7567  df-mqqs 7569
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator