Theorem nqerf 10875

Description: Corollary of nqereu 10874: 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 10858	. . . . . . 7 ⊢ [Q] = ( ~Q ∩ ((N × N) × Q))
2		inss2 4194	. . . . . . 7 ⊢ ( ~Q ∩ ((N × N) × Q)) ⊆ ((N × N) × Q)
3	1, 2	eqsstri 3981	. . . . . 6 ⊢ [Q] ⊆ ((N × N) × Q)
4		xpss 5654	. . . . . 6 ⊢ ((N × N) × Q) ⊆ (V × V)
5	3, 4	sstri 3956	. . . . 5 ⊢ [Q] ⊆ (V × V)
6		df-rel 5645	. . . . 5 ⊢ (Rel [Q] ↔ [Q] ⊆ (V × V))
7	5, 6	mpbir 230	. . . 4 ⊢ Rel [Q]
8		nqereu 10874	. . . . . . . 8 ⊢ (𝑥 ∈ (N × N) → ∃!𝑦 ∈ Q 𝑦 ~Q 𝑥)
9		df-reu 3352	. . . . . . . . 9 ⊢ (∃!𝑦 ∈ Q 𝑦 ~Q 𝑥 ↔ ∃!𝑦(𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥))
10		eumo 2571	. . . . . . . . 9 ⊢ (∃!𝑦(𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥) → ∃*𝑦(𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥))
11	9, 10	sylbi 216	. . . . . . . 8 ⊢ (∃!𝑦 ∈ Q 𝑦 ~Q 𝑥 → ∃*𝑦(𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥))
12	8, 11	syl 17	. . . . . . 7 ⊢ (𝑥 ∈ (N × N) → ∃*𝑦(𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥))
13		moanimv 2614	. . . . . . 7 ⊢ (∃*𝑦(𝑥 ∈ (N × N) ∧ (𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥)) ↔ (𝑥 ∈ (N × N) → ∃*𝑦(𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥)))
14	12, 13	mpbir 230	. . . . . 6 ⊢ ∃*𝑦(𝑥 ∈ (N × N) ∧ (𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥))
15	3	brel 5702	. . . . . . . . 9 ⊢ (𝑥[Q]𝑦 → (𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q))
16	15	simpld 495	. . . . . . . 8 ⊢ (𝑥[Q]𝑦 → 𝑥 ∈ (N × N))
17	15	simprd 496	. . . . . . . 8 ⊢ (𝑥[Q]𝑦 → 𝑦 ∈ Q)
18		enqer 10866	. . . . . . . . . 10 ⊢ ~Q Er (N × N)
19	18	a1i 11	. . . . . . . . 9 ⊢ (𝑥[Q]𝑦 → ~Q Er (N × N))
20		inss1 4193	. . . . . . . . . . 11 ⊢ ( ~Q ∩ ((N × N) × Q)) ⊆ ~Q
21	1, 20	eqsstri 3981	. . . . . . . . . 10 ⊢ [Q] ⊆ ~Q
22	21	ssbri 5155	. . . . . . . . 9 ⊢ (𝑥[Q]𝑦 → 𝑥 ~Q 𝑦)
23	19, 22	ersym 8667	. . . . . . . 8 ⊢ (𝑥[Q]𝑦 → 𝑦 ~Q 𝑥)
24	16, 17, 23	jca32 516	. . . . . . 7 ⊢ (𝑥[Q]𝑦 → (𝑥 ∈ (N × N) ∧ (𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥)))
25	24	moimi 2538	. . . . . 6 ⊢ (∃*𝑦(𝑥 ∈ (N × N) ∧ (𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥)) → ∃*𝑦 𝑥[Q]𝑦)
26	14, 25	ax-mp 5	. . . . 5 ⊢ ∃*𝑦 𝑥[Q]𝑦
27	26	ax-gen 1797	. . . 4 ⊢ ∀𝑥∃*𝑦 𝑥[Q]𝑦
28		dffun6 6514	. . . 4 ⊢ (Fun [Q] ↔ (Rel [Q] ∧ ∀𝑥∃*𝑦 𝑥[Q]𝑦))
29	7, 27, 28	mpbir2an 709	. . 3 ⊢ Fun [Q]
30		dmss 5863	. . . . . 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 10873	. . . . . 6 ⊢ 1Q ∈ Q
33		ne0i 4299	. . . . . 6 ⊢ (1Q ∈ Q → Q ≠ ∅)
34		dmxp 5889	. . . . . 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 3983	. . . 4 ⊢ dom [Q] ⊆ (N × N)
37		reurex 3355	. . . . . . . 8 ⊢ (∃!𝑦 ∈ Q 𝑦 ~Q 𝑥 → ∃𝑦 ∈ Q 𝑦 ~Q 𝑥)
38		simpll 765	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → 𝑥 ∈ (N × N))
39		simplr 767	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → 𝑦 ∈ Q)
40	18	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → ~Q Er (N × N))
41		simpr 485	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → 𝑦 ~Q 𝑥)
42	40, 41	ersym 8667	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → 𝑥 ~Q 𝑦)
43	1	breqi 5116	. . . . . . . . . . . 12 ⊢ (𝑥[Q]𝑦 ↔ 𝑥( ~Q ∩ ((N × N) × Q))𝑦)
44		brinxp2 5714	. . . . . . . . . . . 12 ⊢ (𝑥( ~Q ∩ ((N × N) × Q))𝑦 ↔ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑥 ~Q 𝑦))
45	43, 44	bitri 274	. . . . . . . . . . 11 ⊢ (𝑥[Q]𝑦 ↔ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑥 ~Q 𝑦))
46	38, 39, 42, 45	syl21anbrc 1344	. . . . . . . . . 10 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → 𝑥[Q]𝑦)
47	46	ex 413	. . . . . . . . 9 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) → (𝑦 ~Q 𝑥 → 𝑥[Q]𝑦))
48	47	reximdva 3161	. . . . . . . 8 ⊢ (𝑥 ∈ (N × N) → (∃𝑦 ∈ Q 𝑦 ~Q 𝑥 → ∃𝑦 ∈ Q 𝑥[Q]𝑦))
49		rexex 3075	. . . . . . . 8 ⊢ (∃𝑦 ∈ Q 𝑥[Q]𝑦 → ∃𝑦 𝑥[Q]𝑦)
50	37, 48, 49	syl56 36	. . . . . . 7 ⊢ (𝑥 ∈ (N × N) → (∃!𝑦 ∈ Q 𝑦 ~Q 𝑥 → ∃𝑦 𝑥[Q]𝑦))
51	8, 50	mpd 15	. . . . . 6 ⊢ (𝑥 ∈ (N × N) → ∃𝑦 𝑥[Q]𝑦)
52		vex 3450	. . . . . . 7 ⊢ 𝑥 ∈ V
53	52	eldm 5861	. . . . . 6 ⊢ (𝑥 ∈ dom [Q] ↔ ∃𝑦 𝑥[Q]𝑦)
54	51, 53	sylibr 233	. . . . 5 ⊢ (𝑥 ∈ (N × N) → 𝑥 ∈ dom [Q])
55	54	ssriv 3951	. . . 4 ⊢ (N × N) ⊆ dom [Q]
56	36, 55	eqssi 3963	. . 3 ⊢ dom [Q] = (N × N)
57		df-fn 6504	. . 3 ⊢ ([Q] Fn (N × N) ↔ (Fun [Q] ∧ dom [Q] = (N × N)))
58	29, 56, 57	mpbir2an 709	. 2 ⊢ [Q] Fn (N × N)
59	3	rnssi 5900	. . 3 ⊢ ran [Q] ⊆ ran ((N × N) × Q)
60		rnxpss 6129	. . 3 ⊢ ran ((N × N) × Q) ⊆ Q
61	59, 60	sstri 3956	. 2 ⊢ ran [Q] ⊆ Q
62		df-f 6505	. 2 ⊢ ([Q]:(N × N)⟶Q ↔ ([Q] Fn (N × N) ∧ ran [Q] ⊆ Q))
63	58, 61, 62	mpbir2an 709	1 ⊢ [Q]:(N × N)⟶Q

