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

Theorem dfmpq2 7175
 Description: Alternate definition of pre-multiplication on positive fractions. (Contributed by Jim Kingdon, 13-Sep-2019.)
Assertion
Ref Expression
dfmpq2 ·pQ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩))}
Distinct variable group:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢,𝑓

Proof of Theorem dfmpq2
StepHypRef Expression
1 df-mpo 5779 . 2 (𝑥 ∈ (N × N), 𝑦 ∈ (N × N) ↦ ⟨((1st𝑥) ·N (1st𝑦)), ((2nd𝑥) ·N (2nd𝑦))⟩) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ 𝑧 = ⟨((1st𝑥) ·N (1st𝑦)), ((2nd𝑥) ·N (2nd𝑦))⟩)}
2 df-mpq 7165 . 2 ·pQ = (𝑥 ∈ (N × N), 𝑦 ∈ (N × N) ↦ ⟨((1st𝑥) ·N (1st𝑦)), ((2nd𝑥) ·N (2nd𝑦))⟩)
3 1st2nd2 6073 . . . . . . . . . 10 (𝑥 ∈ (N × N) → 𝑥 = ⟨(1st𝑥), (2nd𝑥)⟩)
43eqeq1d 2148 . . . . . . . . 9 (𝑥 ∈ (N × N) → (𝑥 = ⟨𝑤, 𝑣⟩ ↔ ⟨(1st𝑥), (2nd𝑥)⟩ = ⟨𝑤, 𝑣⟩))
5 1st2nd2 6073 . . . . . . . . . 10 (𝑦 ∈ (N × N) → 𝑦 = ⟨(1st𝑦), (2nd𝑦)⟩)
65eqeq1d 2148 . . . . . . . . 9 (𝑦 ∈ (N × N) → (𝑦 = ⟨𝑢, 𝑓⟩ ↔ ⟨(1st𝑦), (2nd𝑦)⟩ = ⟨𝑢, 𝑓⟩))
74, 6bi2anan9 595 . . . . . . . 8 ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → ((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ↔ (⟨(1st𝑥), (2nd𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st𝑦), (2nd𝑦)⟩ = ⟨𝑢, 𝑓⟩)))
87anbi1d 460 . . . . . . 7 ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩) ↔ ((⟨(1st𝑥), (2nd𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st𝑦), (2nd𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩)))
98bicomd 140 . . . . . 6 ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (((⟨(1st𝑥), (2nd𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st𝑦), (2nd𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩) ↔ ((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩)))
1094exbidv 1842 . . . . 5 ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (∃𝑤𝑣𝑢𝑓((⟨(1st𝑥), (2nd𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st𝑦), (2nd𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩) ↔ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩)))
11 xp1st 6063 . . . . . . 7 (𝑥 ∈ (N × N) → (1st𝑥) ∈ N)
12 xp2nd 6064 . . . . . . 7 (𝑥 ∈ (N × N) → (2nd𝑥) ∈ N)
1311, 12jca 304 . . . . . 6 (𝑥 ∈ (N × N) → ((1st𝑥) ∈ N ∧ (2nd𝑥) ∈ N))
14 xp1st 6063 . . . . . . 7 (𝑦 ∈ (N × N) → (1st𝑦) ∈ N)
15 xp2nd 6064 . . . . . . 7 (𝑦 ∈ (N × N) → (2nd𝑦) ∈ N)
1614, 15jca 304 . . . . . 6 (𝑦 ∈ (N × N) → ((1st𝑦) ∈ N ∧ (2nd𝑦) ∈ N))
17 simpll 518 . . . . . . . . . 10 (((𝑤 = (1st𝑥) ∧ 𝑣 = (2nd𝑥)) ∧ (𝑢 = (1st𝑦) ∧ 𝑓 = (2nd𝑦))) → 𝑤 = (1st𝑥))
18 simprl 520 . . . . . . . . . 10 (((𝑤 = (1st𝑥) ∧ 𝑣 = (2nd𝑥)) ∧ (𝑢 = (1st𝑦) ∧ 𝑓 = (2nd𝑦))) → 𝑢 = (1st𝑦))
1917, 18oveq12d 5792 . . . . . . . . 9 (((𝑤 = (1st𝑥) ∧ 𝑣 = (2nd𝑥)) ∧ (𝑢 = (1st𝑦) ∧ 𝑓 = (2nd𝑦))) → (𝑤 ·N 𝑢) = ((1st𝑥) ·N (1st𝑦)))
20 simplr 519 . . . . . . . . . 10 (((𝑤 = (1st𝑥) ∧ 𝑣 = (2nd𝑥)) ∧ (𝑢 = (1st𝑦) ∧ 𝑓 = (2nd𝑦))) → 𝑣 = (2nd𝑥))
21 simprr 521 . . . . . . . . . 10 (((𝑤 = (1st𝑥) ∧ 𝑣 = (2nd𝑥)) ∧ (𝑢 = (1st𝑦) ∧ 𝑓 = (2nd𝑦))) → 𝑓 = (2nd𝑦))
2220, 21oveq12d 5792 . . . . . . . . 9 (((𝑤 = (1st𝑥) ∧ 𝑣 = (2nd𝑥)) ∧ (𝑢 = (1st𝑦) ∧ 𝑓 = (2nd𝑦))) → (𝑣 ·N 𝑓) = ((2nd𝑥) ·N (2nd𝑦)))
2319, 22opeq12d 3713 . . . . . . . 8 (((𝑤 = (1st𝑥) ∧ 𝑣 = (2nd𝑥)) ∧ (𝑢 = (1st𝑦) ∧ 𝑓 = (2nd𝑦))) → ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩ = ⟨((1st𝑥) ·N (1st𝑦)), ((2nd𝑥) ·N (2nd𝑦))⟩)
2423eqeq2d 2151 . . . . . . 7 (((𝑤 = (1st𝑥) ∧ 𝑣 = (2nd𝑥)) ∧ (𝑢 = (1st𝑦) ∧ 𝑓 = (2nd𝑦))) → (𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩ ↔ 𝑧 = ⟨((1st𝑥) ·N (1st𝑦)), ((2nd𝑥) ·N (2nd𝑦))⟩))
2524copsex4g 4169 . . . . . 6 ((((1st𝑥) ∈ N ∧ (2nd𝑥) ∈ N) ∧ ((1st𝑦) ∈ N ∧ (2nd𝑦) ∈ N)) → (∃𝑤𝑣𝑢𝑓((⟨(1st𝑥), (2nd𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st𝑦), (2nd𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩) ↔ 𝑧 = ⟨((1st𝑥) ·N (1st𝑦)), ((2nd𝑥) ·N (2nd𝑦))⟩))
2613, 16, 25syl2an 287 . . . . 5 ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (∃𝑤𝑣𝑢𝑓((⟨(1st𝑥), (2nd𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st𝑦), (2nd𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩) ↔ 𝑧 = ⟨((1st𝑥) ·N (1st𝑦)), ((2nd𝑥) ·N (2nd𝑦))⟩))
2710, 26bitr3d 189 . . . 4 ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩) ↔ 𝑧 = ⟨((1st𝑥) ·N (1st𝑦)), ((2nd𝑥) ·N (2nd𝑦))⟩))
2827pm5.32i 449 . . 3 (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩)) ↔ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ 𝑧 = ⟨((1st𝑥) ·N (1st𝑦)), ((2nd𝑥) ·N (2nd𝑦))⟩))
2928oprabbii 5826 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩))} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ 𝑧 = ⟨((1st𝑥) ·N (1st𝑦)), ((2nd𝑥) ·N (2nd𝑦))⟩)}
301, 2, 293eqtr4i 2170 1 ·pQ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩))}
 Colors of variables: wff set class Syntax hints:   ∧ wa 103   ↔ wb 104   = wceq 1331  ∃wex 1468   ∈ wcel 1480  ⟨cop 3530   × cxp 4537  ‘cfv 5123  (class class class)co 5774  {coprab 5775   ∈ cmpo 5776  1st c1st 6036  2nd c2nd 6037  Ncnpi 7092   ·N cmi 7094   ·pQ cmpq 7097 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355 This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-sbc 2910  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-iota 5088  df-fun 5125  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-mpq 7165 This theorem is referenced by:  mulpipqqs  7193
 Copyright terms: Public domain W3C validator