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

Theorem f1mpt 7257
Description: Express injection for a mapping operation. (Contributed by Mario Carneiro, 2-Jan-2017.)
Hypotheses
Ref Expression
f1mpt.1 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
f1mpt.2 (𝑥 = 𝑦 → 𝐶 = 𝐷)
Assertion
Ref Expression
f1mpt (𝐹:𝐴–1-1→𝐵 ↔ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑦,𝐶   𝑥,𝐷   𝑦,𝐹
Allowed substitution hints:   𝐶(𝑥)   𝐷(𝑦)   𝐹(𝑥)

Proof of Theorem f1mpt
StepHypRef Expression
1 f1mpt.1 . . . 4 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
2 nfmpt1 5204 . . . 4 Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐶)
31, 2nfcxfr 2921 . . 3 Ⅎ𝑥𝐹
4 nfcv 2923 . . 3 Ⅎ𝑦𝐹
53, 4dff13f 7251 . 2 (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
61fmpt 7102 . . 3 (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ↔ 𝐹:𝐴⟶𝐵)
76anbi1i 636 . 2 ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
8 f1mpt.2 . . . . . . 7 (𝑥 = 𝑦 → 𝐶 = 𝐷)
98eleq1d 2846 . . . . . 6 (𝑥 = 𝑦 → (𝐶 ∈ 𝐵 ↔ 𝐷 ∈ 𝐵))
109cbvralvw 3241 . . . . 5 (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝐷 ∈ 𝐵)
11 raaanv 4475 . . . . . 6 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) ↔ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐴 𝐷 ∈ 𝐵))
121fvmpt2 6997 . . . . . . . . . . . . . 14 ((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝑥) = 𝐶)
138, 1fvmptg 6983 . . . . . . . . . . . . . 14 ((𝑦 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (𝐹‘𝑦) = 𝐷)
1412, 13eqeqan12d 2775 . . . . . . . . . . . . 13 (((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)) → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ 𝐶 = 𝐷))
1514an4s 673 . . . . . . . . . . . 12 (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵)) → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ 𝐶 = 𝐷))
1615imbi1d 344 . . . . . . . . . . 11 (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵)) → (((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ (𝐶 = 𝐷 → 𝑥 = 𝑦)))
1716ex 418 . . . . . . . . . 10 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → ((𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) → (((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ (𝐶 = 𝐷 → 𝑥 = 𝑦))))
1817ralimdva 3175 . . . . . . . . 9 (𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 (𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) → ∀𝑦 ∈ 𝐴 (((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ (𝐶 = 𝐷 → 𝑥 = 𝑦))))
19 ralbi 3118 . . . . . . . . 9 (∀𝑦 ∈ 𝐴 (((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ (𝐶 = 𝐷 → 𝑥 = 𝑦)) → (∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
2018, 19syl6 36 . . . . . . . 8 (𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 (𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) → (∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦))))
2120ralimia 3097 . . . . . . 7 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) → ∀𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
22 ralbi 3118 . . . . . . 7 (∀𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
2321, 22syl 18 . . . . . 6 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
2411, 23sylbir 238 . . . . 5 ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐴 𝐷 ∈ 𝐵) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
2510, 24sylan2b 606 . . . 4 ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
2625anidms 577 . . 3 (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
2726pm5.32i 585 . 2 ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)) ↔ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
285, 7, 273bitr2i 302 1 (𝐹:𝐴–1-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   ↦ cmpt 5186  ⟶wf 6527  –1-1→wf1 6528  ‘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-f 6535  df-f1 6536  df-fv 6539
This theorem is used by:  ismon2  17889  isepi2  17896  chninf  18789  uspgredg2v  29787  usgredg2v  29790  aciunf1lem  33238  fnpreimac  33246  rlocf1  33817  zringfrac  34068  selvply1rhmlema  34132  selvply1rhmlem1  34134  ply1degltdimlem  34236  ply1degltdim  34237  assalactf1o  34249  mh-inf3sn  37300  disjf1  46141  upgrimtrls  48948
  Copyright terms: Public domain W3C validator