MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mpteqb Structured version   Visualization version   GIF version

Theorem mpteqb 7005
Description: Bidirectional equality theorem for a mapping abstraction. Equivalent to eqfnfv 7021. (Contributed by Mario Carneiro, 14-Nov-2014.)
Assertion
Ref Expression
mpteqb (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥)   𝑉(𝑥)

Proof of Theorem mpteqb
StepHypRef Expression
1 elex 3472 . . 3 (𝐵 ∈ 𝑉 → 𝐵 ∈ V)
21ralimi 3100 . 2 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → ∀𝑥 ∈ 𝐴 𝐵 ∈ V)
3 fneq1 6622 . . . . . . 7 ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → ((𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 ↔ (𝑥 ∈ 𝐴 ↦ 𝐶) Fn 𝐴))
4 eqid 2761 . . . . . . . 8 (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
54mptfng 6670 . . . . . . 7 (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
6 eqid 2761 . . . . . . . 8 (𝑥 ∈ 𝐴 ↦ 𝐶) = (𝑥 ∈ 𝐴 ↦ 𝐶)
76mptfng 6670 . . . . . . 7 (∀𝑥 ∈ 𝐴 𝐶 ∈ V ↔ (𝑥 ∈ 𝐴 ↦ 𝐶) Fn 𝐴)
83, 5, 73bitr4g 317 . . . . . 6 ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ ∀𝑥 ∈ 𝐴 𝐶 ∈ V))
98biimpd 232 . . . . 5 ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ∀𝑥 ∈ 𝐴 𝐶 ∈ V))
10 r19.26 3123 . . . . . . 7 (∀𝑥 ∈ 𝐴 (𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ (∀𝑥 ∈ 𝐴 𝐵 ∈ V ∧ ∀𝑥 ∈ 𝐴 𝐶 ∈ V))
11 nfmpt1 5204 . . . . . . . . . 10 Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵)
12 nfmpt1 5204 . . . . . . . . . 10 Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐶)
1311, 12nfeq 2936 . . . . . . . . 9 Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶)
14 simpll 779 . . . . . . . . . . . 12 ((((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ∧ 𝑥 ∈ 𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶))
1514fveq1d 6879 . . . . . . . . . . 11 ((((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ∧ 𝑥 ∈ 𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥))
164fvmpt2 6997 . . . . . . . . . . . 12 ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ V) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
1716ad2ant2lr 761 . . . . . . . . . . 11 ((((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ∧ 𝑥 ∈ 𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
186fvmpt2 6997 . . . . . . . . . . . 12 ((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ V) → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) = 𝐶)
1918ad2ant2l 759 . . . . . . . . . . 11 ((((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ∧ 𝑥 ∈ 𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) = 𝐶)
2015, 17, 193eqtr3d 2804 . . . . . . . . . 10 ((((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ∧ 𝑥 ∈ 𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → 𝐵 = 𝐶)
2120exp31 425 . . . . . . . . 9 ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (𝑥 ∈ 𝐴 → ((𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐵 = 𝐶)))
2213, 21ralrimi 3261 . . . . . . . 8 ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → ∀𝑥 ∈ 𝐴 ((𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐵 = 𝐶))
23 ralim 3103 . . . . . . . 8 (∀𝑥 ∈ 𝐴 ((𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐵 = 𝐶) → (∀𝑥 ∈ 𝐴 (𝐵 ∈ V ∧ 𝐶 ∈ V) → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
2422, 23syl 18 . . . . . . 7 ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (∀𝑥 ∈ 𝐴 (𝐵 ∈ V ∧ 𝐶 ∈ V) → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
2510, 24biimtrrid 246 . . . . . 6 ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → ((∀𝑥 ∈ 𝐴 𝐵 ∈ V ∧ ∀𝑥 ∈ 𝐴 𝐶 ∈ V) → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
2625expd 421 . . . . 5 ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (∀𝑥 ∈ 𝐴 𝐵 ∈ V → (∀𝑥 ∈ 𝐴 𝐶 ∈ V → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶)))
279, 26mpdd 44 . . . 4 ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
2827com12 33 . . 3 (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
29 eqid 2761 . . . 4 𝐴 = 𝐴
30 mpteq12 5193 . . . 4 ((𝐴 = 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝐵 = 𝐶) → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶))
3129, 30mpan 703 . . 3 (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶))
3228, 31impbid1 228 . 2 (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
332, 32syl 18 1 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → ((𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝐵 = 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  Vcvv 3451   ↦ cmpt 5186   Fn wfn 6526  ‘cfv 6531
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-fv 6539
This theorem is used by:  eqfnfv  7021  eufnfv  7227  offveqb  7709  caofidlcan  7720  ramcl  17187  fucsect  18130  setcepi  18243  0frgp  19973  dprdf11  20219  dpjeq  20255  frgpcyg  21859  mvrf1  22273  mplmonmul  22325  matunitlindflem1  22974  ustuqtop  24545  mdegle0  26375  ply1nzb  26421  psrmonmul  34164  fedgmullem2  34244  cvmliftphtlem  36051  cfsetsnfsetf1  48073  1arymaptf1  49698
  Copyright terms: Public domain W3C validator