Theorem fncnv 6571

Description: Single-rootedness (see funcnv 6567) 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 6501	. 2 ⊢ (◡(𝑅 ∩ (𝐴 × 𝐵)) Fn 𝐵 ↔ (Fun ◡(𝑅 ∩ (𝐴 × 𝐵)) ∧ dom ◡(𝑅 ∩ (𝐴 × 𝐵)) = 𝐵))
2		df-rn 5642	. . . 4 ⊢ ran (𝑅 ∩ (𝐴 × 𝐵)) = dom ◡(𝑅 ∩ (𝐴 × 𝐵))
3	2	eqeq1i 2741	. . 3 ⊢ (ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 ↔ dom ◡(𝑅 ∩ (𝐴 × 𝐵)) = 𝐵)
4	3	anbi2i 624	. 2 ⊢ ((Fun ◡(𝑅 ∩ (𝐴 × 𝐵)) ∧ ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵) ↔ (Fun ◡(𝑅 ∩ (𝐴 × 𝐵)) ∧ dom ◡(𝑅 ∩ (𝐴 × 𝐵)) = 𝐵))
5		rninxp 6143	. . . . 5 ⊢ (ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑥𝑅𝑦)
6	5	anbi1i 625	. . . 4 ⊢ ((ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦) ↔ (∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
7		funcnv 6567	. . . . . 6 ⊢ (Fun ◡(𝑅 ∩ (𝐴 × 𝐵)) ↔ ∀𝑦 ∈ ran (𝑅 ∩ (𝐴 × 𝐵))∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦)
8		raleq 3292	. . . . . . 7 ⊢ (ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 → (∀𝑦 ∈ ran (𝑅 ∩ (𝐴 × 𝐵))∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ∀𝑦 ∈ 𝐵 ∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦))
9		moanimv 2619	. . . . . . . . . 10 ⊢ (∃*𝑥(𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)) ↔ (𝑦 ∈ 𝐵 → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)))
10		brinxp2 5709	. . . . . . . . . . . 12 ⊢ (𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥𝑅𝑦))
11		an21 645	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥𝑅𝑦) ↔ (𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)))
12	10, 11	bitri 275	. . . . . . . . . . 11 ⊢ (𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ (𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)))
13	12	mobii 2548	. . . . . . . . . 10 ⊢ (∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ∃*𝑥(𝑦 ∈ 𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)))
14		df-rmo 3342	. . . . . . . . . . 11 ⊢ (∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦))
15	14	imbi2i 336	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐵 → ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦) ↔ (𝑦 ∈ 𝐵 → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)))
16	9, 13, 15	3bitr4i 303	. . . . . . . . 9 ⊢ (∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ (𝑦 ∈ 𝐵 → ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
17		biimt 360	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → (∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦 ↔ (𝑦 ∈ 𝐵 → ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦)))
18	16, 17	bitr4id 290	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐵 → (∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
19	18	ralbiia 3081	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝐵 ∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦)
20	8, 19	bitrdi 287	. . . . . 6 ⊢ (ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 → (∀𝑦 ∈ ran (𝑅 ∩ (𝐴 × 𝐵))∃*𝑥 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
21	7, 20	bitrid 283	. . . . 5 ⊢ (ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 → (Fun ◡(𝑅 ∩ (𝐴 × 𝐵)) ↔ ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
22	21	pm5.32i 574	. . . 4 ⊢ ((ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 ∧ Fun ◡(𝑅 ∩ (𝐴 × 𝐵))) ↔ (ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
23		r19.26 3097	. . . 4 ⊢ (∀𝑦 ∈ 𝐵 (∃𝑥 ∈ 𝐴 𝑥𝑅𝑦 ∧ ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦) ↔ (∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
24	6, 22, 23	3bitr4i 303	. . 3 ⊢ ((ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 ∧ Fun ◡(𝑅 ∩ (𝐴 × 𝐵))) ↔ ∀𝑦 ∈ 𝐵 (∃𝑥 ∈ 𝐴 𝑥𝑅𝑦 ∧ ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
25		ancom 460	. . 3 ⊢ ((Fun ◡(𝑅 ∩ (𝐴 × 𝐵)) ∧ ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵) ↔ (ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵 ∧ Fun ◡(𝑅 ∩ (𝐴 × 𝐵))))
26		reu5 3344	. . . 4 ⊢ (∃!𝑥 ∈ 𝐴 𝑥𝑅𝑦 ↔ (∃𝑥 ∈ 𝐴 𝑥𝑅𝑦 ∧ ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
27	26	ralbii 3083	. . 3 ⊢ (∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑥𝑅𝑦 ↔ ∀𝑦 ∈ 𝐵 (∃𝑥 ∈ 𝐴 𝑥𝑅𝑦 ∧ ∃*𝑥 ∈ 𝐴 𝑥𝑅𝑦))
28	24, 25, 27	3bitr4i 303	. 2 ⊢ ((Fun ◡(𝑅 ∩ (𝐴 × 𝐵)) ∧ ran (𝑅 ∩ (𝐴 × 𝐵)) = 𝐵) ↔ ∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑥𝑅𝑦)
29	1, 4, 28	3bitr2i 299	1 ⊢ (◡(𝑅 ∩ (𝐴 × 𝐵)) Fn 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑥𝑅𝑦)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∃*wmo 2537  ∀wral 3051  ∃wrex 3061  ∃!wreu 3340  ∃*wrmo 3341   ∩ cin 3888   class class class wbr 5085   × cxp 5629  ^◡ccnv 5630  dom cdm 5631  ran crn 5632  Fun wfun 6492   Fn wfn 6493

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-11 2163  ax-ext 2708  ax-sep 5231  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-br 5086  df-opab 5148  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-fun 6500  df-fn 6501

This theorem is referenced by: (None)