Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mulclnq0 | GIF version |
Description: Closure of multiplication on non-negative fractions. (Contributed by Jim Kingdon, 30-Nov-2019.) |
Ref | Expression |
---|---|
mulclnq0 | ⊢ ((𝐴 ∈ Q0 ∧ 𝐵 ∈ Q0) → (𝐴 ·Q0 𝐵) ∈ Q0) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-nq0 6523 | . . 3 ⊢ Q0 = ((ω × N) / ~Q0 ) | |
2 | oveq1 5519 | . . . 4 ⊢ ([〈𝑥, 𝑦〉] ~Q0 = 𝐴 → ([〈𝑥, 𝑦〉] ~Q0 ·Q0 [〈𝑧, 𝑤〉] ~Q0 ) = (𝐴 ·Q0 [〈𝑧, 𝑤〉] ~Q0 )) | |
3 | 2 | eleq1d 2106 | . . 3 ⊢ ([〈𝑥, 𝑦〉] ~Q0 = 𝐴 → (([〈𝑥, 𝑦〉] ~Q0 ·Q0 [〈𝑧, 𝑤〉] ~Q0 ) ∈ ((ω × N) / ~Q0 ) ↔ (𝐴 ·Q0 [〈𝑧, 𝑤〉] ~Q0 ) ∈ ((ω × N) / ~Q0 ))) |
4 | oveq2 5520 | . . . 4 ⊢ ([〈𝑧, 𝑤〉] ~Q0 = 𝐵 → (𝐴 ·Q0 [〈𝑧, 𝑤〉] ~Q0 ) = (𝐴 ·Q0 𝐵)) | |
5 | 4 | eleq1d 2106 | . . 3 ⊢ ([〈𝑧, 𝑤〉] ~Q0 = 𝐵 → ((𝐴 ·Q0 [〈𝑧, 𝑤〉] ~Q0 ) ∈ ((ω × N) / ~Q0 ) ↔ (𝐴 ·Q0 𝐵) ∈ ((ω × N) / ~Q0 ))) |
6 | mulnnnq0 6548 | . . . 4 ⊢ (((𝑥 ∈ ω ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ ω ∧ 𝑤 ∈ N)) → ([〈𝑥, 𝑦〉] ~Q0 ·Q0 [〈𝑧, 𝑤〉] ~Q0 ) = [〈(𝑥 ·𝑜 𝑧), (𝑦 ·𝑜 𝑤)〉] ~Q0 ) | |
7 | nnmcl 6060 | . . . . . . 7 ⊢ ((𝑥 ∈ ω ∧ 𝑧 ∈ ω) → (𝑥 ·𝑜 𝑧) ∈ ω) | |
8 | mulpiord 6415 | . . . . . . . 8 ⊢ ((𝑦 ∈ N ∧ 𝑤 ∈ N) → (𝑦 ·N 𝑤) = (𝑦 ·𝑜 𝑤)) | |
9 | mulclpi 6426 | . . . . . . . 8 ⊢ ((𝑦 ∈ N ∧ 𝑤 ∈ N) → (𝑦 ·N 𝑤) ∈ N) | |
10 | 8, 9 | eqeltrrd 2115 | . . . . . . 7 ⊢ ((𝑦 ∈ N ∧ 𝑤 ∈ N) → (𝑦 ·𝑜 𝑤) ∈ N) |
11 | 7, 10 | anim12i 321 | . . . . . 6 ⊢ (((𝑥 ∈ ω ∧ 𝑧 ∈ ω) ∧ (𝑦 ∈ N ∧ 𝑤 ∈ N)) → ((𝑥 ·𝑜 𝑧) ∈ ω ∧ (𝑦 ·𝑜 𝑤) ∈ N)) |
12 | 11 | an4s 522 | . . . . 5 ⊢ (((𝑥 ∈ ω ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ ω ∧ 𝑤 ∈ N)) → ((𝑥 ·𝑜 𝑧) ∈ ω ∧ (𝑦 ·𝑜 𝑤) ∈ N)) |
13 | opelxpi 4376 | . . . . 5 ⊢ (((𝑥 ·𝑜 𝑧) ∈ ω ∧ (𝑦 ·𝑜 𝑤) ∈ N) → 〈(𝑥 ·𝑜 𝑧), (𝑦 ·𝑜 𝑤)〉 ∈ (ω × N)) | |
14 | enq0ex 6537 | . . . . . 6 ⊢ ~Q0 ∈ V | |
15 | 14 | ecelqsi 6160 | . . . . 5 ⊢ (〈(𝑥 ·𝑜 𝑧), (𝑦 ·𝑜 𝑤)〉 ∈ (ω × N) → [〈(𝑥 ·𝑜 𝑧), (𝑦 ·𝑜 𝑤)〉] ~Q0 ∈ ((ω × N) / ~Q0 )) |
16 | 12, 13, 15 | 3syl 17 | . . . 4 ⊢ (((𝑥 ∈ ω ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ ω ∧ 𝑤 ∈ N)) → [〈(𝑥 ·𝑜 𝑧), (𝑦 ·𝑜 𝑤)〉] ~Q0 ∈ ((ω × N) / ~Q0 )) |
17 | 6, 16 | eqeltrd 2114 | . . 3 ⊢ (((𝑥 ∈ ω ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ ω ∧ 𝑤 ∈ N)) → ([〈𝑥, 𝑦〉] ~Q0 ·Q0 [〈𝑧, 𝑤〉] ~Q0 ) ∈ ((ω × N) / ~Q0 )) |
18 | 1, 3, 5, 17 | 2ecoptocl 6194 | . 2 ⊢ ((𝐴 ∈ Q0 ∧ 𝐵 ∈ Q0) → (𝐴 ·Q0 𝐵) ∈ ((ω × N) / ~Q0 )) |
19 | 18, 1 | syl6eleqr 2131 | 1 ⊢ ((𝐴 ∈ Q0 ∧ 𝐵 ∈ Q0) → (𝐴 ·Q0 𝐵) ∈ Q0) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 = wceq 1243 ∈ wcel 1393 〈cop 3378 ωcom 4313 × cxp 4343 (class class class)co 5512 ·𝑜 comu 5999 [cec 6104 / cqs 6105 Ncnpi 6370 ·N cmi 6372 ~Q0 ceq0 6384 Q0cnq0 6385 ·Q0 cmq0 6388 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-13 1404 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-coll 3872 ax-sep 3875 ax-nul 3883 ax-pow 3927 ax-pr 3944 ax-un 4170 ax-setind 4262 ax-iinf 4311 |
This theorem depends on definitions: df-bi 110 df-dc 743 df-3or 886 df-3an 887 df-tru 1246 df-fal 1249 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ne 2206 df-ral 2311 df-rex 2312 df-reu 2313 df-rab 2315 df-v 2559 df-sbc 2765 df-csb 2853 df-dif 2920 df-un 2922 df-in 2924 df-ss 2931 df-nul 3225 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-int 3616 df-iun 3659 df-br 3765 df-opab 3819 df-mpt 3820 df-tr 3855 df-id 4030 df-iord 4103 df-on 4105 df-suc 4108 df-iom 4314 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-rn 4356 df-res 4357 df-ima 4358 df-iota 4867 df-fun 4904 df-fn 4905 df-f 4906 df-f1 4907 df-fo 4908 df-f1o 4909 df-fv 4910 df-ov 5515 df-oprab 5516 df-mpt2 5517 df-1st 5767 df-2nd 5768 df-recs 5920 df-irdg 5957 df-oadd 6005 df-omul 6006 df-er 6106 df-ec 6108 df-qs 6112 df-ni 6402 df-mi 6404 df-enq0 6522 df-nq0 6523 df-mq0 6526 |
This theorem is referenced by: prarloclemcalc 6600 |
Copyright terms: Public domain | W3C validator |