Theorem nqerf 10925

Description: Corollary of nqereu 10924: 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 10908	. . . . . . 7 ⊢ [Q] = ( ~Q ∩ ((N × N) × Q))
2		inss2 4230	. . . . . . 7 ⊢ ( ~Q ∩ ((N × N) × Q)) ⊆ ((N × N) × Q)
3	1, 2	eqsstri 4017	. . . . . 6 ⊢ [Q] ⊆ ((N × N) × Q)
4		xpss 5693	. . . . . 6 ⊢ ((N × N) × Q) ⊆ (V × V)
5	3, 4	sstri 3992	. . . . 5 ⊢ [Q] ⊆ (V × V)
6		df-rel 5684	. . . . 5 ⊢ (Rel [Q] ↔ [Q] ⊆ (V × V))
7	5, 6	mpbir 230	. . . 4 ⊢ Rel [Q]
8		nqereu 10924	. . . . . . . 8 ⊢ (𝑥 ∈ (N × N) → ∃!𝑦 ∈ Q 𝑦 ~Q 𝑥)
9		df-reu 3378	. . . . . . . . 9 ⊢ (∃!𝑦 ∈ Q 𝑦 ~Q 𝑥 ↔ ∃!𝑦(𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥))
10		eumo 2573	. . . . . . . . 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 2616	. . . . . . 7 ⊢ (∃*𝑦(𝑥 ∈ (N × N) ∧ (𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥)) ↔ (𝑥 ∈ (N × N) → ∃*𝑦(𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥)))
14	12, 13	mpbir 230	. . . . . 6 ⊢ ∃*𝑦(𝑥 ∈ (N × N) ∧ (𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥))
15	3	brel 5742	. . . . . . . . 9 ⊢ (𝑥[Q]𝑦 → (𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q))
16	15	simpld 496	. . . . . . . 8 ⊢ (𝑥[Q]𝑦 → 𝑥 ∈ (N × N))
17	15	simprd 497	. . . . . . . 8 ⊢ (𝑥[Q]𝑦 → 𝑦 ∈ Q)
18		enqer 10916	. . . . . . . . . 10 ⊢ ~Q Er (N × N)
19	18	a1i 11	. . . . . . . . 9 ⊢ (𝑥[Q]𝑦 → ~Q Er (N × N))
20		inss1 4229	. . . . . . . . . . 11 ⊢ ( ~Q ∩ ((N × N) × Q)) ⊆ ~Q
21	1, 20	eqsstri 4017	. . . . . . . . . 10 ⊢ [Q] ⊆ ~Q
22	21	ssbri 5194	. . . . . . . . 9 ⊢ (𝑥[Q]𝑦 → 𝑥 ~Q 𝑦)
23	19, 22	ersym 8715	. . . . . . . 8 ⊢ (𝑥[Q]𝑦 → 𝑦 ~Q 𝑥)
24	16, 17, 23	jca32 517	. . . . . . 7 ⊢ (𝑥[Q]𝑦 → (𝑥 ∈ (N × N) ∧ (𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥)))
25	24	moimi 2540	. . . . . 6 ⊢ (∃*𝑦(𝑥 ∈ (N × N) ∧ (𝑦 ∈ Q ∧ 𝑦 ~Q 𝑥)) → ∃*𝑦 𝑥[Q]𝑦)
26	14, 25	ax-mp 5	. . . . 5 ⊢ ∃*𝑦 𝑥[Q]𝑦
27	26	ax-gen 1798	. . . 4 ⊢ ∀𝑥∃*𝑦 𝑥[Q]𝑦
28		dffun6 6557	. . . 4 ⊢ (Fun [Q] ↔ (Rel [Q] ∧ ∀𝑥∃*𝑦 𝑥[Q]𝑦))
29	7, 27, 28	mpbir2an 710	. . 3 ⊢ Fun [Q]
30		dmss 5903	. . . . . 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 10923	. . . . . 6 ⊢ 1Q ∈ Q
33		ne0i 4335	. . . . . 6 ⊢ (1Q ∈ Q → Q ≠ ∅)
34		dmxp 5929	. . . . . 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 4019	. . . 4 ⊢ dom [Q] ⊆ (N × N)
37		reurex 3381	. . . . . . . 8 ⊢ (∃!𝑦 ∈ Q 𝑦 ~Q 𝑥 → ∃𝑦 ∈ Q 𝑦 ~Q 𝑥)
38		simpll 766	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → 𝑥 ∈ (N × N))
39		simplr 768	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → 𝑦 ∈ Q)
40	18	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → ~Q Er (N × N))
41		simpr 486	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → 𝑦 ~Q 𝑥)
42	40, 41	ersym 8715	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → 𝑥 ~Q 𝑦)
43	1	breqi 5155	. . . . . . . . . . . 12 ⊢ (𝑥[Q]𝑦 ↔ 𝑥( ~Q ∩ ((N × N) × Q))𝑦)
44		brinxp2 5754	. . . . . . . . . . . 12 ⊢ (𝑥( ~Q ∩ ((N × N) × Q))𝑦 ↔ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑥 ~Q 𝑦))
45	43, 44	bitri 275	. . . . . . . . . . 11 ⊢ (𝑥[Q]𝑦 ↔ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑥 ~Q 𝑦))
46	38, 39, 42, 45	syl21anbrc 1345	. . . . . . . . . 10 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) ∧ 𝑦 ~Q 𝑥) → 𝑥[Q]𝑦)
47	46	ex 414	. . . . . . . . 9 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ Q) → (𝑦 ~Q 𝑥 → 𝑥[Q]𝑦))
48	47	reximdva 3169	. . . . . . . 8 ⊢ (𝑥 ∈ (N × N) → (∃𝑦 ∈ Q 𝑦 ~Q 𝑥 → ∃𝑦 ∈ Q 𝑥[Q]𝑦))
49		rexex 3077	. . . . . . . 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 3479	. . . . . . 7 ⊢ 𝑥 ∈ V
53	52	eldm 5901	. . . . . 6 ⊢ (𝑥 ∈ dom [Q] ↔ ∃𝑦 𝑥[Q]𝑦)
54	51, 53	sylibr 233	. . . . 5 ⊢ (𝑥 ∈ (N × N) → 𝑥 ∈ dom [Q])
55	54	ssriv 3987	. . . 4 ⊢ (N × N) ⊆ dom [Q]
56	36, 55	eqssi 3999	. . 3 ⊢ dom [Q] = (N × N)
57		df-fn 6547	. . 3 ⊢ ([Q] Fn (N × N) ↔ (Fun [Q] ∧ dom [Q] = (N × N)))
58	29, 56, 57	mpbir2an 710	. 2 ⊢ [Q] Fn (N × N)
59	3	rnssi 5940	. . 3 ⊢ ran [Q] ⊆ ran ((N × N) × Q)
60		rnxpss 6172	. . 3 ⊢ ran ((N × N) × Q) ⊆ Q
61	59, 60	sstri 3992	. 2 ⊢ ran [Q] ⊆ Q
62		df-f 6548	. 2 ⊢ ([Q]:(N × N)⟶Q ↔ ([Q] Fn (N × N) ∧ ran [Q] ⊆ Q))
63	58, 61, 62	mpbir2an 710	1 ⊢ [Q]:(N × N)⟶Q

