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

Theorem enq0ref 7089
Description: The equivalence relation for nonnegative fractions is reflexive. Lemma for enq0er 7091. (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 4483 . . . . . 6 (𝑓 ∈ (ω × N) → ∃𝑧𝑤(𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)))
2 elxpi 4483 . . . . . 6 (𝑓 ∈ (ω × N) → ∃𝑣𝑢(𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N)))
3 ee4anv 1864 . . . . . 6 (∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))) ↔ (∃𝑧𝑤(𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ ∃𝑣𝑢(𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))))
41, 2, 3sylanbrc 409 . . . . 5 (𝑓 ∈ (ω × N) → ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))))
5 eqtr2 2113 . . . . . . . . . . . 12 ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) → ⟨𝑧, 𝑤⟩ = ⟨𝑣, 𝑢⟩)
6 vex 2636 . . . . . . . . . . . . 13 𝑧 ∈ V
7 vex 2636 . . . . . . . . . . . . 13 𝑤 ∈ V
86, 7opth 4088 . . . . . . . . . . . 12 (⟨𝑧, 𝑤⟩ = ⟨𝑣, 𝑢⟩ ↔ (𝑧 = 𝑣𝑤 = 𝑢))
95, 8sylib 121 . . . . . . . . . . 11 ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) → (𝑧 = 𝑣𝑤 = 𝑢))
10 oveq1 5697 . . . . . . . . . . . 12 (𝑧 = 𝑣 → (𝑧 ·o 𝑢) = (𝑣 ·o 𝑢))
11 oveq2 5698 . . . . . . . . . . . . 13 (𝑢 = 𝑤 → (𝑣 ·o 𝑢) = (𝑣 ·o 𝑤))
1211equcoms 1648 . . . . . . . . . . . 12 (𝑤 = 𝑢 → (𝑣 ·o 𝑢) = (𝑣 ·o 𝑤))
1310, 12sylan9eq 2147 . . . . . . . . . . 11 ((𝑧 = 𝑣𝑤 = 𝑢) → (𝑧 ·o 𝑢) = (𝑣 ·o 𝑤))
149, 13syl 14 . . . . . . . . . 10 ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) → (𝑧 ·o 𝑢) = (𝑣 ·o 𝑤))
1514ancli 317 . . . . . . . . 9 ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) → ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑣 ·o 𝑤)))
1615ad2ant2r 494 . . . . . . . 8 (((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))) → ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑣 ·o 𝑤)))
17 pinn 6965 . . . . . . . . . . . . . 14 (𝑤N𝑤 ∈ ω)
18 nnmcom 6290 . . . . . . . . . . . . . 14 ((𝑣 ∈ ω ∧ 𝑤 ∈ ω) → (𝑣 ·o 𝑤) = (𝑤 ·o 𝑣))
1917, 18sylan2 281 . . . . . . . . . . . . 13 ((𝑣 ∈ ω ∧ 𝑤N) → (𝑣 ·o 𝑤) = (𝑤 ·o 𝑣))
2019eqeq2d 2106 . . . . . . . . . . . 12 ((𝑣 ∈ ω ∧ 𝑤N) → ((𝑧 ·o 𝑢) = (𝑣 ·o 𝑤) ↔ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
2120ancoms 265 . . . . . . . . . . 11 ((𝑤N𝑣 ∈ ω) → ((𝑧 ·o 𝑢) = (𝑣 ·o 𝑤) ↔ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
2221ad2ant2lr 495 . . . . . . . . . 10 (((𝑧 ∈ ω ∧ 𝑤N) ∧ (𝑣 ∈ ω ∧ 𝑢N)) → ((𝑧 ·o 𝑢) = (𝑣 ·o 𝑤) ↔ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
2322ad2ant2l 493 . . . . . . . . 9 (((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))) → ((𝑧 ·o 𝑢) = (𝑣 ·o 𝑤) ↔ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
2423anbi2d 453 . . . . . . . 8 (((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))) → (((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑣 ·o 𝑤)) ↔ ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
2516, 24mpbid 146 . . . . . . 7 (((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))) → ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
26252eximi 1544 . . . . . 6 (∃𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))) → ∃𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
27262eximi 1544 . . . . 5 (∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ ω ∧ 𝑤N)) ∧ (𝑓 = ⟨𝑣, 𝑢⟩ ∧ (𝑣 ∈ ω ∧ 𝑢N))) → ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
284, 27syl 14 . . . 4 (𝑓 ∈ (ω × N) → ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))
2928ancli 317 . . 3 (𝑓 ∈ (ω × N) → (𝑓 ∈ (ω × N) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
30 vex 2636 . . . . 5 𝑓 ∈ V
31 eleq1 2157 . . . . . . 7 (𝑥 = 𝑓 → (𝑥 ∈ (ω × N) ↔ 𝑓 ∈ (ω × N)))
3231anbi1d 454 . . . . . 6 (𝑥 = 𝑓 → ((𝑥 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ↔ (𝑓 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N))))
33 eqeq1 2101 . . . . . . . . 9 (𝑥 = 𝑓 → (𝑥 = ⟨𝑧, 𝑤⟩ ↔ 𝑓 = ⟨𝑧, 𝑤⟩))
3433anbi1d 454 . . . . . . . 8 (𝑥 = 𝑓 → ((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ↔ (𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩)))
3534anbi1d 454 . . . . . . 7 (𝑥 = 𝑓 → (((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)) ↔ ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
36354exbidv 1805 . . . . . 6 (𝑥 = 𝑓 → (∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)) ↔ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
3732, 36anbi12d 458 . . . . 5 (𝑥 = 𝑓 → (((𝑥 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))) ↔ ((𝑓 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))))
38 eleq1 2157 . . . . . . 7 (𝑦 = 𝑓 → (𝑦 ∈ (ω × N) ↔ 𝑓 ∈ (ω × N)))
3938anbi2d 453 . . . . . 6 (𝑦 = 𝑓 → ((𝑓 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ↔ (𝑓 ∈ (ω × N) ∧ 𝑓 ∈ (ω × N))))
40 eqeq1 2101 . . . . . . . . 9 (𝑦 = 𝑓 → (𝑦 = ⟨𝑣, 𝑢⟩ ↔ 𝑓 = ⟨𝑣, 𝑢⟩))
4140anbi2d 453 . . . . . . . 8 (𝑦 = 𝑓 → ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ↔ (𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩)))
4241anbi1d 454 . . . . . . 7 (𝑦 = 𝑓 → (((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)) ↔ ((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
43424exbidv 1805 . . . . . 6 (𝑦 = 𝑓 → (∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)) ↔ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
4439, 43anbi12d 458 . . . . 5 (𝑦 = 𝑓 → (((𝑓 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))) ↔ ((𝑓 ∈ (ω × N) ∧ 𝑓 ∈ (ω × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))))
45 df-enq0 7080 . . . . 5 ~Q0 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))}
4630, 30, 37, 44, 45brab 4123 . . . 4 (𝑓 ~Q0 𝑓 ↔ ((𝑓 ∈ (ω × N) ∧ 𝑓 ∈ (ω × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
47 anidm 389 . . . . 5 ((𝑓 ∈ (ω × N) ∧ 𝑓 ∈ (ω × N)) ↔ 𝑓 ∈ (ω × N))
4847anbi1i 447 . . . 4 (((𝑓 ∈ (ω × N) ∧ 𝑓 ∈ (ω × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))) ↔ (𝑓 ∈ (ω × N) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
4946, 48bitri 183 . . 3 (𝑓 ~Q0 𝑓 ↔ (𝑓 ∈ (ω × N) ∧ ∃𝑧𝑤𝑣𝑢((𝑓 = ⟨𝑧, 𝑤⟩ ∧ 𝑓 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣))))
5029, 49sylibr 133 . 2 (𝑓 ∈ (ω × N) → 𝑓 ~Q0 𝑓)
5149simplbi 269 . 2 (𝑓 ~Q0 𝑓𝑓 ∈ (ω × N))
5250, 51impbii 125 1 (𝑓 ∈ (ω × N) ↔ 𝑓 ~Q0 𝑓)
Colors of variables: wff set class
Syntax hints:  wa 103  wb 104   = wceq 1296  wex 1433  wcel 1445  cop 3469   class class class wbr 3867  ωcom 4433   × cxp 4465  (class class class)co 5690   ·o comu 6217  Ncnpi 6928   ~Q0 ceq0 6942
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 582  ax-in2 583  ax-io 668  ax-5 1388  ax-7 1389  ax-gen 1390  ax-ie1 1434  ax-ie2 1435  ax-8 1447  ax-10 1448  ax-11 1449  ax-i12 1450  ax-bndl 1451  ax-4 1452  ax-13 1456  ax-14 1457  ax-17 1471  ax-i9 1475  ax-ial 1479  ax-i5r 1480  ax-ext 2077  ax-coll 3975  ax-sep 3978  ax-nul 3986  ax-pow 4030  ax-pr 4060  ax-un 4284  ax-setind 4381  ax-iinf 4431
This theorem depends on definitions:  df-bi 116  df-3an 929  df-tru 1299  df-fal 1302  df-nf 1402  df-sb 1700  df-eu 1958  df-mo 1959  df-clab 2082  df-cleq 2088  df-clel 2091  df-nfc 2224  df-ne 2263  df-ral 2375  df-rex 2376  df-reu 2377  df-rab 2379  df-v 2635  df-sbc 2855  df-csb 2948  df-dif 3015  df-un 3017  df-in 3019  df-ss 3026  df-nul 3303  df-pw 3451  df-sn 3472  df-pr 3473  df-op 3475  df-uni 3676  df-int 3711  df-iun 3754  df-br 3868  df-opab 3922  df-mpt 3923  df-tr 3959  df-id 4144  df-iord 4217  df-on 4219  df-suc 4222  df-iom 4434  df-xp 4473  df-rel 4474  df-cnv 4475  df-co 4476  df-dm 4477  df-rn 4478  df-res 4479  df-ima 4480  df-iota 5014  df-fun 5051  df-fn 5052  df-f 5053  df-f1 5054  df-fo 5055  df-f1o 5056  df-fv 5057  df-ov 5693  df-oprab 5694  df-mpt2 5695  df-1st 5949  df-2nd 5950  df-recs 6108  df-irdg 6173  df-oadd 6223  df-omul 6224  df-ni 6960  df-enq0 7080
This theorem is referenced by:  enq0er  7091
  Copyright terms: Public domain W3C validator