Theorem funcnv4mpt 32626

Description: Two ways to say that a function in maps-to notation is single-rooted. (Contributed by Thierry Arnoux, 2-Mar-2017.)

Hypotheses

Ref	Expression
funcnvmpt.0	⊢ Ⅎ𝑥𝜑
funcnvmpt.1	⊢ Ⅎ𝑥𝐴
funcnvmpt.2	⊢ Ⅎ𝑥𝐹
funcnvmpt.3	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
funcnvmpt.4	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)

Assertion

Ref	Expression
funcnv4mpt	⊢ (𝜑 → (Fun ◡𝐹 ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐴 (𝑖 = 𝑗 ∨ ⦋𝑖 / 𝑥⦌𝐵 ≠ ⦋𝑗 / 𝑥⦌𝐵)))

Distinct variable groups:   𝑖,𝑗,𝑥   𝐴,𝑖,𝑗   𝐵,𝑖,𝑗   𝑖,𝐹   𝑥,𝑉   𝜑,𝑖,𝑗

Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥)   𝐵(𝑥)   𝐹(𝑥,𝑗)   𝑉(𝑖,𝑗)

Proof of Theorem funcnv4mpt

Step	Hyp	Ref	Expression
1		nfv 1914	. 2 ⊢ Ⅎ𝑖𝜑
2		nfcv 2891	. 2 ⊢ Ⅎ𝑖𝐴
3		nfcv 2891	. 2 ⊢ Ⅎ𝑖𝐹
4		funcnvmpt.3	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
5		funcnvmpt.1	. . . 4 ⊢ Ⅎ𝑥𝐴
6		nfcv 2891	. . . 4 ⊢ Ⅎ𝑖𝐵
7		nfcsb1v 3877	. . . 4 ⊢ Ⅎ𝑥⦋𝑖 / 𝑥⦌𝐵
8		csbeq1a 3867	. . . 4 ⊢ (𝑥 = 𝑖 → 𝐵 = ⦋𝑖 / 𝑥⦌𝐵)
9	5, 2, 6, 7, 8	cbvmptf 5195	. . 3 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑖 ∈ 𝐴 ↦ ⦋𝑖 / 𝑥⦌𝐵)
10	4, 9	eqtri 2752	. 2 ⊢ 𝐹 = (𝑖 ∈ 𝐴 ↦ ⦋𝑖 / 𝑥⦌𝐵)
11		funcnvmpt.4	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
12	11	sbimi 2075	. . 3 ⊢ ([𝑖 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) → [𝑖 / 𝑥]𝐵 ∈ 𝑉)
13		funcnvmpt.0	. . . . 5 ⊢ Ⅎ𝑥𝜑
14		nfcv 2891	. . . . . 6 ⊢ Ⅎ𝑥𝑖
15	14, 5	nfel 2906	. . . . 5 ⊢ Ⅎ𝑥 𝑖 ∈ 𝐴
16	13, 15	nfan 1899	. . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑖 ∈ 𝐴)
17		eleq1w 2811	. . . . 5 ⊢ (𝑥 = 𝑖 → (𝑥 ∈ 𝐴 ↔ 𝑖 ∈ 𝐴))
18	17	anbi2d 630	. . . 4 ⊢ (𝑥 = 𝑖 → ((𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑖 ∈ 𝐴)))
19	16, 18	sbiev 2313	. . 3 ⊢ ([𝑖 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑖 ∈ 𝐴))
20		nfcv 2891	. . . . 5 ⊢ Ⅎ𝑥𝑉
21	7, 20	nfel 2906	. . . 4 ⊢ Ⅎ𝑥⦋𝑖 / 𝑥⦌𝐵 ∈ 𝑉
22	8	eleq1d 2813	. . . 4 ⊢ (𝑥 = 𝑖 → (𝐵 ∈ 𝑉 ↔ ⦋𝑖 / 𝑥⦌𝐵 ∈ 𝑉))
23	21, 22	sbiev 2313	. . 3 ⊢ ([𝑖 / 𝑥]𝐵 ∈ 𝑉 ↔ ⦋𝑖 / 𝑥⦌𝐵 ∈ 𝑉)
24	12, 19, 23	3imtr3i 291	. 2 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝐴) → ⦋𝑖 / 𝑥⦌𝐵 ∈ 𝑉)
25		csbeq1 3856	. 2 ⊢ (𝑖 = 𝑗 → ⦋𝑖 / 𝑥⦌𝐵 = ⦋𝑗 / 𝑥⦌𝐵)
26	1, 2, 3, 10, 24, 25	funcnv5mpt 32625	1 ⊢ (𝜑 → (Fun ◡𝐹 ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐴 (𝑖 = 𝑗 ∨ ⦋𝑖 / 𝑥⦌𝐵 ≠ ⦋𝑗 / 𝑥⦌𝐵)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1540  Ⅎwnf 1783  [wsb 2065   ∈ wcel 2109  Ⅎwnfc 2876   ≠ wne 2925  ∀wral 3044  ⦋csb 3853   ↦ cmpt 5176  ^◡ccnv 5622  Fun wfun 6480

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 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5238  ax-nul 5248  ax-pr 5374

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 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3345  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6442  df-fun 6488  df-fn 6489  df-fv 6494

This theorem is referenced by:  disjdsct  32659