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

Theorem nqnq0 7808
Description: A positive fraction is a nonnegative fraction. (Contributed by Jim Kingdon, 18-Nov-2019.)
Assertion
Ref Expression
nqnq0 QQ0

Proof of Theorem nqnq0
Dummy variables 𝑣 𝑢 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-nqqs 7715 . . . . 5 Q = ((N × N) / ~Q )
21eleq2i 2305 . . . 4 (𝑦Q𝑦 ∈ ((N × N) / ~Q ))
3 vex 2824 . . . . 5 𝑦 ∈ V
43elqs 6860 . . . 4 (𝑦 ∈ ((N × N) / ~Q ) ↔ ∃𝑥 ∈ (N × N)𝑦 = [𝑥] ~Q )
5 df-rex 2534 . . . 4 (∃𝑥 ∈ (N × N)𝑦 = [𝑥] ~Q ↔ ∃𝑥(𝑥 ∈ (N × N) ∧ 𝑦 = [𝑥] ~Q ))
62, 4, 53bitri 206 . . 3 (𝑦Q ↔ ∃𝑥(𝑥 ∈ (N × N) ∧ 𝑦 = [𝑥] ~Q ))
7 elxpi 4790 . . . . . . 7 (𝑥 ∈ (N × N) → ∃𝑢𝑣(𝑥 = ⟨𝑢, 𝑣⟩ ∧ (𝑢N𝑣N)))
8 nqnq0pi 7805 . . . . . . . . . . 11 ((𝑢N𝑣N) → [⟨𝑢, 𝑣⟩] ~Q0 = [⟨𝑢, 𝑣⟩] ~Q )
98adantl 277 . . . . . . . . . 10 ((𝑥 = ⟨𝑢, 𝑣⟩ ∧ (𝑢N𝑣N)) → [⟨𝑢, 𝑣⟩] ~Q0 = [⟨𝑢, 𝑣⟩] ~Q )
10 eceq1 6842 . . . . . . . . . . . 12 (𝑥 = ⟨𝑢, 𝑣⟩ → [𝑥] ~Q0 = [⟨𝑢, 𝑣⟩] ~Q0 )
11 eceq1 6842 . . . . . . . . . . . 12 (𝑥 = ⟨𝑢, 𝑣⟩ → [𝑥] ~Q = [⟨𝑢, 𝑣⟩] ~Q )
1210, 11eqeq12d 2253 . . . . . . . . . . 11 (𝑥 = ⟨𝑢, 𝑣⟩ → ([𝑥] ~Q0 = [𝑥] ~Q ↔ [⟨𝑢, 𝑣⟩] ~Q0 = [⟨𝑢, 𝑣⟩] ~Q ))
1312adantr 276 . . . . . . . . . 10 ((𝑥 = ⟨𝑢, 𝑣⟩ ∧ (𝑢N𝑣N)) → ([𝑥] ~Q0 = [𝑥] ~Q ↔ [⟨𝑢, 𝑣⟩] ~Q0 = [⟨𝑢, 𝑣⟩] ~Q ))
149, 13mpbird 167 . . . . . . . . 9 ((𝑥 = ⟨𝑢, 𝑣⟩ ∧ (𝑢N𝑣N)) → [𝑥] ~Q0 = [𝑥] ~Q )
15 pinn 7676 . . . . . . . . . . . . 13 (𝑢N𝑢 ∈ ω)
16 opelxpi 4806 . . . . . . . . . . . . 13 ((𝑢 ∈ ω ∧ 𝑣N) → ⟨𝑢, 𝑣⟩ ∈ (ω × N))
1715, 16sylan 283 . . . . . . . . . . . 12 ((𝑢N𝑣N) → ⟨𝑢, 𝑣⟩ ∈ (ω × N))
1817adantl 277 . . . . . . . . . . 11 ((𝑥 = ⟨𝑢, 𝑣⟩ ∧ (𝑢N𝑣N)) → ⟨𝑢, 𝑣⟩ ∈ (ω × N))
19 eleq1 2301 . . . . . . . . . . . 12 (𝑥 = ⟨𝑢, 𝑣⟩ → (𝑥 ∈ (ω × N) ↔ ⟨𝑢, 𝑣⟩ ∈ (ω × N)))
2019adantr 276 . . . . . . . . . . 11 ((𝑥 = ⟨𝑢, 𝑣⟩ ∧ (𝑢N𝑣N)) → (𝑥 ∈ (ω × N) ↔ ⟨𝑢, 𝑣⟩ ∈ (ω × N)))
2118, 20mpbird 167 . . . . . . . . . 10 ((𝑥 = ⟨𝑢, 𝑣⟩ ∧ (𝑢N𝑣N)) → 𝑥 ∈ (ω × N))
22 enq0ex 7806 . . . . . . . . . . . 12 ~Q0 ∈ V
2322ecelqsi 6863 . . . . . . . . . . 11 (𝑥 ∈ (ω × N) → [𝑥] ~Q0 ∈ ((ω × N) / ~Q0 ))
24 df-nq0 7792 . . . . . . . . . . 11 Q0 = ((ω × N) / ~Q0 )
2523, 24eleqtrrdi 2332 . . . . . . . . . 10 (𝑥 ∈ (ω × N) → [𝑥] ~Q0Q0)
2621, 25syl 14 . . . . . . . . 9 ((𝑥 = ⟨𝑢, 𝑣⟩ ∧ (𝑢N𝑣N)) → [𝑥] ~Q0Q0)
2714, 26eqeltrrd 2316 . . . . . . . 8 ((𝑥 = ⟨𝑢, 𝑣⟩ ∧ (𝑢N𝑣N)) → [𝑥] ~QQ0)
2827exlimivv 1952 . . . . . . 7 (∃𝑢𝑣(𝑥 = ⟨𝑢, 𝑣⟩ ∧ (𝑢N𝑣N)) → [𝑥] ~QQ0)
297, 28syl 14 . . . . . 6 (𝑥 ∈ (N × N) → [𝑥] ~QQ0)
3029adantr 276 . . . . 5 ((𝑥 ∈ (N × N) ∧ 𝑦 = [𝑥] ~Q ) → [𝑥] ~QQ0)
31 eleq1 2301 . . . . . 6 (𝑦 = [𝑥] ~Q → (𝑦Q0 ↔ [𝑥] ~QQ0))
3231adantl 277 . . . . 5 ((𝑥 ∈ (N × N) ∧ 𝑦 = [𝑥] ~Q ) → (𝑦Q0 ↔ [𝑥] ~QQ0))
3330, 32mpbird 167 . . . 4 ((𝑥 ∈ (N × N) ∧ 𝑦 = [𝑥] ~Q ) → 𝑦Q0)
3433exlimiv 1651 . . 3 (∃𝑥(𝑥 ∈ (N × N) ∧ 𝑦 = [𝑥] ~Q ) → 𝑦Q0)
356, 34sylbi 121 . 2 (𝑦Q𝑦Q0)
3635ssriv 3252 1 QQ0
Colors of variables:    wff set class
This proof depends on syntax axioms:  wa 104  wb 105   = wceq 1402  wex 1545  wcel 2209  wrex 2529  wss 3220  cop 3712  ωcom 4737   × cxp 4772  [cec 6805   / cqs 6806  Ncnpi 7639   ~Q ceq 7646  Qcnq 7647   ~Q0 ceq0 7653  Q0cnq0 7654
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-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7671  df-mi 7673  df-enq 7714  df-nqqs 7715  df-enq0 7791  df-nq0 7792
This theorem is used by:  prarloclem5  7867  prarloclemcalc  7869
  Copyright terms: Public domain W3C validator