Theorem dff3 7090

Description: Alternate definition of a mapping. (Contributed by NM, 20-Mar-2007.)

Assertion

Ref	Expression
dff3	⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 ⊆ (𝐴 × 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐹,𝑦

Proof of Theorem dff3

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fssxp 6733	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵))
2		ffun 6709	. . . . . . . 8 ⊢ (𝐹:𝐴⟶𝐵 → Fun 𝐹)
3		fdm 6715	. . . . . . . . . 10 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 = 𝐴)
4	3	eleq2d 2820	. . . . . . . . 9 ⊢ (𝐹:𝐴⟶𝐵 → (𝑥 ∈ dom 𝐹 ↔ 𝑥 ∈ 𝐴))
5	4	biimpar 477	. . . . . . . 8 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ dom 𝐹)
6		funfvop 7040	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ⟨𝑥, (𝐹‘𝑥)⟩ ∈ 𝐹)
7	2, 5, 6	syl2an2r 685	. . . . . . 7 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → ⟨𝑥, (𝐹‘𝑥)⟩ ∈ 𝐹)
8		df-br 5120	. . . . . . 7 ⊢ (𝑥𝐹(𝐹‘𝑥) ↔ ⟨𝑥, (𝐹‘𝑥)⟩ ∈ 𝐹)
9	7, 8	sylibr 234	. . . . . 6 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥𝐹(𝐹‘𝑥))
10		fvex 6889	. . . . . . 7 ⊢ (𝐹‘𝑥) ∈ V
11		breq2 5123	. . . . . . 7 ⊢ (𝑦 = (𝐹‘𝑥) → (𝑥𝐹𝑦 ↔ 𝑥𝐹(𝐹‘𝑥)))
12	10, 11	spcev 3585	. . . . . 6 ⊢ (𝑥𝐹(𝐹‘𝑥) → ∃𝑦 𝑥𝐹𝑦)
13	9, 12	syl 17	. . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → ∃𝑦 𝑥𝐹𝑦)
14		funmo 6551	. . . . . . 7 ⊢ (Fun 𝐹 → ∃*𝑦 𝑥𝐹𝑦)
15	2, 14	syl 17	. . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → ∃*𝑦 𝑥𝐹𝑦)
16	15	adantr 480	. . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → ∃*𝑦 𝑥𝐹𝑦)
17		df-eu 2568	. . . . 5 ⊢ (∃!𝑦 𝑥𝐹𝑦 ↔ (∃𝑦 𝑥𝐹𝑦 ∧ ∃*𝑦 𝑥𝐹𝑦))
18	13, 16, 17	sylanbrc 583	. . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → ∃!𝑦 𝑥𝐹𝑦)
19	18	ralrimiva 3132	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦)
20	1, 19	jca 511	. 2 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ⊆ (𝐴 × 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦))
21		xpss 5670	. . . . . . . 8 ⊢ (𝐴 × 𝐵) ⊆ (V × V)
22		sstr 3967	. . . . . . . 8 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (𝐴 × 𝐵) ⊆ (V × V)) → 𝐹 ⊆ (V × V))
23	21, 22	mpan2 691	. . . . . . 7 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → 𝐹 ⊆ (V × V))
24		df-rel 5661	. . . . . . 7 ⊢ (Rel 𝐹 ↔ 𝐹 ⊆ (V × V))
25	23, 24	sylibr 234	. . . . . 6 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → Rel 𝐹)
26	25	adantr 480	. . . . 5 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦) → Rel 𝐹)
27		df-ral 3052	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∃!𝑦 𝑥𝐹𝑦))
28		eumo 2577	. . . . . . . . . . . 12 ⊢ (∃!𝑦 𝑥𝐹𝑦 → ∃*𝑦 𝑥𝐹𝑦)
29	28	imim2i 16	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐴 → ∃!𝑦 𝑥𝐹𝑦) → (𝑥 ∈ 𝐴 → ∃*𝑦 𝑥𝐹𝑦))
30	29	adantl 481	. . . . . . . . . 10 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐴 → ∃!𝑦 𝑥𝐹𝑦)) → (𝑥 ∈ 𝐴 → ∃*𝑦 𝑥𝐹𝑦))
31		df-br 5120	. . . . . . . . . . . . . . . 16 ⊢ (𝑥𝐹𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹)
32		ssel 3952	. . . . . . . . . . . . . . . 16 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)))
33	31, 32	biimtrid 242	. . . . . . . . . . . . . . 15 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → (𝑥𝐹𝑦 → ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)))
34		opelxp1 5696	. . . . . . . . . . . . . . 15 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → 𝑥 ∈ 𝐴)
35	33, 34	syl6 35	. . . . . . . . . . . . . 14 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → (𝑥𝐹𝑦 → 𝑥 ∈ 𝐴))
36	35	exlimdv 1933	. . . . . . . . . . . . 13 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → (∃𝑦 𝑥𝐹𝑦 → 𝑥 ∈ 𝐴))
37	36	con3d 152	. . . . . . . . . . . 12 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → (¬ 𝑥 ∈ 𝐴 → ¬ ∃𝑦 𝑥𝐹𝑦))
38		nexmo 2540	. . . . . . . . . . . 12 ⊢ (¬ ∃𝑦 𝑥𝐹𝑦 → ∃*𝑦 𝑥𝐹𝑦)
39	37, 38	syl6 35	. . . . . . . . . . 11 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → (¬ 𝑥 ∈ 𝐴 → ∃*𝑦 𝑥𝐹𝑦))
40	39	adantr 480	. . . . . . . . . 10 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐴 → ∃!𝑦 𝑥𝐹𝑦)) → (¬ 𝑥 ∈ 𝐴 → ∃*𝑦 𝑥𝐹𝑦))
41	30, 40	pm2.61d 179	. . . . . . . . 9 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐴 → ∃!𝑦 𝑥𝐹𝑦)) → ∃*𝑦 𝑥𝐹𝑦)
42	41	ex 412	. . . . . . . 8 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ((𝑥 ∈ 𝐴 → ∃!𝑦 𝑥𝐹𝑦) → ∃*𝑦 𝑥𝐹𝑦))
43	42	alimdv 1916	. . . . . . 7 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → (∀𝑥(𝑥 ∈ 𝐴 → ∃!𝑦 𝑥𝐹𝑦) → ∀𝑥∃*𝑦 𝑥𝐹𝑦))
44	27, 43	biimtrid 242	. . . . . 6 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → (∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦 → ∀𝑥∃*𝑦 𝑥𝐹𝑦))
45	44	imp 406	. . . . 5 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦) → ∀𝑥∃*𝑦 𝑥𝐹𝑦)
46		dffun6 6544	. . . . 5 ⊢ (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑥∃*𝑦 𝑥𝐹𝑦))
47	26, 45, 46	sylanbrc 583	. . . 4 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦) → Fun 𝐹)
48		dmss 5882	. . . . . . 7 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → dom 𝐹 ⊆ dom (𝐴 × 𝐵))
49		dmxpss 6160	. . . . . . 7 ⊢ dom (𝐴 × 𝐵) ⊆ 𝐴
50	48, 49	sstrdi 3971	. . . . . 6 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → dom 𝐹 ⊆ 𝐴)
51		breq1 5122	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑥𝐹𝑦 ↔ 𝑧𝐹𝑦))
52	51	eubidv 2585	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (∃!𝑦 𝑥𝐹𝑦 ↔ ∃!𝑦 𝑧𝐹𝑦))
53	52	rspccv 3598	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦 → (𝑧 ∈ 𝐴 → ∃!𝑦 𝑧𝐹𝑦))
54		euex 2576	. . . . . . . . 9 ⊢ (∃!𝑦 𝑧𝐹𝑦 → ∃𝑦 𝑧𝐹𝑦)
55		vex 3463	. . . . . . . . . 10 ⊢ 𝑧 ∈ V
56	55	eldm 5880	. . . . . . . . 9 ⊢ (𝑧 ∈ dom 𝐹 ↔ ∃𝑦 𝑧𝐹𝑦)
57	54, 56	sylibr 234	. . . . . . . 8 ⊢ (∃!𝑦 𝑧𝐹𝑦 → 𝑧 ∈ dom 𝐹)
58	53, 57	syl6 35	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦 → (𝑧 ∈ 𝐴 → 𝑧 ∈ dom 𝐹))
59	58	ssrdv 3964	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦 → 𝐴 ⊆ dom 𝐹)
60	50, 59	anim12i 613	. . . . 5 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦) → (dom 𝐹 ⊆ 𝐴 ∧ 𝐴 ⊆ dom 𝐹))
61		eqss 3974	. . . . 5 ⊢ (dom 𝐹 = 𝐴 ↔ (dom 𝐹 ⊆ 𝐴 ∧ 𝐴 ⊆ dom 𝐹))
62	60, 61	sylibr 234	. . . 4 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦) → dom 𝐹 = 𝐴)
63		df-fn 6534	. . . 4 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴))
64	47, 62, 63	sylanbrc 583	. . 3 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦) → 𝐹 Fn 𝐴)
65		rnss 5919	. . . . 5 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ ran (𝐴 × 𝐵))
66		rnxpss 6161	. . . . 5 ⊢ ran (𝐴 × 𝐵) ⊆ 𝐵
67	65, 66	sstrdi 3971	. . . 4 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ 𝐵)
68	67	adantr 480	. . 3 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦) → ran 𝐹 ⊆ 𝐵)
69		df-f 6535	. . 3 ⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵))
70	64, 68, 69	sylanbrc 583	. 2 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦) → 𝐹:𝐴⟶𝐵)
71	20, 70	impbii 209	1 ⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 ⊆ (𝐴 × 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1538   = wceq 1540  ∃wex 1779   ∈ wcel 2108  ∃*wmo 2537  ∃!weu 2567  ∀wral 3051  Vcvv 3459   ⊆ wss 3926  ⟨cop 4607   class class class wbr 5119   × cxp 5652  dom cdm 5654  ran crn 5655  Rel wrel 5659  Fun wfun 6525   Fn wfn 6526  ⟶wf 6527  ‘cfv 6531

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pr 5402

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-dif 3929  df-un 3931  df-ss 3943  df-nul 4309  df-if 4501  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-br 5120  df-opab 5182  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-fv 6539

This theorem is referenced by:  dff4  7091  seqomlem2  8465