Theorem fncnv 6613

Description: Single-rootedness (see funcnv 6609) of a class cut down by a Cartesian product. (Contributed by NM, 5-Mar-2007.)

Assertion

Ref	Expression
fncnv	⊢ (◡(𝑅 ∩ (𝐴 × 𝐵)) Fn 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑥𝑅𝑦)

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

Proof of Theorem fncnv

Step	Hyp	Ref	Expression
1		df-fn 6543	. 2 ⊢ (◡(𝑅 ∩ (𝐴 × 𝐵)) Fn 𝐵 ↔ (Fun ◡(𝑅 ∩ (𝐴 × 𝐵)) ∧ dom ◡(𝑅 ∩ (𝐴 × 𝐵)) = 𝐵))
2		df-rn 5674	. . . 4 ⊢ ran (𝑅 ∩ (𝐴 × 𝐵)) = dom ◡(𝑅 ∩ (𝐴 × 𝐵))
3	2	eqeq1i 2770	. . 3 ⊢ (ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 ↔ dom ◡(𝑅 ∩ (𝐴 × 𝐵)) = 𝐵)
4	3	anbi2i 635	. 2 ⊢ ((Fun ◡(𝑅 ∩ (𝐴 × 𝐵)) ∧ ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵) ↔ (Fun ◡(𝑅 ∩ (𝐴 × 𝐵)) ∧ dom ◡(𝑅 ∩ (𝐴 × 𝐵)) = 𝐵))
5		rninxp 6179	. . . . 5 ⊢ (ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑥𝑅𝑦)
6	5	anbi1i 636	. . . 4 ⊢ ((ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦) ↔ (∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
7		funcnv 6609	. . . . . 6 ⊢ (Fun ◡(𝑅 ∩ (𝐴 × 𝐵)) ↔ ∀𝑦 ∈ ran (𝑅 ∩ (𝐴 × 𝐵))∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦)
8		raleq 3322	. . . . . . 7 ⊢ (ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 → (∀𝑦 ∈ ran (𝑅 ∩ (𝐴 × 𝐵))∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ∀𝑦 ∈ 𝐵 ∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦))
9		moanimv 2649	. . . . . . . . . 10 ⊢ (∃*𝑥(𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)) ↔ (𝑦 ∈ 𝐵 → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)))
10		brinxp2 5741	. . . . . . . . . . . 12 ⊢ (𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥𝑅𝑦))
11		an21 657	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥𝑅𝑦) ↔ (𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)))
12	10, 11	bitri 278	. . . . . . . . . . 11 ⊢ (𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ (𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)))
13	12	mobii 2578	. . . . . . . . . 10 ⊢ (∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ∃*𝑥(𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)))
14		df-rmo 3371	. . . . . . . . . . 11 ⊢ (∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦))
15	14	imbi2i 339	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐵 → ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦) ↔ (𝑦 ∈ 𝐵 → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)))
16	9, 13, 15	3bitr4i 306	. . . . . . . . 9 ⊢ (∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ (𝑦 ∈ 𝐵 → ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
17		biimt 363	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → (∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦 ↔ (𝑦 ∈ 𝐵 → ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦)))
18	16, 17	bitr4id 293	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐵 → (∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
19	18	ralbiia 3111	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝐵 ∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦)
20	8, 19	bitrdi 290	. . . . . 6 ⊢ (ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 → (∀𝑦 ∈ ran (𝑅 ∩ (𝐴 × 𝐵))∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
21	7, 20	bitrid 286	. . . . 5 ⊢ (ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 → (Fun ◡(𝑅 ∩ (𝐴 × 𝐵)) ↔ ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
22	21	pm5.32i 585	. . . 4 ⊢ ((ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 ∧ Fun ◡(𝑅 ∩ (𝐴 × 𝐵))) ↔ (ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
23		r19.26 3127	. . . 4 ⊢ (∀𝑦 ∈ 𝐵 (∃𝑥 ∈ 𝐴 𝑥𝑅𝑦 ∧ ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦) ↔ (∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
24	6, 22, 23	3bitr4i 306	. . 3 ⊢ ((ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 ∧ Fun ◡(𝑅 ∩ (𝐴 × 𝐵))) ↔ ∀𝑦 ∈ 𝐵 (∃𝑥 ∈ 𝐴 𝑥𝑅𝑦 ∧ ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
25		ancom 466	. . 3 ⊢ ((Fun ◡(𝑅 ∩ (𝐴 × 𝐵)) ∧ ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵) ↔ (ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 ∧ Fun ◡(𝑅 ∩ (𝐴 × 𝐵))))
26		reu5 3373	. . . 4 ⊢ (∃!𝑥 ∈ 𝐴 𝑥𝑅𝑦 ↔ (∃𝑥 ∈ 𝐴 𝑥𝑅𝑦 ∧ ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
27	26	ralbii 3113	. . 3 ⊢ (∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑥𝑅𝑦 ↔ ∀𝑦 ∈ 𝐵 (∃𝑥 ∈ 𝐴 𝑥𝑅𝑦 ∧ ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
28	24, 25, 27	3bitr4i 306	. 2 ⊢ ((Fun ◡(𝑅 ∩ (𝐴 × 𝐵)) ∧ ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵) ↔ ∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑥𝑅𝑦)
29	1, 4, 28	3bitr2i 302	1 ⊢ (◡(𝑅 ∩ (𝐴 × 𝐵)) Fn 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑥𝑅𝑦)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∃*wmo 2567  ∀wral 3081  ∃wrex 3091  ∃!wreu 3369  ∃*wrmo 3370   ∩ cin 3905   class class class wbr 5111   × cxp 5661  ^◡ccnv 5662  dom cdm 5663  ran crn 5664  Fun wfun 6534   Fn wfn 6535

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-11 2195  ax-ext 2737  ax-sep 5259  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-id 5558  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-fun 6542  df-fn 6543

This theorem is used by: (None)