Syntax hints:   → wi 4   ∧ wa 397  ∀wal 1540   = wceq 1542  ∃wex 1782   ∈ wcel 2107  ∃*wmo 2533  ∃!weu 2563   ≠ wne 2941  ∃wrex 3071  ∃!wreu 3375  Vcvv 3475   ∩ cin 3948   ⊆ wss 3949  ∅c0 4323   class class class wbr 5149   × cxp 5675  dom cdm 5677  ran crn 5678  Rel wrel 5682  Fun wfun 6538   Fn wfn 6539  ⟶wf 6540   Er wer 8700  Ncnpi 10839   ~_Q ceq 10846  Qcnq 10847  1_Qc1q 10848  [Q]cerq 10849

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428  ax-un 7725

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5575  df-eprel 5581  df-po 5589  df-so 5590  df-fr 5632  df-we 5634  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-pred 6301  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-ov 7412  df-oprab 7413  df-mpo 7414  df-om 7856  df-1st 7975  df-2nd 7976  df-frecs 8266  df-wrecs 8297  df-recs 8371  df-rdg 8410  df-1o 8466  df-oadd 8470  df-omul 8471  df-er 8703  df-ni 10867  df-mi 10869  df-lti 10870  df-enq 10906  df-nq 10907  df-erq 10908  df-1nq 10911

This theorem is referenced by:  nqercl  10926  nqerrel  10927  nqerid  10928  addnqf  10943  mulnqf  10944  adderpq  10951  mulerpq  10952  lterpq  10965