Theorem enq0breq 7655

Description: Equivalence relation for nonnegative fractions in terms of natural numbers. (Contributed by NM, 27-Aug-1995.)

Assertion

Ref	Expression
enq0breq	⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ ω ∧ 𝐷 ∈ N)) → (⟨𝐴, 𝐵⟩ ~Q0 ⟨𝐶, 𝐷⟩ ↔ (𝐴 ·o 𝐷) = (𝐵 ·o 𝐶)))

Proof of Theorem enq0breq

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

Step	Hyp	Ref	Expression
1		oveq12 6026	. . . . . 6 ⊢ ((𝑧 = 𝐴 ∧ 𝑢 = 𝐷) → (𝑧 ·o 𝑢) = (𝐴 ·o 𝐷))
2		oveq12 6026	. . . . . 6 ⊢ ((𝑤 = 𝐵 ∧ 𝑣 = 𝐶) → (𝑤 ·o 𝑣) = (𝐵 ·o 𝐶))
3	1, 2	eqeqan12d 2247	. . . . 5 ⊢ (((𝑧 = 𝐴 ∧ 𝑢 = 𝐷) ∧ (𝑤 = 𝐵 ∧ 𝑣 = 𝐶)) → ((𝑧 ·o 𝑢) = (𝑤 ·o 𝑣) ↔ (𝐴 ·o 𝐷) = (𝐵 ·o 𝐶)))
4	3	an42s 593	. . . 4 ⊢ (((𝑧 = 𝐴 ∧ 𝑤 = 𝐵) ∧ (𝑣 = 𝐶 ∧ 𝑢 = 𝐷)) → ((𝑧 ·o 𝑢) = (𝑤 ·o 𝑣) ↔ (𝐴 ·o 𝐷) = (𝐵 ·o 𝐶)))
5	4	copsex4g 4339	. . 3 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ ω ∧ 𝐷 ∈ N)) → (∃𝑧∃𝑤∃𝑣∃𝑢((⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)) ↔ (𝐴 ·o 𝐷) = (𝐵 ·o 𝐶)))
6	5	anbi2d 464	. 2 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ ω ∧ 𝐷 ∈ N)) → (((⟨𝐴, 𝐵⟩ ∈ (ω × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (ω × N)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))) ↔ ((⟨𝐴, 𝐵⟩ ∈ (ω × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (ω × N)) ∧ (𝐴 ·o 𝐷) = (𝐵 ·o 𝐶))))
7		opexg 4320	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ N) → ⟨𝐴, 𝐵⟩ ∈ V)
8		opexg 4320	. . 3 ⊢ ((𝐶 ∈ ω ∧ 𝐷 ∈ N) → ⟨𝐶, 𝐷⟩ ∈ V)
9		eleq1 2294	. . . . . 6 ⊢ (𝑥 = ⟨𝐴, 𝐵⟩ → (𝑥 ∈ (ω × N) ↔ ⟨𝐴, 𝐵⟩ ∈ (ω × N)))
10	9	anbi1d 465	. . . . 5 ⊢ (𝑥 = ⟨𝐴, 𝐵⟩ → ((𝑥 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ↔ (⟨𝐴, 𝐵⟩ ∈ (ω × N) ∧ 𝑦 ∈ (ω × N))))
11		eqeq1 2238	. . . . . . . 8 ⊢ (𝑥 = ⟨𝐴, 𝐵⟩ → (𝑥 = ⟨𝑧, 𝑤⟩ ↔ ⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩))
12	11	anbi1d 465	. . . . . . 7 ⊢ (𝑥 = ⟨𝐴, 𝐵⟩ → ((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩)))
13	12	anbi1d 465	. . . . . 6 ⊢ (𝑥 = ⟨𝐴, 𝐵⟩ → (((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)) ↔ ((⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
14	13	4exbidv 1918	. . . . 5 ⊢ (𝑥 = ⟨𝐴, 𝐵⟩ → (∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)) ↔ ∃𝑧∃𝑤∃𝑣∃𝑢((⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
15	10, 14	anbi12d 473	. . . 4 ⊢ (𝑥 = ⟨𝐴, 𝐵⟩ → (((𝑥 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))) ↔ ((⟨𝐴, 𝐵⟩ ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))))
16		eleq1 2294	. . . . . 6 ⊢ (𝑦 = ⟨𝐶, 𝐷⟩ → (𝑦 ∈ (ω × N) ↔ ⟨𝐶, 𝐷⟩ ∈ (ω × N)))
17	16	anbi2d 464	. . . . 5 ⊢ (𝑦 = ⟨𝐶, 𝐷⟩ → ((⟨𝐴, 𝐵⟩ ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ↔ (⟨𝐴, 𝐵⟩ ∈ (ω × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (ω × N))))
18		eqeq1 2238	. . . . . . . 8 ⊢ (𝑦 = ⟨𝐶, 𝐷⟩ → (𝑦 = ⟨𝑣, 𝑢⟩ ↔ ⟨𝐶, 𝐷⟩ = ⟨𝑣, 𝑢⟩))
19	18	anbi2d 464	. . . . . . 7 ⊢ (𝑦 = ⟨𝐶, 𝐷⟩ → ((⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑣, 𝑢⟩)))
20	19	anbi1d 465	. . . . . 6 ⊢ (𝑦 = ⟨𝐶, 𝐷⟩ → (((⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)) ↔ ((⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
21	20	4exbidv 1918	. . . . 5 ⊢ (𝑦 = ⟨𝐶, 𝐷⟩ → (∃𝑧∃𝑤∃𝑣∃𝑢((⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)) ↔ ∃𝑧∃𝑤∃𝑣∃𝑢((⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
22	17, 21	anbi12d 473	. . . 4 ⊢ (𝑦 = ⟨𝐶, 𝐷⟩ → (((⟨𝐴, 𝐵⟩ ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))) ↔ ((⟨𝐴, 𝐵⟩ ∈ (ω × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (ω × N)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))))
23		df-enq0 7643	. . . 4 ⊢ ~Q0 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))}
24	15, 22, 23	brabg 4363	. . 3 ⊢ ((⟨𝐴, 𝐵⟩ ∈ V ∧ ⟨𝐶, 𝐷⟩ ∈ V) → (⟨𝐴, 𝐵⟩ ~Q0 ⟨𝐶, 𝐷⟩ ↔ ((⟨𝐴, 𝐵⟩ ∈ (ω × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (ω × N)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))))
25	7, 8, 24	syl2an 289	. 2 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ ω ∧ 𝐷 ∈ N)) → (⟨𝐴, 𝐵⟩ ~Q0 ⟨𝐶, 𝐷⟩ ↔ ((⟨𝐴, 𝐵⟩ ∈ (ω × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (ω × N)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((⟨𝐴, 𝐵⟩ = ⟨𝑧, 𝑤⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))))
26		opelxpi 4757	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ N) → ⟨𝐴, 𝐵⟩ ∈ (ω × N))
27		opelxpi 4757	. . . 4 ⊢ ((𝐶 ∈ ω ∧ 𝐷 ∈ N) → ⟨𝐶, 𝐷⟩ ∈ (ω × N))
28	26, 27	anim12i 338	. . 3 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ ω ∧ 𝐷 ∈ N)) → (⟨𝐴, 𝐵⟩ ∈ (ω × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (ω × N)))
29	28	biantrurd 305	. 2 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ ω ∧ 𝐷 ∈ N)) → ((𝐴 ·o 𝐷) = (𝐵 ·o 𝐶) ↔ ((⟨𝐴, 𝐵⟩ ∈ (ω × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (ω × N)) ∧ (𝐴 ·o 𝐷) = (𝐵 ·o 𝐶))))
30	6, 25, 29	3bitr4d 220	1 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ ω ∧ 𝐷 ∈ N)) → (⟨𝐴, 𝐵⟩ ~Q0 ⟨𝐶, 𝐷⟩ ↔ (𝐴 ·o 𝐷) = (𝐵 ·o 𝐶)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1397  ∃wex 1540   ∈ wcel 2202  Vcvv 2802  ⟨cop 3672   class class class wbr 4088  ωcom 4688   × cxp 4723  (class class class)co 6017   ·_o comu 6579  Ncnpi 7491   ~_Q0 ceq0 7505

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-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-xp 4731  df-iota 5286  df-fv 5334  df-ov 6020  df-enq0 7643

This theorem is referenced by:  enq0eceq  7656  nqnq0pi  7657  addcmpblnq0  7662  mulcmpblnq0  7663  mulcanenq0ec  7664  nnnq0lem1  7665