Theorem mpteqb 7016

Description: Bidirectional equality theorem for a mapping abstraction. Equivalent to eqfnfv 7032. (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 3479	. . 3 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ V)
2	1	ralimi 3105	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → ∀𝑥 ∈ 𝐴 𝐵 ∈ V)
3		fneq1 6633	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → ((𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 ↔ (𝑥 ∈ 𝐴 ↦ 𝐶) Fn 𝐴))
4		eqid 2766	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
5	4	mptfng 6681	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
6		eqid 2766	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐶) = (𝑥 ∈ 𝐴 ↦ 𝐶)
7	6	mptfng 6681	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ V ↔ (𝑥 ∈ 𝐴 ↦ 𝐶) Fn 𝐴)
8	3, 5, 7	3bitr4g 317	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ ∀𝑥 ∈ 𝐴 𝐶 ∈ V))
9	8	biimpd 232	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ∀𝑥 ∈ 𝐴 𝐶 ∈ V))
10		r19.26 3128	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 (𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ (∀𝑥 ∈ 𝐴 𝐵 ∈ V ∧ ∀𝑥 ∈ 𝐴 𝐶 ∈ V))
11		nfmpt1 5215	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵)
12		nfmpt1 5215	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐶)
13	11, 12	nfeq 2941	. . . . . . . . 9 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶)
14		simpll 779	. . . . . . . . . . . 12 ⊢ ((((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ∧ 𝑥 ∈ 𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶))
15	14	fveq1d 6890	. . . . . . . . . . 11 ⊢ ((((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ∧ 𝑥 ∈ 𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥))
16	4	fvmpt2 7008	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ V) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
17	16	ad2ant2lr 761	. . . . . . . . . . 11 ⊢ ((((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ∧ 𝑥 ∈ 𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
18	6	fvmpt2 7008	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ V) → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) = 𝐶)
19	18	ad2ant2l 759	. . . . . . . . . . 11 ⊢ ((((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ∧ 𝑥 ∈ 𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) = 𝐶)
20	15, 17, 19	3eqtr3d 2809	. . . . . . . . . 10 ⊢ ((((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ∧ 𝑥 ∈ 𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → 𝐵 = 𝐶)
21	20	exp31 425	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (𝑥 ∈ 𝐴 → ((𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐵 = 𝐶)))
22	13, 21	ralrimi 3266	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → ∀𝑥 ∈ 𝐴 ((𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐵 = 𝐶))
23		ralim 3108	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 ((𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐵 = 𝐶) → (∀𝑥 ∈ 𝐴 (𝐵 ∈ V ∧ 𝐶 ∈ V) → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
24	22, 23	syl 18	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (∀𝑥 ∈ 𝐴 (𝐵 ∈ V ∧ 𝐶 ∈ V) → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
25	10, 24	biimtrrid 246	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → ((∀𝑥 ∈ 𝐴 𝐵 ∈ V ∧ ∀𝑥 ∈ 𝐴 𝐶 ∈ V) → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
26	25	expd 421	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (∀𝑥 ∈ 𝐴 𝐵 ∈ V → (∀𝑥 ∈ 𝐴 𝐶 ∈ V → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶)))
27	9, 26	mpdd 44	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
28	27	com12 33	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
29		eqid 2766	. . . 4 ⊢ 𝐴 = 𝐴
30		mpteq12 5204	. . . 4 ⊢ ((𝐴 = 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝐵 = 𝐶) → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶))
31	29, 30	mpan 703	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶))
32	28, 31	impbid1 228	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
33	2, 32	syl 18	1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3082  Vcvv 3458   ↦ cmpt 5197   Fn wfn 6538  ‘cfv 6543

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-fv 6551

This theorem is used by:  eqfnfv  7032  eufnfv  7234  offveqb  7714  caofidlcan  7725  ramcl  17114  fucsect  18057  setcepi  18170  0frgp  19880  dprdf11  20126  dpjeq  20162  frgpcyg  21760  mvrf1  22172  mplmonmul  22224  ustuqtop  24440  mdegle0  26271  ply1nzb  26317  psrmonmul  33971  fedgmullem2  34051  cvmliftphtlem  35830  matunitlindflem1  38308  cfsetsnfsetf1  47837  1arymaptf1  49463