Theorem enq0ex 7806

Description: The equivalence relation for positive fractions exists. (Contributed by Jim Kingdon, 18-Nov-2019.)

Assertion

Ref	Expression
enq0ex	⊢ ~Q0 ∈ V

Proof of Theorem enq0ex

Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		omex 4740	. . . 4 ⊢ ω ∈ V
2		niex 7679	. . . 4 ⊢ N ∈ V
3	1, 2	xpex 4891	. . 3 ⊢ (ω × N) ∈ V
4	3, 3	xpex 4891	. 2 ⊢ ((ω × N) × (ω × N)) ∈ V
5		df-enq0 7791	. . 3 ⊢ ~Q0 = {⟨𝑣, 𝑢⟩ ∣ ((𝑣 ∈ (ω × N) ∧ 𝑢 ∈ (ω × N)) ∧ ∃𝑥∃𝑦∃𝑧∃𝑤((𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝑢 = ⟨𝑧, 𝑤⟩) ∧ (𝑥 ·o 𝑤) = (𝑦 ·o 𝑧)))}
6		opabssxp 4849	. . 3 ⊢ {⟨𝑣, 𝑢⟩ ∣ ((𝑣 ∈ (ω × N) ∧ 𝑢 ∈ (ω × N)) ∧ ∃𝑥∃𝑦∃𝑧∃𝑤((𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝑢 = ⟨𝑧, 𝑤⟩) ∧ (𝑥 ·o 𝑤) = (𝑦 ·o 𝑧)))} ⊆ ((ω × N) × (ω × N))
7	5, 6	eqsstri 3280	. 2 ⊢ ~Q0 ⊆ ((ω × N) × (ω × N))
8	4, 7	ssexi 4271	1 ⊢ ~Q0 ∈ V

This proof depends on syntax axioms:   ∧ wa 104   = wceq 1402  ∃wex 1545   ∈ wcel 2209  Vcvv 2821  ⟨cop 3712  {copab 4191  ωcom 4737   × cxp 4772  (class class class)co 6085   ·_o comu 6685  Ncnpi 7639   ~_Q0 ceq0 7653

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-opab 4193  df-iom 4738  df-xp 4780  df-ni 7671  df-enq0 7791

This theorem is used by:  nqnq0  7808  addnnnq0  7816  mulnnnq0  7817  addclnq0  7818  mulclnq0  7819  prarloclemcalc  7869