Theorem funcnv4mpt 32876

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
funcnv5mpt.0	⊢ Ⅎ𝑥𝜑
funcnv5mpt.1	⊢ Ⅎ𝑥𝐴
funcnv5mpt.2	⊢ Ⅎ𝑥𝐹
funcnv5mpt.3	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
funcnv5mpt.4	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)

Assertion

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

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

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

Proof of Theorem funcnv4mpt

Step	Hyp	Ref	Expression
1		nfv 1935	. 2 ⊢ Ⅎ𝑖𝜑
2		nfcv 2925	. 2 ⊢ Ⅎ𝑖𝐴
3		nfcv 2925	. 2 ⊢ Ⅎ𝑖𝐹
4		funcnv5mpt.3	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
5		funcnv5mpt.1	. . . 4 ⊢ Ⅎ𝑥𝐴
6		nfcv 2925	. . . 4 ⊢ Ⅎ𝑖𝐵
7		nfcsb1v 3877	. . . 4 ⊢ Ⅎ𝑥⦋𝑖 / 𝑥⦌𝐵
8		csbeq1a 3867	. . . 4 ⊢ (𝑥 = 𝑖 → 𝐵 = ⦋𝑖 / 𝑥⦌𝐵)
9	5, 2, 6, 7, 8	cbvmptf 5201	. . 3 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑖 ∈ 𝐴 ↦ ⦋𝑖 / 𝑥⦌𝐵)
10	4, 9	eqtri 2786	. 2 ⊢ 𝐹 = (𝑖 ∈ 𝐴 ↦ ⦋𝑖 / 𝑥⦌𝐵)
11		funcnv5mpt.4	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
12	11	sbimi 2108	. . 3 ⊢ ([𝑖 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) → [𝑖 / 𝑥]𝐵 ∈ 𝑉)
13		funcnv5mpt.0	. . . . 5 ⊢ Ⅎ𝑥𝜑
14		nfcv 2925	. . . . . 6 ⊢ Ⅎ𝑥𝑖
15	14, 5	nfel 2939	. . . . 5 ⊢ Ⅎ𝑥 𝑖 ∈ 𝐴
16	13, 15	nfan 1920	. . . 4 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑖 ∈ 𝐴)
17		eleq1w 2846	. . . . 5 ⊢ (𝑥 = 𝑖 → (𝑥 ∈ 𝐴 ↔ 𝑖 ∈ 𝐴))
18	17	anbi2d 639	. . . 4 ⊢ (𝑥 = 𝑖 → ((𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑖 ∈ 𝐴)))
19	16, 18	sbiev 2347	. . 3 ⊢ ([𝑖 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑖 ∈ 𝐴))
20		nfcv 2925	. . . . 5 ⊢ Ⅎ𝑥𝑉
21	7, 20	nfel 2939	. . . 4 ⊢ Ⅎ𝑥⦋𝑖 / 𝑥⦌𝐵 ∈ 𝑉
22	8	eleq1d 2848	. . . 4 ⊢ (𝑥 = 𝑖 → (𝐵 ∈ 𝑉 ↔ ⦋𝑖 / 𝑥⦌𝐵 ∈ 𝑉))
23	21, 22	sbiev 2347	. . 3 ⊢ ([𝑖 / 𝑥]𝐵 ∈ 𝑉 ↔ ⦋𝑖 / 𝑥⦌𝐵 ∈ 𝑉)
24	12, 19, 23	3imtr3i 293	. 2 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝐴) → ⦋𝑖 / 𝑥⦌𝐵 ∈ 𝑉)
25		csbeq1 3856	. 2 ⊢ (𝑖 = 𝑗 → ⦋𝑖 / 𝑥⦌𝐵 = ⦋𝑗 / 𝑥⦌𝐵)
26	1, 2, 3, 10, 24, 25	funcnv5mpt 32875	1 ⊢ (𝜑 → (Fun ◡𝐹 ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐴 (𝑖 = 𝑗 ∨ ⦋𝑖 / 𝑥⦌𝐵 ≠ ⦋𝑗 / 𝑥⦌𝐵)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   ∨ wo 858   = wceq 1561  Ⅎwnf 1804  [wsb 2091   ∈ wcel 2143  Ⅎwnfc 2910   ≠ wne 2958  ∀wral 3077  ⦋csb 3853   ↦ cmpt 5182  ^◡ccnv 5647  Fun wfun 6515

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5247  ax-nul 5257  ax-pr 5391

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-nf 1805  df-sb 2092  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3078  df-rex 3088  df-rmo 3368  df-rab 3416  df-v 3457  df-sbc 3746  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5102  df-opab 5164  df-mpt 5183  df-id 5543  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-iota 6477  df-fun 6523  df-fn 6524  df-fv 6529

This theorem is referenced by:  disjdsct  32911