MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mulerpqlem Structured version   Visualization version   GIF version

Theorem mulerpqlem 10223
Description: Lemma for mulerpq 10225. (Contributed by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
Assertion
Ref Expression
mulerpqlem ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐴 ~Q 𝐵 ↔ (𝐴 ·pQ 𝐶) ~Q (𝐵 ·pQ 𝐶)))

Proof of Theorem mulerpqlem
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 xp1st 7577 . . . . 5 (𝐴 ∈ (N × N) → (1st𝐴) ∈ N)
213ad2ant1 1126 . . . 4 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (1st𝐴) ∈ N)
3 xp1st 7577 . . . . 5 (𝐶 ∈ (N × N) → (1st𝐶) ∈ N)
433ad2ant3 1128 . . . 4 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (1st𝐶) ∈ N)
5 mulclpi 10161 . . . 4 (((1st𝐴) ∈ N ∧ (1st𝐶) ∈ N) → ((1st𝐴) ·N (1st𝐶)) ∈ N)
62, 4, 5syl2anc 584 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((1st𝐴) ·N (1st𝐶)) ∈ N)
7 xp2nd 7578 . . . . 5 (𝐴 ∈ (N × N) → (2nd𝐴) ∈ N)
873ad2ant1 1126 . . . 4 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (2nd𝐴) ∈ N)
9 xp2nd 7578 . . . . 5 (𝐶 ∈ (N × N) → (2nd𝐶) ∈ N)
1093ad2ant3 1128 . . . 4 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (2nd𝐶) ∈ N)
11 mulclpi 10161 . . . 4 (((2nd𝐴) ∈ N ∧ (2nd𝐶) ∈ N) → ((2nd𝐴) ·N (2nd𝐶)) ∈ N)
128, 10, 11syl2anc 584 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((2nd𝐴) ·N (2nd𝐶)) ∈ N)
13 xp1st 7577 . . . . 5 (𝐵 ∈ (N × N) → (1st𝐵) ∈ N)
14133ad2ant2 1127 . . . 4 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (1st𝐵) ∈ N)
15 mulclpi 10161 . . . 4 (((1st𝐵) ∈ N ∧ (1st𝐶) ∈ N) → ((1st𝐵) ·N (1st𝐶)) ∈ N)
1614, 4, 15syl2anc 584 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((1st𝐵) ·N (1st𝐶)) ∈ N)
17 xp2nd 7578 . . . . 5 (𝐵 ∈ (N × N) → (2nd𝐵) ∈ N)
18173ad2ant2 1127 . . . 4 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (2nd𝐵) ∈ N)
19 mulclpi 10161 . . . 4 (((2nd𝐵) ∈ N ∧ (2nd𝐶) ∈ N) → ((2nd𝐵) ·N (2nd𝐶)) ∈ N)
2018, 10, 19syl2anc 584 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((2nd𝐵) ·N (2nd𝐶)) ∈ N)
21 enqbreq 10187 . . 3 (((((1st𝐴) ·N (1st𝐶)) ∈ N ∧ ((2nd𝐴) ·N (2nd𝐶)) ∈ N) ∧ (((1st𝐵) ·N (1st𝐶)) ∈ N ∧ ((2nd𝐵) ·N (2nd𝐶)) ∈ N)) → (⟨((1st𝐴) ·N (1st𝐶)), ((2nd𝐴) ·N (2nd𝐶))⟩ ~Q ⟨((1st𝐵) ·N (1st𝐶)), ((2nd𝐵) ·N (2nd𝐶))⟩ ↔ (((1st𝐴) ·N (1st𝐶)) ·N ((2nd𝐵) ·N (2nd𝐶))) = (((2nd𝐴) ·N (2nd𝐶)) ·N ((1st𝐵) ·N (1st𝐶)))))
226, 12, 16, 20, 21syl22anc 835 . 2 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (⟨((1st𝐴) ·N (1st𝐶)), ((2nd𝐴) ·N (2nd𝐶))⟩ ~Q ⟨((1st𝐵) ·N (1st𝐶)), ((2nd𝐵) ·N (2nd𝐶))⟩ ↔ (((1st𝐴) ·N (1st𝐶)) ·N ((2nd𝐵) ·N (2nd𝐶))) = (((2nd𝐴) ·N (2nd𝐶)) ·N ((1st𝐵) ·N (1st𝐶)))))
23 mulpipq2 10207 . . . 4 ((𝐴 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐴 ·pQ 𝐶) = ⟨((1st𝐴) ·N (1st𝐶)), ((2nd𝐴) ·N (2nd𝐶))⟩)
24233adant2 1124 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐴 ·pQ 𝐶) = ⟨((1st𝐴) ·N (1st𝐶)), ((2nd𝐴) ·N (2nd𝐶))⟩)
25 mulpipq2 10207 . . . 4 ((𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐵 ·pQ 𝐶) = ⟨((1st𝐵) ·N (1st𝐶)), ((2nd𝐵) ·N (2nd𝐶))⟩)
26253adant1 1123 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐵 ·pQ 𝐶) = ⟨((1st𝐵) ·N (1st𝐶)), ((2nd𝐵) ·N (2nd𝐶))⟩)
2724, 26breq12d 4975 . 2 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((𝐴 ·pQ 𝐶) ~Q (𝐵 ·pQ 𝐶) ↔ ⟨((1st𝐴) ·N (1st𝐶)), ((2nd𝐴) ·N (2nd𝐶))⟩ ~Q ⟨((1st𝐵) ·N (1st𝐶)), ((2nd𝐵) ·N (2nd𝐶))⟩))
28 enqbreq2 10188 . . . 4 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ~Q 𝐵 ↔ ((1st𝐴) ·N (2nd𝐵)) = ((1st𝐵) ·N (2nd𝐴))))
29283adant3 1125 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐴 ~Q 𝐵 ↔ ((1st𝐴) ·N (2nd𝐵)) = ((1st𝐵) ·N (2nd𝐴))))
30 mulclpi 10161 . . . . 5 (((1st𝐶) ∈ N ∧ (2nd𝐶) ∈ N) → ((1st𝐶) ·N (2nd𝐶)) ∈ N)
314, 10, 30syl2anc 584 . . . 4 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((1st𝐶) ·N (2nd𝐶)) ∈ N)
32 mulclpi 10161 . . . . 5 (((1st𝐴) ∈ N ∧ (2nd𝐵) ∈ N) → ((1st𝐴) ·N (2nd𝐵)) ∈ N)
332, 18, 32syl2anc 584 . . . 4 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((1st𝐴) ·N (2nd𝐵)) ∈ N)
34 mulcanpi 10168 . . . 4 ((((1st𝐶) ·N (2nd𝐶)) ∈ N ∧ ((1st𝐴) ·N (2nd𝐵)) ∈ N) → ((((1st𝐶) ·N (2nd𝐶)) ·N ((1st𝐴) ·N (2nd𝐵))) = (((1st𝐶) ·N (2nd𝐶)) ·N ((1st𝐵) ·N (2nd𝐴))) ↔ ((1st𝐴) ·N (2nd𝐵)) = ((1st𝐵) ·N (2nd𝐴))))
3531, 33, 34syl2anc 584 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((((1st𝐶) ·N (2nd𝐶)) ·N ((1st𝐴) ·N (2nd𝐵))) = (((1st𝐶) ·N (2nd𝐶)) ·N ((1st𝐵) ·N (2nd𝐴))) ↔ ((1st𝐴) ·N (2nd𝐵)) = ((1st𝐵) ·N (2nd𝐴))))
36 mulcompi 10164 . . . . . 6 (((1st𝐶) ·N (2nd𝐶)) ·N ((1st𝐴) ·N (2nd𝐵))) = (((1st𝐴) ·N (2nd𝐵)) ·N ((1st𝐶) ·N (2nd𝐶)))
37 fvex 6551 . . . . . . 7 (1st𝐴) ∈ V
38 fvex 6551 . . . . . . 7 (2nd𝐵) ∈ V
39 fvex 6551 . . . . . . 7 (1st𝐶) ∈ V
40 mulcompi 10164 . . . . . . 7 (𝑥 ·N 𝑦) = (𝑦 ·N 𝑥)
41 mulasspi 10165 . . . . . . 7 ((𝑥 ·N 𝑦) ·N 𝑧) = (𝑥 ·N (𝑦 ·N 𝑧))
42 fvex 6551 . . . . . . 7 (2nd𝐶) ∈ V
4337, 38, 39, 40, 41, 42caov4 7235 . . . . . 6 (((1st𝐴) ·N (2nd𝐵)) ·N ((1st𝐶) ·N (2nd𝐶))) = (((1st𝐴) ·N (1st𝐶)) ·N ((2nd𝐵) ·N (2nd𝐶)))
4436, 43eqtri 2819 . . . . 5 (((1st𝐶) ·N (2nd𝐶)) ·N ((1st𝐴) ·N (2nd𝐵))) = (((1st𝐴) ·N (1st𝐶)) ·N ((2nd𝐵) ·N (2nd𝐶)))
45 mulcompi 10164 . . . . . 6 (((1st𝐶) ·N (2nd𝐶)) ·N ((1st𝐵) ·N (2nd𝐴))) = (((1st𝐵) ·N (2nd𝐴)) ·N ((1st𝐶) ·N (2nd𝐶)))
46 fvex 6551 . . . . . . 7 (1st𝐵) ∈ V
47 fvex 6551 . . . . . . 7 (2nd𝐴) ∈ V
4846, 47, 39, 40, 41, 42caov4 7235 . . . . . 6 (((1st𝐵) ·N (2nd𝐴)) ·N ((1st𝐶) ·N (2nd𝐶))) = (((1st𝐵) ·N (1st𝐶)) ·N ((2nd𝐴) ·N (2nd𝐶)))
49 mulcompi 10164 . . . . . 6 (((1st𝐵) ·N (1st𝐶)) ·N ((2nd𝐴) ·N (2nd𝐶))) = (((2nd𝐴) ·N (2nd𝐶)) ·N ((1st𝐵) ·N (1st𝐶)))
5045, 48, 493eqtri 2823 . . . . 5 (((1st𝐶) ·N (2nd𝐶)) ·N ((1st𝐵) ·N (2nd𝐴))) = (((2nd𝐴) ·N (2nd𝐶)) ·N ((1st𝐵) ·N (1st𝐶)))
5144, 50eqeq12i 2809 . . . 4 ((((1st𝐶) ·N (2nd𝐶)) ·N ((1st𝐴) ·N (2nd𝐵))) = (((1st𝐶) ·N (2nd𝐶)) ·N ((1st𝐵) ·N (2nd𝐴))) ↔ (((1st𝐴) ·N (1st𝐶)) ·N ((2nd𝐵) ·N (2nd𝐶))) = (((2nd𝐴) ·N (2nd𝐶)) ·N ((1st𝐵) ·N (1st𝐶))))
5251a1i 11 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((((1st𝐶) ·N (2nd𝐶)) ·N ((1st𝐴) ·N (2nd𝐵))) = (((1st𝐶) ·N (2nd𝐶)) ·N ((1st𝐵) ·N (2nd𝐴))) ↔ (((1st𝐴) ·N (1st𝐶)) ·N ((2nd𝐵) ·N (2nd𝐶))) = (((2nd𝐴) ·N (2nd𝐶)) ·N ((1st𝐵) ·N (1st𝐶)))))
5329, 35, 523bitr2d 308 . 2 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐴 ~Q 𝐵 ↔ (((1st𝐴) ·N (1st𝐶)) ·N ((2nd𝐵) ·N (2nd𝐶))) = (((2nd𝐴) ·N (2nd𝐶)) ·N ((1st𝐵) ·N (1st𝐶)))))
5422, 27, 533bitr4rd 313 1 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐴 ~Q 𝐵 ↔ (𝐴 ·pQ 𝐶) ~Q (𝐵 ·pQ 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  w3a 1080   = wceq 1522  wcel 2081  cop 4478   class class class wbr 4962   × cxp 5441  cfv 6225  (class class class)co 7016  1st c1st 7543  2nd c2nd 7544  Ncnpi 10112   ·N cmi 10114   ·pQ cmpq 10117   ~Q ceq 10119
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1777  ax-4 1791  ax-5 1888  ax-6 1947  ax-7 1992  ax-8 2083  ax-9 2091  ax-10 2112  ax-11 2126  ax-12 2141  ax-13 2344  ax-ext 2769  ax-sep 5094  ax-nul 5101  ax-pow 5157  ax-pr 5221  ax-un 7319
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3or 1081  df-3an 1082  df-tru 1525  df-ex 1762  df-nf 1766  df-sb 2043  df-mo 2576  df-eu 2612  df-clab 2776  df-cleq 2788  df-clel 2863  df-nfc 2935  df-ne 2985  df-ral 3110  df-rex 3111  df-reu 3112  df-rab 3114  df-v 3439  df-sbc 3707  df-csb 3812  df-dif 3862  df-un 3864  df-in 3866  df-ss 3874  df-pss 3876  df-nul 4212  df-if 4382  df-pw 4455  df-sn 4473  df-pr 4475  df-tp 4477  df-op 4479  df-uni 4746  df-iun 4827  df-br 4963  df-opab 5025  df-mpt 5042  df-tr 5064  df-id 5348  df-eprel 5353  df-po 5362  df-so 5363  df-fr 5402  df-we 5404  df-xp 5449  df-rel 5450  df-cnv 5451  df-co 5452  df-dm 5453  df-rn 5454  df-res 5455  df-ima 5456  df-pred 6023  df-ord 6069  df-on 6070  df-lim 6071  df-suc 6072  df-iota 6189  df-fun 6227  df-fn 6228  df-f 6229  df-f1 6230  df-fo 6231  df-f1o 6232  df-fv 6233  df-ov 7019  df-oprab 7020  df-mpo 7021  df-om 7437  df-1st 7545  df-2nd 7546  df-wrecs 7798  df-recs 7860  df-rdg 7898  df-oadd 7957  df-omul 7958  df-ni 10140  df-mi 10142  df-mpq 10177  df-enq 10179
This theorem is referenced by:  mulerpq  10225
  Copyright terms: Public domain W3C validator