Theorem mpteqb 5680

Description: Bidirectional equality theorem for a mapping abstraction. Equivalent to eqfnfv 5687. (Contributed by Mario Carneiro, 14-Nov-2014.)

Assertion

Ref	Expression
mpteqb	⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))

Distinct variable group:   𝑥,𝐴

Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥)   𝑉(𝑥)

Proof of Theorem mpteqb

Step	Hyp	Ref	Expression
1		elex 2785	. . 3 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ V)
2	1	ralimi 2570	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → ∀𝑥 ∈ 𝐴 𝐵 ∈ V)
3		fneq1 5368	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → ((𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 ↔ (𝑥 ∈ 𝐴 ↦ 𝐶) Fn 𝐴))
4		eqid 2206	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
5	4	mptfng 5408	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
6		eqid 2206	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐶) = (𝑥 ∈ 𝐴 ↦ 𝐶)
7	6	mptfng 5408	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ V ↔ (𝑥 ∈ 𝐴 ↦ 𝐶) Fn 𝐴)
8	3, 5, 7	3bitr4g 223	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ ∀𝑥 ∈ 𝐴 𝐶 ∈ V))
9	8	biimpd 144	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ∀𝑥 ∈ 𝐴 𝐶 ∈ V))
10		r19.26 2633	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 (𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ (∀𝑥 ∈ 𝐴 𝐵 ∈ V ∧ ∀𝑥 ∈ 𝐴 𝐶 ∈ V))
11		nfmpt1 4142	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵)
12		nfmpt1 4142	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐶)
13	11, 12	nfeq 2357	. . . . . . . . 9 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶)
14		simpll 527	. . . . . . . . . . . 12 ⊢ ((((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ∧ 𝑥 ∈ 𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶))
15	14	fveq1d 5588	. . . . . . . . . . 11 ⊢ ((((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ∧ 𝑥 ∈ 𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥))
16	4	fvmpt2 5673	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ V) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
17	16	ad2ant2lr 510	. . . . . . . . . . 11 ⊢ ((((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ∧ 𝑥 ∈ 𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
18	6	fvmpt2 5673	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ V) → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) = 𝐶)
19	18	ad2ant2l 508	. . . . . . . . . . 11 ⊢ ((((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ∧ 𝑥 ∈ 𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) = 𝐶)
20	15, 17, 19	3eqtr3d 2247	. . . . . . . . . 10 ⊢ ((((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ∧ 𝑥 ∈ 𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → 𝐵 = 𝐶)
21	20	exp31 364	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (𝑥 ∈ 𝐴 → ((𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐵 = 𝐶)))
22	13, 21	ralrimi 2578	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → ∀𝑥 ∈ 𝐴 ((𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐵 = 𝐶))
23		ralim 2566	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 ((𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐵 = 𝐶) → (∀𝑥 ∈ 𝐴 (𝐵 ∈ V ∧ 𝐶 ∈ V) → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
24	22, 23	syl 14	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (∀𝑥 ∈ 𝐴 (𝐵 ∈ V ∧ 𝐶 ∈ V) → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
25	10, 24	biimtrrid 153	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → ((∀𝑥 ∈ 𝐴 𝐵 ∈ V ∧ ∀𝑥 ∈ 𝐴 𝐶 ∈ V) → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
26	25	expd 258	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (∀𝑥 ∈ 𝐴 𝐵 ∈ V → (∀𝑥 ∈ 𝐴 𝐶 ∈ V → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶)))
27	9, 26	mpdd 41	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
28	27	com12 30	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
29		eqid 2206	. . . 4 ⊢ 𝐴 = 𝐴
30		mpteq12 4132	. . . 4 ⊢ ((𝐴 = 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝐵 = 𝐶) → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶))
31	29, 30	mpan 424	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶))
32	28, 31	impbid1 142	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
33	2, 32	syl 14	1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1373   ∈ wcel 2177  ∀wral 2485  Vcvv 2773   ↦ cmpt 4110   Fn wfn 5272  ‘cfv 5277

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2180  ax-ext 2188  ax-sep 4167  ax-pow 4223  ax-pr 4258

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-v 2775  df-sbc 3001  df-csb 3096  df-un 3172  df-in 3174  df-ss 3181  df-pw 3620  df-sn 3641  df-pr 3642  df-op 3644  df-uni 3854  df-br 4049  df-opab 4111  df-mpt 4112  df-id 4345  df-xp 4686  df-rel 4687  df-cnv 4688  df-co 4689  df-dm 4690  df-iota 5238  df-fun 5279  df-fn 5280  df-fv 5285

This theorem is referenced by:  eqfnfv  5687  eufnfv  5825  offveqb  6188  nninfinf  10601  psr1clfi  14500