Syntax hints:   → wi 4   ∧ wa 396  ∀wal 1539   = wceq 1541  ∃wex 1781   ∈ wcel 2106  ∃*wmo 2531  ∃!weu 2561   ≠ wne 2939  ∃wrex 3069  ∃!wreu 3349  Vcvv 3446   ∩ cin 3912   ⊆ wss 3913  ∅c0 4287   class class class wbr 5110   × cxp 5636  dom cdm 5638  ran crn 5639  Rel wrel 5643  Fun wfun 6495   Fn wfn 6496  ⟶wf 6497   Er wer 8652  Ncnpi 10789   ~_Q ceq 10796  Qcnq 10797  1_Qc1q 10798  [Q]cerq 10799

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-sep 5261  ax-nul 5268  ax-pr 5389  ax-un 7677

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rmo 3351  df-reu 3352  df-rab 3406  df-v 3448  df-sbc 3743  df-csb 3859  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3932  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-iun 4961  df-br 5111  df-opab 5173  df-mpt 5194  df-tr 5228  df-id 5536  df-eprel 5542  df-po 5550  df-so 5551  df-fr 5593  df-we 5595  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6258  df-ord 6325  df-on 6326  df-lim 6327  df-suc 6328  df-iota 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fo 6507  df-f1o 6508  df-fv 6509  df-ov 7365  df-oprab 7366  df-mpo 7367  df-om 7808  df-1st 7926  df-2nd 7927  df-frecs 8217  df-wrecs 8248  df-recs 8322  df-rdg 8361  df-1o 8417  df-oadd 8421  df-omul 8422  df-er 8655  df-ni 10817  df-mi 10819  df-lti 10820  df-enq 10856  df-nq 10857  df-erq 10858  df-1nq 10861

This theorem is referenced by:  nqercl  10876  nqerrel  10877  nqerid  10878  addnqf  10893  mulnqf  10894  adderpq  10901  mulerpq  10902  lterpq  10915