Theorem nqerf 10916

Description: Corollary of nqereu 10915: the function [Q] is actually a function. (Contributed by Mario Carneiro, 6-May-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
nqerf	⊢ [Q]:(N × N)⟶Q

Proof of Theorem nqerf

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-erq 10899	. . . . . . 7 ⊢ [Q] = ( ~Q ∩ ((N × N) × Q))
2		inss2 4191	. . . . . . 7 ⊢ ( ~Q ∩ ((N × N) × Q)) ⊆ ((N × N) × Q)
3	1, 2	eqsstri 3984	. . . . . 6 ⊢ [Q] ⊆ ((N × N) × Q)
4		xpss 5679	. . . . . 6 ⊢ ((N × N) × Q) ⊆ (V × V)
5	3, 4	sstri 3947	. . . . 5 ⊢ [Q] ⊆ (V × V)
6		df-rel 5670	. . . . 5 ⊢ (Rel [Q] ↔ [Q] ⊆ (V × V))
7	5, 6	mpbir 234	. . . 4 ⊢ Rel [Q]
8		nqereu 10915	. . . . . . . 8 ⊢ (𝑥 ∈ (N × N) → ∃!𝑦 ∈ Q 𝑦 ~Q 𝑥)
9		df-reu 3370	. . . . . . . . 9 ⊢ (∃!𝑦 ∈ Q 𝑦 ~Q 𝑥 ↔ ∃!𝑦(𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥))
10		eumo 2606	. . . . . . . . 9 ⊢ (∃!𝑦(𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥) → ∃*𝑦(𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥))
11	9, 10	sylbi 220	. . . . . . . 8 ⊢ (∃!𝑦 ∈ Q 𝑦 ~Q 𝑥 → ∃*𝑦(𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥))
12	8, 11	syl 18	. . . . . . 7 ⊢ (𝑥 ∈ (N × N) → ∃*𝑦(𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥))
13		moanimv 2647	. . . . . . 7 ⊢ (∃*𝑦(𝑥 ∈ (N × N) ∧ (𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥)) ↔ (𝑥 ∈ (N × N) → ∃*𝑦(𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥)))
14	12, 13	mpbir 234	. . . . . 6 ⊢ ∃*𝑦(𝑥 ∈ (N × N) ∧ (𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥))
15	3	brel 5728	. . . . . . . . 9 ⊢ (𝑥[Q]𝑦 → (𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q))
16	15	simpld 499	. . . . . . . 8 ⊢ (𝑥[Q]𝑦 → 𝑥 ∈ (N × N))
17	15	simprd 500	. . . . . . . 8 ⊢ (𝑥[Q]𝑦 → 𝑦 ∈ Q)
18		enqer 10907	. . . . . . . . . 10 ⊢ ~Q Er (N × N)
19	18	a1i 11	. . . . . . . . 9 ⊢ (𝑥[Q]𝑦 → ~Q Er (N × N))
20		inss1 4190	. . . . . . . . . . 11 ⊢ ( ~Q ∩ ((N × N) × Q)) ⊆ ~Q
21	1, 20	eqsstri 3984	. . . . . . . . . 10 ⊢ [Q] ⊆ ~Q
22	21	ssbri 5157	. . . . . . . . 9 ⊢ (𝑥[Q]𝑦 → 𝑥 ~Q 𝑦)
23	19, 22	ersym 8708	. . . . . . . 8 ⊢ (𝑥[Q]𝑦 → 𝑦 ~Q 𝑥)
24	16, 17, 23	jca32 524	. . . . . . 7 ⊢ (𝑥[Q]𝑦 → (𝑥 ∈ (N × N) ∧ (𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥)))
25	24	moimi 2573	. . . . . 6 ⊢ (∃*𝑦(𝑥 ∈ (N × N) ∧ (𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥)) → ∃*𝑦 𝑥[Q]𝑦)
26	14, 25	ax-mp 5	. . . . 5 ⊢ ∃*𝑦 𝑥[Q]𝑦
27	26	ax-gen 1825	. . . 4 ⊢ ∀𝑥∃*𝑦 𝑥[Q]𝑦
28		dffun6 6549	. . . 4 ⊢ (Fun [Q] ↔ (Rel [Q] ∧ ∀𝑥∃*𝑦 𝑥[Q]𝑦))
29	7, 27, 28	mpbir2an 723	. . 3 ⊢ Fun [Q]
30		dmss 5894	. . . . . 6 ⊢ ([Q] ⊆ ((N × N) × Q) → dom [Q] ⊆ dom ((N × N) × Q))
31	3, 30	ax-mp 5	. . . . 5 ⊢ dom [Q] ⊆ dom ((N × N) × Q)
32		1nq 10914	. . . . . 6 ⊢ 1Q ∈ Q
33		ne0i 4295	. . . . . 6 ⊢ (1Q ∈ Q → Q ≠ ∅)
34		dmxp 5921	. . . . . 6 ⊢ (Q ≠ ∅ → dom ((N × N) × Q) = (N × N))
35	32, 33, 34	mp2b 10	. . . . 5 ⊢ dom ((N × N) × Q) = (N × N)
36	31, 35	sseqtri 3986	. . . 4 ⊢ dom [Q] ⊆ (N × N)
37		reurex 3373	. . . . . . . 8 ⊢ (∃!𝑦 ∈ Q 𝑦 ~Q 𝑥 → ∃𝑦 ∈ Q 𝑦 ~Q 𝑥)
38		simpll 778	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → 𝑥 ∈ (N × N))
39		simplr 780	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → 𝑦 ∈ Q)
40	18	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → ~Q Er (N × N))
41		simpr 489	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → 𝑦 ~Q 𝑥)
42	40, 41	ersym 8708	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → 𝑥 ~Q 𝑦)
43	1	breqi 5116	. . . . . . . . . . . 12 ⊢ (𝑥[Q]𝑦 ↔ 𝑥( ~Q ∩ ((N × N) × Q))𝑦)
44		brinxp2 5741	. . . . . . . . . . . 12 ⊢ (𝑥( ~Q ∩ ((N × N) × Q))𝑦 ↔ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑥 ~Q 𝑦))
45	43, 44	bitri 278	. . . . . . . . . . 11 ⊢ (𝑥[Q]𝑦 ↔ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑥 ~Q 𝑦))
46	38, 39, 42, 45	syl21anbrc 1363	. . . . . . . . . 10 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → 𝑥[Q]𝑦)
47	46	ex 417	. . . . . . . . 9 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) → (𝑦 ~Q 𝑥 → 𝑥[Q]𝑦))
48	47	reximdva 3178	. . . . . . . 8 ⊢ (𝑥 ∈ (N × N) → (∃𝑦 ∈ Q 𝑦 ~Q 𝑥 → ∃𝑦 ∈ Q 𝑥[Q]𝑦))
49		rexex 3095	. . . . . . . 8 ⊢ (∃𝑦 ∈ Q 𝑥[Q]𝑦 → ∃𝑦 𝑥[Q]𝑦)
50	37, 48, 49	syl56 37	. . . . . . 7 ⊢ (𝑥 ∈ (N × N) → (∃!𝑦 ∈ Q 𝑦 ~Q 𝑥 → ∃𝑦 𝑥[Q]𝑦))
51	8, 50	mpd 16	. . . . . 6 ⊢ (𝑥 ∈ (N × N) → ∃𝑦 𝑥[Q]𝑦)
52		vex 3459	. . . . . . 7 ⊢ 𝑥 ∈ V
53	52	eldm 5892	. . . . . 6 ⊢ (𝑥 ∈ dom [Q] ↔ ∃𝑦 𝑥[Q]𝑦)
54	51, 53	sylibr 237	. . . . 5 ⊢ (𝑥 ∈ (N × N) → 𝑥 ∈ dom [Q])
55	54	ssriv 3942	. . . 4 ⊢ (N × N) ⊆ dom [Q]
56	36, 55	eqssi 3954	. . 3 ⊢ dom [Q] = (N × N)
57		df-fn 6541	. . 3 ⊢ ([Q] Fn (N × N) ↔ (Fun [Q] ∧ dom [Q] = (N × N)))
58	29, 56, 57	mpbir2an 723	. 2 ⊢ [Q] Fn (N × N)
59	3	rnssi 5932	. . 3 ⊢ ran [Q] ⊆ ran ((N × N) × Q)
60		rnxpss 6172	. . 3 ⊢ ran ((N × N) × Q) ⊆ Q
61	59, 60	sstri 3947	. 2 ⊢ ran [Q] ⊆ Q
62		df-f 6542	. 2 ⊢ ([Q]:(N × N)⟶Q ↔ ([Q] Fn (N × N) ∧ ran [Q] ⊆ Q))
63	58, 61, 62	mpbir2an 723	1 ⊢ [Q]:(N × N)⟶Q

Syntax hints:   → wi 4   ∧ wa 400  ∀wal 1568   = wceq 1570  ∃wex 1809   ∈ wcel 2143  ∃*wmo 2565  ∃!weu 2596   ≠ wne 2958  ∃wrex 3089  ∃!wreu 3367  Vcvv 3455   ∩ cin 3905   ⊆ wss 3906  ∅c0 4287   class class class wbr 5110   × cxp 5661  dom cdm 5663  ran crn 5664  Rel wrel 5668  Fun wfun 6532   Fn wfn 6533  ⟶wf 6534   Er wer 8692  Ncnpi 10830   ~_Q ceq 10837  Qcnq 10838  1_Qc1q 10839  [Q]cerq 10840

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pr 5406  ax-un 7734

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-rdg 8398  df-1o 8454  df-oadd 8458  df-omul 8459  df-er 8695  df-ni 10858  df-mi 10860  df-lti 10861  df-enq 10897  df-nq 10898  df-erq 10899  df-1nq 10902

This theorem is referenced by:  nqercl  10917  nqerrel  10918  nqerid  10919  addnqf  10934  mulnqf  10935  adderpq  10942  mulerpq  10943  lterpq  10956