Theorem enqer 10834

Description: The equivalence relation for positive fractions is an equivalence relation. Proposition 9-2.1 of [Gleason] p. 117. (Contributed by NM, 27-Aug-1995.) (Revised by Mario Carneiro, 6-Jul-2015.) (New usage is discouraged.)

Assertion

Ref	Expression
enqer	⊢ ~Q Er (N × N)

Proof of Theorem enqer

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

Step	Hyp	Ref	Expression
1		df-enq 10824	. 2 ⊢ ~Q = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·N 𝑢) = (𝑤 ·N 𝑣)))}
2		mulcompi 10809	. 2 ⊢ (𝑥 ·N 𝑦) = (𝑦 ·N 𝑥)
3		mulclpi 10806	. 2 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → (𝑥 ·N 𝑦) ∈ N)
4		mulasspi 10810	. 2 ⊢ ((𝑥 ·N 𝑦) ·N 𝑧) = (𝑥 ·N (𝑦 ·N 𝑧))
5		mulcanpi 10813	. . 3 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → ((𝑥 ·N 𝑦) = (𝑥 ·N 𝑧) ↔ 𝑦 = 𝑧))
6	5	biimpd 229	. 2 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → ((𝑥 ·N 𝑦) = (𝑥 ·N 𝑧) → 𝑦 = 𝑧))
7	1, 2, 3, 4, 6	ecopover 8755	1 ⊢ ~Q Er (N × N)

Syntax hints:   ∧ wa 395   = wceq 1540   ∈ wcel 2109   × cxp 5621  (class class class)co 7353   Er wer 8629  Ncnpi 10757   ·_N cmi 10759   ~_Q ceq 10764

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5238  ax-nul 5248  ax-pr 5374  ax-un 7675

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7356  df-oprab 7357  df-mpo 7358  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-oadd 8399  df-omul 8400  df-er 8632  df-ni 10785  df-mi 10787  df-enq 10824

This theorem is referenced by:  nqereu  10842  nqerf  10843  nqerid  10846  enqeq  10847  nqereq  10848  adderpq  10869  mulerpq  10870  1nqenq  10875