| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dfmq0qs | GIF version | ||
| Description: Multiplication on nonnegative fractions. This definition is similar to df-mq0 7611 but expands Q0. (Contributed by Jim Kingdon, 22-Nov-2019.) |
| Ref | Expression |
|---|---|
| dfmq0qs | ⊢ ·Q0 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ ((ω × N) / ~Q0 ) ∧ 𝑦 ∈ ((ω × N) / ~Q0 )) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [〈𝑤, 𝑣〉] ~Q0 ∧ 𝑦 = [〈𝑢, 𝑓〉] ~Q0 ) ∧ 𝑧 = [〈(𝑤 ·o 𝑢), (𝑣 ·o 𝑓)〉] ~Q0 ))} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-mq0 7611 | . 2 ⊢ ·Q0 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ Q0 ∧ 𝑦 ∈ Q0) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [〈𝑤, 𝑣〉] ~Q0 ∧ 𝑦 = [〈𝑢, 𝑓〉] ~Q0 ) ∧ 𝑧 = [〈(𝑤 ·o 𝑢), (𝑣 ·o 𝑓)〉] ~Q0 ))} | |
| 2 | df-nq0 7608 | . . . . . 6 ⊢ Q0 = ((ω × N) / ~Q0 ) | |
| 3 | 2 | eleq2i 2296 | . . . . 5 ⊢ (𝑥 ∈ Q0 ↔ 𝑥 ∈ ((ω × N) / ~Q0 )) |
| 4 | 2 | eleq2i 2296 | . . . . 5 ⊢ (𝑦 ∈ Q0 ↔ 𝑦 ∈ ((ω × N) / ~Q0 )) |
| 5 | 3, 4 | anbi12i 460 | . . . 4 ⊢ ((𝑥 ∈ Q0 ∧ 𝑦 ∈ Q0) ↔ (𝑥 ∈ ((ω × N) / ~Q0 ) ∧ 𝑦 ∈ ((ω × N) / ~Q0 ))) |
| 6 | 5 | anbi1i 458 | . . 3 ⊢ (((𝑥 ∈ Q0 ∧ 𝑦 ∈ Q0) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [〈𝑤, 𝑣〉] ~Q0 ∧ 𝑦 = [〈𝑢, 𝑓〉] ~Q0 ) ∧ 𝑧 = [〈(𝑤 ·o 𝑢), (𝑣 ·o 𝑓)〉] ~Q0 )) ↔ ((𝑥 ∈ ((ω × N) / ~Q0 ) ∧ 𝑦 ∈ ((ω × N) / ~Q0 )) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [〈𝑤, 𝑣〉] ~Q0 ∧ 𝑦 = [〈𝑢, 𝑓〉] ~Q0 ) ∧ 𝑧 = [〈(𝑤 ·o 𝑢), (𝑣 ·o 𝑓)〉] ~Q0 ))) |
| 7 | 6 | oprabbii 6058 | . 2 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ Q0 ∧ 𝑦 ∈ Q0) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [〈𝑤, 𝑣〉] ~Q0 ∧ 𝑦 = [〈𝑢, 𝑓〉] ~Q0 ) ∧ 𝑧 = [〈(𝑤 ·o 𝑢), (𝑣 ·o 𝑓)〉] ~Q0 ))} = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ ((ω × N) / ~Q0 ) ∧ 𝑦 ∈ ((ω × N) / ~Q0 )) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [〈𝑤, 𝑣〉] ~Q0 ∧ 𝑦 = [〈𝑢, 𝑓〉] ~Q0 ) ∧ 𝑧 = [〈(𝑤 ·o 𝑢), (𝑣 ·o 𝑓)〉] ~Q0 ))} |
| 8 | 1, 7 | eqtri 2250 | 1 ⊢ ·Q0 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ ((ω × N) / ~Q0 ) ∧ 𝑦 ∈ ((ω × N) / ~Q0 )) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [〈𝑤, 𝑣〉] ~Q0 ∧ 𝑦 = [〈𝑢, 𝑓〉] ~Q0 ) ∧ 𝑧 = [〈(𝑤 ·o 𝑢), (𝑣 ·o 𝑓)〉] ~Q0 ))} |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 = wceq 1395 ∃wex 1538 ∈ wcel 2200 〈cop 3669 ωcom 4681 × cxp 4716 (class class class)co 6000 {coprab 6001 ·o comu 6558 [cec 6676 / cqs 6677 Ncnpi 7455 ~Q0 ceq0 7469 Q0cnq0 7470 ·Q0 cmq0 7473 |
| 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-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-11 1552 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-oprab 6004 df-nq0 7608 df-mq0 7611 |
| This theorem is referenced by: mulnnnq0 7633 |
| Copyright terms: Public domain | W3C validator |