Theorem funcnv4mpt 32686

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 1912	. 2 ⊢ Ⅎ𝑖𝜑
2		nfcv 2903	. 2 ⊢ Ⅎ𝑖𝐴
3		nfcv 2903	. 2 ⊢ Ⅎ𝑖𝐹
4		funcnvmpt.3	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
5		funcnvmpt.1	. . . 4 ⊢ Ⅎ𝑥𝐴
6		nfcv 2903	. . . 4 ⊢ Ⅎ𝑖𝐵
7		nfcsb1v 3933	. . . 4 ⊢ Ⅎ𝑥⦋𝑖 / 𝑥⦌𝐵
8		csbeq1a 3922	. . . 4 ⊢ (𝑥 = 𝑖 → 𝐵 = ⦋𝑖 / 𝑥⦌𝐵)
9	5, 2, 6, 7, 8	cbvmptf 5257	. . 3 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑖 ∈ 𝐴 ↦ ⦋𝑖 / 𝑥⦌𝐵)
10	4, 9	eqtri 2763	. 2 ⊢ 𝐹 = (𝑖 ∈ 𝐴 ↦ ⦋𝑖 / 𝑥⦌𝐵)
11		funcnvmpt.4	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
12	11	sbimi 2072	. . 3 ⊢ ([𝑖 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) → [𝑖 / 𝑥]𝐵 ∈ 𝑉)
13		funcnvmpt.0	. . . . 5 ⊢ Ⅎ𝑥𝜑
14		nfcv 2903	. . . . . 6 ⊢ Ⅎ𝑥𝑖
15	14, 5	nfel 2918	. . . . 5 ⊢ Ⅎ𝑥 𝑖 ∈ 𝐴
16	13, 15	nfan 1897	. . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑖 ∈ 𝐴)
17		eleq1w 2822	. . . . 5 ⊢ (𝑥 = 𝑖 → (𝑥 ∈ 𝐴 ↔ 𝑖 ∈ 𝐴))
18	17	anbi2d 630	. . . 4 ⊢ (𝑥 = 𝑖 → ((𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑖 ∈ 𝐴)))
19	16, 18	sbiev 2313	. . 3 ⊢ ([𝑖 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑖 ∈ 𝐴))
20		nfcv 2903	. . . . 5 ⊢ Ⅎ𝑥𝑉
21	7, 20	nfel 2918	. . . 4 ⊢ Ⅎ𝑥⦋𝑖 / 𝑥⦌𝐵 ∈ 𝑉
22	8	eleq1d 2824	. . . 4 ⊢ (𝑥 = 𝑖 → (𝐵 ∈ 𝑉 ↔ ⦋𝑖 / 𝑥⦌𝐵 ∈ 𝑉))
23	21, 22	sbiev 2313	. . 3 ⊢ ([𝑖 / 𝑥]𝐵 ∈ 𝑉 ↔ ⦋𝑖 / 𝑥⦌𝐵 ∈ 𝑉)
24	12, 19, 23	3imtr3i 291	. 2 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝐴) → ⦋𝑖 / 𝑥⦌𝐵 ∈ 𝑉)
25		csbeq1 3911	. 2 ⊢ (𝑖 = 𝑗 → ⦋𝑖 / 𝑥⦌𝐵 = ⦋𝑗 / 𝑥⦌𝐵)
26	1, 2, 3, 10, 24, 25	funcnv5mpt 32685	1 ⊢ (𝜑 → (Fun ◡𝐹 ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐴 (𝑖 = 𝑗 ∨ ⦋𝑖 / 𝑥⦌𝐵 ≠ ⦋𝑗 / 𝑥⦌𝐵)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1537  Ⅎwnf 1780  [wsb 2062   ∈ wcel 2106  Ⅎwnfc 2888   ≠ wne 2938  ∀wral 3059  ⦋csb 3908   ↦ cmpt 5231  ^◡ccnv 5688  Fun wfun 6557

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3378  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-fv 6571

This theorem is referenced by:  disjdsct  32718