Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > enq0ex | GIF version |
Description: The equivalence relation for positive fractions exists. (Contributed by Jim Kingdon, 18-Nov-2019.) |
Ref | Expression |
---|---|
enq0ex | ⊢ ~Q0 ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | omex 4502 | . . . 4 ⊢ ω ∈ V | |
2 | niex 7113 | . . . 4 ⊢ N ∈ V | |
3 | 1, 2 | xpex 4649 | . . 3 ⊢ (ω × N) ∈ V |
4 | 3, 3 | xpex 4649 | . 2 ⊢ ((ω × N) × (ω × N)) ∈ V |
5 | df-enq0 7225 | . . 3 ⊢ ~Q0 = {〈𝑣, 𝑢〉 ∣ ((𝑣 ∈ (ω × N) ∧ 𝑢 ∈ (ω × N)) ∧ ∃𝑥∃𝑦∃𝑧∃𝑤((𝑣 = 〈𝑥, 𝑦〉 ∧ 𝑢 = 〈𝑧, 𝑤〉) ∧ (𝑥 ·o 𝑤) = (𝑦 ·o 𝑧)))} | |
6 | opabssxp 4608 | . . 3 ⊢ {〈𝑣, 𝑢〉 ∣ ((𝑣 ∈ (ω × N) ∧ 𝑢 ∈ (ω × N)) ∧ ∃𝑥∃𝑦∃𝑧∃𝑤((𝑣 = 〈𝑥, 𝑦〉 ∧ 𝑢 = 〈𝑧, 𝑤〉) ∧ (𝑥 ·o 𝑤) = (𝑦 ·o 𝑧)))} ⊆ ((ω × N) × (ω × N)) | |
7 | 5, 6 | eqsstri 3124 | . 2 ⊢ ~Q0 ⊆ ((ω × N) × (ω × N)) |
8 | 4, 7 | ssexi 4061 | 1 ⊢ ~Q0 ∈ V |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 = wceq 1331 ∃wex 1468 ∈ wcel 1480 Vcvv 2681 〈cop 3525 {copab 3983 ωcom 4499 × cxp 4532 (class class class)co 5767 ·o comu 6304 Ncnpi 7073 ~Q0 ceq0 7087 |
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 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-sep 4041 ax-pow 4093 ax-pr 4126 ax-un 4350 ax-iinf 4497 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ral 2419 df-rex 2420 df-v 2683 df-dif 3068 df-un 3070 df-in 3072 df-ss 3079 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 df-uni 3732 df-int 3767 df-opab 3985 df-iom 4500 df-xp 4540 df-ni 7105 df-enq0 7225 |
This theorem is referenced by: nqnq0 7242 addnnnq0 7250 mulnnnq0 7251 addclnq0 7252 mulclnq0 7253 prarloclemcalc 7303 |
Copyright terms: Public domain | W3C validator |