Theorem nq0nn 7432

Description: Decomposition of a nonnegative fraction into numerator and denominator. (Contributed by Jim Kingdon, 24-Nov-2019.)

Assertion

Ref	Expression
nq0nn	⊢ (𝐴 ∈ Q0 → ∃𝑤∃𝑣((𝑤 ∈ ω ∧ 𝑣 ∈ N) ∧ 𝐴 = [⟨𝑤, 𝑣⟩] ~Q0 ))

Distinct variable group:   𝑣,𝐴,𝑤

Proof of Theorem nq0nn

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elqsi 6581	. . 3 ⊢ (𝐴 ∈ ((ω × N) / ~Q0 ) → ∃𝑎 ∈ (ω × N)𝐴 = [𝑎] ~Q0 )
2		elxpi 4639	. . . . . . 7 ⊢ (𝑎 ∈ (ω × N) → ∃𝑤∃𝑣(𝑎 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ ω ∧ 𝑣 ∈ N)))
3	2	anim1i 340	. . . . . 6 ⊢ ((𝑎 ∈ (ω × N) ∧ 𝐴 = [𝑎] ~Q0 ) → (∃𝑤∃𝑣(𝑎 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ ω ∧ 𝑣 ∈ N)) ∧ 𝐴 = [𝑎] ~Q0 ))
4		19.41vv 1903	. . . . . 6 ⊢ (∃𝑤∃𝑣((𝑎 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ ω ∧ 𝑣 ∈ N)) ∧ 𝐴 = [𝑎] ~Q0 ) ↔ (∃𝑤∃𝑣(𝑎 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ ω ∧ 𝑣 ∈ N)) ∧ 𝐴 = [𝑎] ~Q0 ))
5	3, 4	sylibr 134	. . . . 5 ⊢ ((𝑎 ∈ (ω × N) ∧ 𝐴 = [𝑎] ~Q0 ) → ∃𝑤∃𝑣((𝑎 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ ω ∧ 𝑣 ∈ N)) ∧ 𝐴 = [𝑎] ~Q0 ))
6		simplr 528	. . . . . . 7 ⊢ (((𝑎 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ ω ∧ 𝑣 ∈ N)) ∧ 𝐴 = [𝑎] ~Q0 ) → (𝑤 ∈ ω ∧ 𝑣 ∈ N))
7		simpr 110	. . . . . . . 8 ⊢ (((𝑎 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ ω ∧ 𝑣 ∈ N)) ∧ 𝐴 = [𝑎] ~Q0 ) → 𝐴 = [𝑎] ~Q0 )
8		eceq1 6564	. . . . . . . . 9 ⊢ (𝑎 = ⟨𝑤, 𝑣⟩ → [𝑎] ~Q0 = [⟨𝑤, 𝑣⟩] ~Q0 )
9	8	ad2antrr 488	. . . . . . . 8 ⊢ (((𝑎 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ ω ∧ 𝑣 ∈ N)) ∧ 𝐴 = [𝑎] ~Q0 ) → [𝑎] ~Q0 = [⟨𝑤, 𝑣⟩] ~Q0 )
10	7, 9	eqtrd 2210	. . . . . . 7 ⊢ (((𝑎 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ ω ∧ 𝑣 ∈ N)) ∧ 𝐴 = [𝑎] ~Q0 ) → 𝐴 = [⟨𝑤, 𝑣⟩] ~Q0 )
11	6, 10	jca 306	. . . . . 6 ⊢ (((𝑎 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ ω ∧ 𝑣 ∈ N)) ∧ 𝐴 = [𝑎] ~Q0 ) → ((𝑤 ∈ ω ∧ 𝑣 ∈ N) ∧ 𝐴 = [⟨𝑤, 𝑣⟩] ~Q0 ))
12	11	2eximi 1601	. . . . 5 ⊢ (∃𝑤∃𝑣((𝑎 = ⟨𝑤, 𝑣⟩ ∧ (𝑤 ∈ ω ∧ 𝑣 ∈ N)) ∧ 𝐴 = [𝑎] ~Q0 ) → ∃𝑤∃𝑣((𝑤 ∈ ω ∧ 𝑣 ∈ N) ∧ 𝐴 = [⟨𝑤, 𝑣⟩] ~Q0 ))
13	5, 12	syl 14	. . . 4 ⊢ ((𝑎 ∈ (ω × N) ∧ 𝐴 = [𝑎] ~Q0 ) → ∃𝑤∃𝑣((𝑤 ∈ ω ∧ 𝑣 ∈ N) ∧ 𝐴 = [⟨𝑤, 𝑣⟩] ~Q0 ))
14	13	rexlimiva 2589	. . 3 ⊢ (∃𝑎 ∈ (ω × N)𝐴 = [𝑎] ~Q0 → ∃𝑤∃𝑣((𝑤 ∈ ω ∧ 𝑣 ∈ N) ∧ 𝐴 = [⟨𝑤, 𝑣⟩] ~Q0 ))
15	1, 14	syl 14	. 2 ⊢ (𝐴 ∈ ((ω × N) / ~Q0 ) → ∃𝑤∃𝑣((𝑤 ∈ ω ∧ 𝑣 ∈ N) ∧ 𝐴 = [⟨𝑤, 𝑣⟩] ~Q0 ))
16		df-nq0 7415	. 2 ⊢ Q0 = ((ω × N) / ~Q0 )
17	15, 16	eleq2s 2272	1 ⊢ (𝐴 ∈ Q0 → ∃𝑤∃𝑣((𝑤 ∈ ω ∧ 𝑣 ∈ N) ∧ 𝐴 = [⟨𝑤, 𝑣⟩] ~Q0 ))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1353  ∃wex 1492   ∈ wcel 2148  ∃wrex 2456  ⟨cop 3594  ωcom 4586   × cxp 4621  [cec 6527   / cqs 6528  Ncnpi 7262   ~_Q0 ceq0 7276  Q₀cnq0 7277

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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-sn 3597  df-pr 3598  df-op 3600  df-br 4001  df-opab 4062  df-xp 4629  df-cnv 4631  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-ec 6531  df-qs 6535  df-nq0 7415

This theorem is referenced by:  nqpnq0nq  7443  nq0m0r  7446  nq0a0  7447  nq02m  7455