Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > addpipqqslem | GIF version |
Description: Lemma for addpipqqs 7273. (Contributed by Jim Kingdon, 11-Sep-2019.) |
Ref | Expression |
---|---|
addpipqqslem | ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → 〈((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)), (𝐵 ·N 𝐷)〉 ∈ (N × N)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mulclpi 7231 | . . . 4 ⊢ ((𝐴 ∈ N ∧ 𝐷 ∈ N) → (𝐴 ·N 𝐷) ∈ N) | |
2 | mulclpi 7231 | . . . 4 ⊢ ((𝐵 ∈ N ∧ 𝐶 ∈ N) → (𝐵 ·N 𝐶) ∈ N) | |
3 | addclpi 7230 | . . . 4 ⊢ (((𝐴 ·N 𝐷) ∈ N ∧ (𝐵 ·N 𝐶) ∈ N) → ((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)) ∈ N) | |
4 | 1, 2, 3 | syl2an 287 | . . 3 ⊢ (((𝐴 ∈ N ∧ 𝐷 ∈ N) ∧ (𝐵 ∈ N ∧ 𝐶 ∈ N)) → ((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)) ∈ N) |
5 | 4 | an42s 579 | . 2 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → ((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)) ∈ N) |
6 | mulclpi 7231 | . . 3 ⊢ ((𝐵 ∈ N ∧ 𝐷 ∈ N) → (𝐵 ·N 𝐷) ∈ N) | |
7 | 6 | ad2ant2l 500 | . 2 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → (𝐵 ·N 𝐷) ∈ N) |
8 | opelxpi 4615 | . 2 ⊢ ((((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)) ∈ N ∧ (𝐵 ·N 𝐷) ∈ N) → 〈((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)), (𝐵 ·N 𝐷)〉 ∈ (N × N)) | |
9 | 5, 7, 8 | syl2anc 409 | 1 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → 〈((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)), (𝐵 ·N 𝐷)〉 ∈ (N × N)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∈ wcel 2128 〈cop 3563 × cxp 4581 (class class class)co 5818 Ncnpi 7175 +N cpli 7176 ·N cmi 7177 |
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-in1 604 ax-in2 605 ax-io 699 ax-5 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-13 2130 ax-14 2131 ax-ext 2139 ax-coll 4079 ax-sep 4082 ax-nul 4090 ax-pow 4134 ax-pr 4168 ax-un 4392 ax-setind 4494 ax-iinf 4545 |
This theorem depends on definitions: df-bi 116 df-dc 821 df-3an 965 df-tru 1338 df-fal 1341 df-nf 1441 df-sb 1743 df-eu 2009 df-mo 2010 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ne 2328 df-ral 2440 df-rex 2441 df-reu 2442 df-rab 2444 df-v 2714 df-sbc 2938 df-csb 3032 df-dif 3104 df-un 3106 df-in 3108 df-ss 3115 df-nul 3395 df-pw 3545 df-sn 3566 df-pr 3567 df-op 3569 df-uni 3773 df-int 3808 df-iun 3851 df-br 3966 df-opab 4026 df-mpt 4027 df-tr 4063 df-id 4252 df-iord 4325 df-on 4327 df-suc 4330 df-iom 4548 df-xp 4589 df-rel 4590 df-cnv 4591 df-co 4592 df-dm 4593 df-rn 4594 df-res 4595 df-ima 4596 df-iota 5132 df-fun 5169 df-fn 5170 df-f 5171 df-f1 5172 df-fo 5173 df-f1o 5174 df-fv 5175 df-ov 5821 df-oprab 5822 df-mpo 5823 df-1st 6082 df-2nd 6083 df-recs 6246 df-irdg 6311 df-oadd 6361 df-omul 6362 df-ni 7207 df-pli 7208 df-mi 7209 |
This theorem is referenced by: addpipqqs 7273 |
Copyright terms: Public domain | W3C validator |