ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  enq0ref GIF version

Theorem enq0ref 7753
Description: The equivalence relation for nonnegative fractions is reflexive. Lemma for enq0er 7755. (Contributed by Jim Kingdon, 14-Nov-2019.)
Assertion
Ref Expression
enq0ref (𝑓 ∈ (ω × N) ↔ 𝑓 ~Q0 𝑓)

Proof of Theorem enq0ref
Dummy variables 𝑢 𝑣 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elxpi 4767 . . . . . 6 (𝑓 ∈ (ω × N) → ∃𝑧𝑤(𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)))
2 elxpi 4767 . . . . . 6 (𝑓 ∈ (ω × N) → ∃𝑣𝑢(𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N)))
3 ee4anv 1990 . . . . . 6 (∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))) ↔ (∃𝑧𝑤(𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ ∃𝑣𝑢(𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))))
41, 2, 3sylanbrc 417 . . . . 5 (𝑓 ∈ (ω × N) → ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))))
5 eqtr2 2253 . . . . . . . . . . . 12 ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) → ⟨𝑧, 𝑤⟩ = ⟨𝑣, 𝑢⟩)
6 vex 2818 . . . . . . . . . . . . 13 𝑧 ∈ V
7 vex 2818 . . . . . . . . . . . . 13 𝑤 ∈ V
86, 7opth 4355 . . . . . . . . . . . 12 (⟨𝑧, 𝑤⟩ = ⟨𝑣, 𝑢⟩ ↔ (𝑧 = 𝑣𝑤 = 𝑢))
95, 8sylib 122 . . . . . . . . . . 11 ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) → (𝑧 = 𝑣𝑤 = 𝑢))
10 oveq1 6059 . . . . . . . . . . . 12 (𝑧 = 𝑣 → (𝑧 ·o 𝑢) = (𝑣 ·o 𝑢))
11 oveq2 6060 . . . . . . . . . . . . 13 (𝑢 = 𝑤 → (𝑣 ·o 𝑢) = (𝑣 ·o 𝑤))
1211equcoms 1756 . . . . . . . . . . . 12 (𝑤 = 𝑢 → (𝑣 ·o 𝑢) = (𝑣 ·o 𝑤))
1310, 12sylan9eq 2287 . . . . . . . . . . 11 ((𝑧 = 𝑣𝑤 = 𝑢) → (𝑧 ·o 𝑢) = (𝑣 ·o 𝑤))
149, 13syl 14 . . . . . . . . . 10 ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) → (𝑧 ·o 𝑢) = (𝑣 ·o 𝑤))
1514ancli 323 . . . . . . . . 9 ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) → ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑣 ·o 𝑤)))
1615ad2ant2r 509 . . . . . . . 8 (((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))) → ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑣 ·o 𝑤)))
17 pinn 7629 . . . . . . . . . . . . . 14 (𝑤N𝑤 ∈ ω)
18 nnmcom 6724 . . . . . . . . . . . . . 14 ((𝑣 ∈ ω ∧ 𝑤 ∈ ω) → (𝑣 ·o 𝑤) = (𝑤 ·o 𝑣))
1917, 18sylan2 286 . . . . . . . . . . . . 13 ((𝑣 ∈ ω ∧ 𝑤N) → (𝑣 ·o 𝑤) = (𝑤 ·o 𝑣))
2019eqeq2d 2246 . . . . . . . . . . . 12 ((𝑣 ∈ ω ∧ 𝑤N) → ((𝑧 ·o 𝑢) = (𝑣 ·o 𝑤) ↔ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
2120ancoms 268 . . . . . . . . . . 11 ((𝑤N𝑣 ∈ ω) → ((𝑧 ·o 𝑢) = (𝑣 ·o 𝑤) ↔ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
2221ad2ant2lr 510 . . . . . . . . . 10 (((𝑧 ∈ ω ∧ 𝑤N) ∧ (𝑣 ∈ ω ∧ 𝑢N)) → ((𝑧 ·o 𝑢) = (𝑣 ·o 𝑤) ↔ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
2322ad2ant2l 508 . . . . . . . . 9 (((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))) → ((𝑧 ·o 𝑢) = (𝑣 ·o 𝑤) ↔ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
2423anbi2d 464 . . . . . . . 8 (((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))) → (((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑣 ·o 𝑤)) ↔ ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
2516, 24mpbid 147 . . . . . . 7 (((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))) → ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
26252eximi 1650 . . . . . 6 (∃𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))) → ∃𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
27262eximi 1650 . . . . 5 (∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))) → ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
284, 27syl 14 . . . 4 (𝑓 ∈ (ω × N) → ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
2928ancli 323 . . 3 (𝑓 ∈ (ω × N) → (𝑓 ∈ (ω × N) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
30 vex 2818 . . . . 5 𝑓 ∈ V
31 eleq1 2297 . . . . . . 7 (𝑥 = 𝑓 → (𝑥 ∈ (ω × N) ↔ 𝑓 ∈ (ω × N)))
3231anbi1d 465 . . . . . 6 (𝑥 = 𝑓 → ((𝑥 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ↔ (𝑓 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N))))
33 eqeq1 2241 . . . . . . . . 9 (𝑥 = 𝑓 → (𝑥 = ⟨𝑧, 𝑤⟩ ↔ 𝑓 = ⟨𝑧, 𝑤⟩))
3433anbi1d 465 . . . . . . . 8 (𝑥 = 𝑓 → ((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ↔ (𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩)))
3534anbi1d 465 . . . . . . 7 (𝑥 = 𝑓 → (((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)) ↔ ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
36354exbidv 1919 . . . . . 6 (𝑥 = 𝑓 → (∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)) ↔ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
3732, 36anbi12d 473 . . . . 5 (𝑥 = 𝑓 → (((𝑥 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))) ↔ ((𝑓 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))))
38 eleq1 2297 . . . . . . 7 (𝑦 = 𝑓 → (𝑦 ∈ (ω × N) ↔ 𝑓 ∈ (ω × N)))
3938anbi2d 464 . . . . . 6 (𝑦 = 𝑓 → ((𝑓 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ↔ (𝑓 ∈ (ω × N) ∧ 𝑓 ∈ (ω × N))))
40 eqeq1 2241 . . . . . . . . 9 (𝑦 = 𝑓 → (𝑦 = ⟨𝑣, 𝑢⟩ ↔ 𝑓 = ⟨𝑣, 𝑢⟩))
4140anbi2d 464 . . . . . . . 8 (𝑦 = 𝑓 → ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ↔ (𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩)))
4241anbi1d 465 . . . . . . 7 (𝑦 = 𝑓 → (((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)) ↔ ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
43424exbidv 1919 . . . . . 6 (𝑦 = 𝑓 → (∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)) ↔ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
4439, 43anbi12d 473 . . . . 5 (𝑦 = 𝑓 → (((𝑓 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))) ↔ ((𝑓 ∈ (ω × N) ∧ 𝑓 ∈ (ω × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))))
45 df-enq0 7744 . . . . 5 ~Q0 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))}
4630, 30, 37, 44, 45brab 4393 . . . 4 (𝑓 ~Q0 𝑓 ↔ ((𝑓 ∈ (ω × N) ∧ 𝑓 ∈ (ω × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
47 anidm 396 . . . . 5 ((𝑓 ∈ (ω × N) ∧ 𝑓 ∈ (ω × N)) ↔ 𝑓 ∈ (ω × N))
4847anbi1i 458 . . . 4 (((𝑓 ∈ (ω × N) ∧ 𝑓 ∈ (ω × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))) ↔ (𝑓 ∈ (ω × N) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
4946, 48bitri 184 . . 3 (𝑓 ~Q0 𝑓 ↔ (𝑓 ∈ (ω × N) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
5029, 49sylibr 134 . 2 (𝑓 ∈ (ω × N) → 𝑓 ~Q0 𝑓)
5149simplbi 274 . 2 (𝑓 ~Q0 𝑓𝑓 ∈ (ω × N))
5250, 51impbii 126 1 (𝑓 ∈ (ω × N) ↔ 𝑓 ~Q0 𝑓)
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1398  wex 1541  wcel 2205  cop 3694   class class class wbr 4111  ωcom 4714   × cxp 4749  (class class class)co 6052   ·o comu 6647  Ncnpi 7592   ~Q0 ceq0 7606
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-id 4416  df-iord 4489  df-on 4491  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-irdg 6603  df-oadd 6653  df-omul 6654  df-ni 7624  df-enq0 7744
This theorem is referenced by:  enq0er  7755
  Copyright terms: Public domain W3C validator