ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mpteqb GIF version

Theorem mpteqb 5282
Description: Bidirectional equality theorem for a mapping abstraction. Equivalent to eqfnfv 5286. (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 2610 . . 3 (𝐵𝑉𝐵 ∈ V)
21ralimi 2426 . 2 (∀𝑥𝐴 𝐵𝑉 → ∀𝑥𝐴 𝐵 ∈ V)
3 fneq1 5007 . . . . . . 7 ((𝑥𝐴𝐵) = (𝑥𝐴𝐶) → ((𝑥𝐴𝐵) Fn 𝐴 ↔ (𝑥𝐴𝐶) Fn 𝐴))
4 eqid 2081 . . . . . . . 8 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
54mptfng 5044 . . . . . . 7 (∀𝑥𝐴 𝐵 ∈ V ↔ (𝑥𝐴𝐵) Fn 𝐴)
6 eqid 2081 . . . . . . . 8 (𝑥𝐴𝐶) = (𝑥𝐴𝐶)
76mptfng 5044 . . . . . . 7 (∀𝑥𝐴 𝐶 ∈ V ↔ (𝑥𝐴𝐶) Fn 𝐴)
83, 5, 73bitr4g 221 . . . . . 6 ((𝑥𝐴𝐵) = (𝑥𝐴𝐶) → (∀𝑥𝐴 𝐵 ∈ V ↔ ∀𝑥𝐴 𝐶 ∈ V))
98biimpd 142 . . . . 5 ((𝑥𝐴𝐵) = (𝑥𝐴𝐶) → (∀𝑥𝐴 𝐵 ∈ V → ∀𝑥𝐴 𝐶 ∈ V))
10 r19.26 2485 . . . . . . 7 (∀𝑥𝐴 (𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ (∀𝑥𝐴 𝐵 ∈ V ∧ ∀𝑥𝐴 𝐶 ∈ V))
11 nfmpt1 3871 . . . . . . . . . 10 𝑥(𝑥𝐴𝐵)
12 nfmpt1 3871 . . . . . . . . . 10 𝑥(𝑥𝐴𝐶)
1311, 12nfeq 2226 . . . . . . . . 9 𝑥(𝑥𝐴𝐵) = (𝑥𝐴𝐶)
14 simpll 495 . . . . . . . . . . . 12 ((((𝑥𝐴𝐵) = (𝑥𝐴𝐶) ∧ 𝑥𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → (𝑥𝐴𝐵) = (𝑥𝐴𝐶))
1514fveq1d 5200 . . . . . . . . . . 11 ((((𝑥𝐴𝐵) = (𝑥𝐴𝐶) ∧ 𝑥𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → ((𝑥𝐴𝐵)‘𝑥) = ((𝑥𝐴𝐶)‘𝑥))
164fvmpt2 5275 . . . . . . . . . . . 12 ((𝑥𝐴𝐵 ∈ V) → ((𝑥𝐴𝐵)‘𝑥) = 𝐵)
1716ad2ant2lr 493 . . . . . . . . . . 11 ((((𝑥𝐴𝐵) = (𝑥𝐴𝐶) ∧ 𝑥𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → ((𝑥𝐴𝐵)‘𝑥) = 𝐵)
186fvmpt2 5275 . . . . . . . . . . . 12 ((𝑥𝐴𝐶 ∈ V) → ((𝑥𝐴𝐶)‘𝑥) = 𝐶)
1918ad2ant2l 491 . . . . . . . . . . 11 ((((𝑥𝐴𝐵) = (𝑥𝐴𝐶) ∧ 𝑥𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → ((𝑥𝐴𝐶)‘𝑥) = 𝐶)
2015, 17, 193eqtr3d 2121 . . . . . . . . . 10 ((((𝑥𝐴𝐵) = (𝑥𝐴𝐶) ∧ 𝑥𝐴) ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → 𝐵 = 𝐶)
2120exp31 356 . . . . . . . . 9 ((𝑥𝐴𝐵) = (𝑥𝐴𝐶) → (𝑥𝐴 → ((𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐵 = 𝐶)))
2213, 21ralrimi 2432 . . . . . . . 8 ((𝑥𝐴𝐵) = (𝑥𝐴𝐶) → ∀𝑥𝐴 ((𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐵 = 𝐶))
23 ralim 2422 . . . . . . . 8 (∀𝑥𝐴 ((𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐵 = 𝐶) → (∀𝑥𝐴 (𝐵 ∈ V ∧ 𝐶 ∈ V) → ∀𝑥𝐴 𝐵 = 𝐶))
2422, 23syl 14 . . . . . . 7 ((𝑥𝐴𝐵) = (𝑥𝐴𝐶) → (∀𝑥𝐴 (𝐵 ∈ V ∧ 𝐶 ∈ V) → ∀𝑥𝐴 𝐵 = 𝐶))
2510, 24syl5bir 151 . . . . . 6 ((𝑥𝐴𝐵) = (𝑥𝐴𝐶) → ((∀𝑥𝐴 𝐵 ∈ V ∧ ∀𝑥𝐴 𝐶 ∈ V) → ∀𝑥𝐴 𝐵 = 𝐶))
2625expd 254 . . . . 5 ((𝑥𝐴𝐵) = (𝑥𝐴𝐶) → (∀𝑥𝐴 𝐵 ∈ V → (∀𝑥𝐴 𝐶 ∈ V → ∀𝑥𝐴 𝐵 = 𝐶)))
279, 26mpdd 40 . . . 4 ((𝑥𝐴𝐵) = (𝑥𝐴𝐶) → (∀𝑥𝐴 𝐵 ∈ V → ∀𝑥𝐴 𝐵 = 𝐶))
2827com12 30 . . 3 (∀𝑥𝐴 𝐵 ∈ V → ((𝑥𝐴𝐵) = (𝑥𝐴𝐶) → ∀𝑥𝐴 𝐵 = 𝐶))
29 eqid 2081 . . . 4 𝐴 = 𝐴
30 mpteq12 3861 . . . 4 ((𝐴 = 𝐴 ∧ ∀𝑥𝐴 𝐵 = 𝐶) → (𝑥𝐴𝐵) = (𝑥𝐴𝐶))
3129, 30mpan 414 . . 3 (∀𝑥𝐴 𝐵 = 𝐶 → (𝑥𝐴𝐵) = (𝑥𝐴𝐶))
3228, 31impbid1 140 . 2 (∀𝑥𝐴 𝐵 ∈ V → ((𝑥𝐴𝐵) = (𝑥𝐴𝐶) ↔ ∀𝑥𝐴 𝐵 = 𝐶))
332, 32syl 14 1 (∀𝑥𝐴 𝐵𝑉 → ((𝑥𝐴𝐵) = (𝑥𝐴𝐶) ↔ ∀𝑥𝐴 𝐵 = 𝐶))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103   = wceq 1284  wcel 1433  wral 2348  Vcvv 2601  cmpt 3839   Fn wfn 4917  cfv 4922
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-sbc 2816  df-csb 2909  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-iota 4887  df-fun 4924  df-fn 4925  df-fv 4930
This theorem is referenced by:  eqfnfv  5286  eufnfv  5410  offveqb  5750
  Copyright terms: Public domain W3C validator