| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > enqdc | GIF version | ||
| Description: The equivalence relation for positive fractions is decidable. (Contributed by Jim Kingdon, 7-Sep-2019.) |
| Ref | Expression |
|---|---|
| enqdc | ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → DECID 〈𝐴, 𝐵〉 ~Q 〈𝐶, 𝐷〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mulclpi 7643 | . . . 4 ⊢ ((𝐴 ∈ N ∧ 𝐷 ∈ N) → (𝐴 ·N 𝐷) ∈ N) | |
| 2 | mulclpi 7643 | . . . 4 ⊢ ((𝐵 ∈ N ∧ 𝐶 ∈ N) → (𝐵 ·N 𝐶) ∈ N) | |
| 3 | pinn 7624 | . . . . 5 ⊢ ((𝐴 ·N 𝐷) ∈ N → (𝐴 ·N 𝐷) ∈ ω) | |
| 4 | pinn 7624 | . . . . 5 ⊢ ((𝐵 ·N 𝐶) ∈ N → (𝐵 ·N 𝐶) ∈ ω) | |
| 5 | nndceq 6732 | . . . . 5 ⊢ (((𝐴 ·N 𝐷) ∈ ω ∧ (𝐵 ·N 𝐶) ∈ ω) → DECID (𝐴 ·N 𝐷) = (𝐵 ·N 𝐶)) | |
| 6 | 3, 4, 5 | syl2an 289 | . . . 4 ⊢ (((𝐴 ·N 𝐷) ∈ N ∧ (𝐵 ·N 𝐶) ∈ N) → DECID (𝐴 ·N 𝐷) = (𝐵 ·N 𝐶)) |
| 7 | 1, 2, 6 | syl2an 289 | . . 3 ⊢ (((𝐴 ∈ N ∧ 𝐷 ∈ N) ∧ (𝐵 ∈ N ∧ 𝐶 ∈ N)) → DECID (𝐴 ·N 𝐷) = (𝐵 ·N 𝐶)) |
| 8 | 7 | an42s 593 | . 2 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → DECID (𝐴 ·N 𝐷) = (𝐵 ·N 𝐶)) |
| 9 | enqbreq 7671 | . . 3 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → (〈𝐴, 𝐵〉 ~Q 〈𝐶, 𝐷〉 ↔ (𝐴 ·N 𝐷) = (𝐵 ·N 𝐶))) | |
| 10 | 9 | dcbid 846 | . 2 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → (DECID 〈𝐴, 𝐵〉 ~Q 〈𝐶, 𝐷〉 ↔ DECID (𝐴 ·N 𝐷) = (𝐵 ·N 𝐶))) |
| 11 | 8, 10 | mpbird 167 | 1 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → DECID 〈𝐴, 𝐵〉 ~Q 〈𝐶, 𝐷〉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 DECID wdc 842 = wceq 1398 ∈ wcel 2203 〈cop 3692 class class class wbr 4109 ωcom 4712 (class class class)co 6050 Ncnpi 7587 ·N cmi 7589 ~Q ceq 7594 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4225 ax-sep 4228 ax-nul 4236 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-iinf 4710 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-tr 4209 df-id 4414 df-iord 4487 df-on 4489 df-suc 4492 df-iom 4713 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-recs 6536 df-irdg 6601 df-oadd 6651 df-omul 6652 df-ni 7619 df-mi 7621 df-enq 7662 |
| This theorem is referenced by: enqdc1 7677 |
| Copyright terms: Public domain | W3C validator |