![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > addpipqqslem | GIF version |
Description: Lemma for addpipqqs 7432. (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 7390 | . . . 4 ⊢ ((𝐴 ∈ N ∧ 𝐷 ∈ N) → (𝐴 ·N 𝐷) ∈ N) | |
2 | mulclpi 7390 | . . . 4 ⊢ ((𝐵 ∈ N ∧ 𝐶 ∈ N) → (𝐵 ·N 𝐶) ∈ N) | |
3 | addclpi 7389 | . . . 4 ⊢ (((𝐴 ·N 𝐷) ∈ N ∧ (𝐵 ·N 𝐶) ∈ N) → ((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)) ∈ N) | |
4 | 1, 2, 3 | syl2an 289 | . . 3 ⊢ (((𝐴 ∈ N ∧ 𝐷 ∈ N) ∧ (𝐵 ∈ N ∧ 𝐶 ∈ N)) → ((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)) ∈ N) |
5 | 4 | an42s 589 | . 2 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → ((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)) ∈ N) |
6 | mulclpi 7390 | . . 3 ⊢ ((𝐵 ∈ N ∧ 𝐷 ∈ N) → (𝐵 ·N 𝐷) ∈ N) | |
7 | 6 | ad2ant2l 508 | . 2 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → (𝐵 ·N 𝐷) ∈ N) |
8 | opelxpi 4692 | . 2 ⊢ ((((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)) ∈ N ∧ (𝐵 ·N 𝐷) ∈ N) → 〈((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)), (𝐵 ·N 𝐷)〉 ∈ (N × N)) | |
9 | 5, 7, 8 | syl2anc 411 | 1 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → 〈((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)), (𝐵 ·N 𝐷)〉 ∈ (N × N)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2164 〈cop 3622 × cxp 4658 (class class class)co 5919 Ncnpi 7334 +N cpli 7335 ·N cmi 7336 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4145 ax-sep 4148 ax-nul 4156 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-iinf 4621 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-tr 4129 df-id 4325 df-iord 4398 df-on 4400 df-suc 4403 df-iom 4624 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-ov 5922 df-oprab 5923 df-mpo 5924 df-1st 6195 df-2nd 6196 df-recs 6360 df-irdg 6425 df-oadd 6475 df-omul 6476 df-ni 7366 df-pli 7367 df-mi 7368 |
This theorem is referenced by: addpipqqs 7432 |
Copyright terms: Public domain | W3C validator |