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

Theorem f1eqcocnv 6456
 Description: Condition for function equality in terms of vanishing of the composition with the inverse. (Contributed by Stefan O'Rear, 12-Feb-2015.)
Assertion
Ref Expression
f1eqcocnv ((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) → (𝐹 = 𝐺 ↔ (𝐹𝐺) = ( I ↾ 𝐴)))

Proof of Theorem f1eqcocnv
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 f1cocnv1 6079 . . . 4 (𝐹:𝐴1-1𝐵 → (𝐹𝐹) = ( I ↾ 𝐴))
2 coeq2 5202 . . . . 5 (𝐹 = 𝐺 → (𝐹𝐹) = (𝐹𝐺))
32eqeq1d 2612 . . . 4 (𝐹 = 𝐺 → ((𝐹𝐹) = ( I ↾ 𝐴) ↔ (𝐹𝐺) = ( I ↾ 𝐴)))
41, 3syl5ibcom 234 . . 3 (𝐹:𝐴1-1𝐵 → (𝐹 = 𝐺 → (𝐹𝐺) = ( I ↾ 𝐴)))
54adantr 480 . 2 ((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) → (𝐹 = 𝐺 → (𝐹𝐺) = ( I ↾ 𝐴)))
6 f1fn 6015 . . . . . . 7 (𝐺:𝐴1-1𝐵𝐺 Fn 𝐴)
76adantl 481 . . . . . 6 ((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) → 𝐺 Fn 𝐴)
87adantr 480 . . . . 5 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐴)) → 𝐺 Fn 𝐴)
9 f1fn 6015 . . . . . . 7 (𝐹:𝐴1-1𝐵𝐹 Fn 𝐴)
109adantr 480 . . . . . 6 ((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) → 𝐹 Fn 𝐴)
1110adantr 480 . . . . 5 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐴)) → 𝐹 Fn 𝐴)
12 equid 1926 . . . . . . . . . 10 𝑥 = 𝑥
13 resieq 5327 . . . . . . . . . 10 ((𝑥𝐴𝑥𝐴) → (𝑥( I ↾ 𝐴)𝑥𝑥 = 𝑥))
1412, 13mpbiri 247 . . . . . . . . 9 ((𝑥𝐴𝑥𝐴) → 𝑥( I ↾ 𝐴)𝑥)
1514anidms 675 . . . . . . . 8 (𝑥𝐴𝑥( I ↾ 𝐴)𝑥)
1615adantl 481 . . . . . . 7 ((((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐴)) ∧ 𝑥𝐴) → 𝑥( I ↾ 𝐴)𝑥)
17 breq 4585 . . . . . . . 8 ((𝐹𝐺) = ( I ↾ 𝐴) → (𝑥(𝐹𝐺)𝑥𝑥( I ↾ 𝐴)𝑥))
1817ad2antlr 759 . . . . . . 7 ((((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐴)) ∧ 𝑥𝐴) → (𝑥(𝐹𝐺)𝑥𝑥( I ↾ 𝐴)𝑥))
1916, 18mpbird 246 . . . . . 6 ((((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐴)) ∧ 𝑥𝐴) → 𝑥(𝐹𝐺)𝑥)
20 fnfun 5902 . . . . . . . . . . . . . . . 16 (𝐺 Fn 𝐴 → Fun 𝐺)
217, 20syl 17 . . . . . . . . . . . . . . 15 ((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) → Fun 𝐺)
2221adantr 480 . . . . . . . . . . . . . 14 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ 𝑥𝐴) → Fun 𝐺)
23 fndm 5904 . . . . . . . . . . . . . . . . 17 (𝐺 Fn 𝐴 → dom 𝐺 = 𝐴)
247, 23syl 17 . . . . . . . . . . . . . . . 16 ((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) → dom 𝐺 = 𝐴)
2524eleq2d 2673 . . . . . . . . . . . . . . 15 ((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) → (𝑥 ∈ dom 𝐺𝑥𝐴))
2625biimpar 501 . . . . . . . . . . . . . 14 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ 𝑥𝐴) → 𝑥 ∈ dom 𝐺)
27 funopfvb 6149 . . . . . . . . . . . . . 14 ((Fun 𝐺𝑥 ∈ dom 𝐺) → ((𝐺𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐺))
2822, 26, 27syl2anc 691 . . . . . . . . . . . . 13 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ 𝑥𝐴) → ((𝐺𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐺))
2928bicomd 212 . . . . . . . . . . . 12 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ 𝑥𝐴) → (⟨𝑥, 𝑦⟩ ∈ 𝐺 ↔ (𝐺𝑥) = 𝑦))
30 df-br 4584 . . . . . . . . . . . 12 (𝑥𝐺𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐺)
31 eqcom 2617 . . . . . . . . . . . 12 (𝑦 = (𝐺𝑥) ↔ (𝐺𝑥) = 𝑦)
3229, 30, 313bitr4g 302 . . . . . . . . . . 11 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ 𝑥𝐴) → (𝑥𝐺𝑦𝑦 = (𝐺𝑥)))
3332biimpd 218 . . . . . . . . . 10 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ 𝑥𝐴) → (𝑥𝐺𝑦𝑦 = (𝐺𝑥)))
34 fnfun 5902 . . . . . . . . . . . . . . . 16 (𝐹 Fn 𝐴 → Fun 𝐹)
3510, 34syl 17 . . . . . . . . . . . . . . 15 ((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) → Fun 𝐹)
3635adantr 480 . . . . . . . . . . . . . 14 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ 𝑥𝐴) → Fun 𝐹)
37 fndm 5904 . . . . . . . . . . . . . . . . 17 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
3810, 37syl 17 . . . . . . . . . . . . . . . 16 ((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) → dom 𝐹 = 𝐴)
3938eleq2d 2673 . . . . . . . . . . . . . . 15 ((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) → (𝑥 ∈ dom 𝐹𝑥𝐴))
4039biimpar 501 . . . . . . . . . . . . . 14 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ 𝑥𝐴) → 𝑥 ∈ dom 𝐹)
41 funopfvb 6149 . . . . . . . . . . . . . 14 ((Fun 𝐹𝑥 ∈ dom 𝐹) → ((𝐹𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
4236, 40, 41syl2anc 691 . . . . . . . . . . . . 13 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ 𝑥𝐴) → ((𝐹𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
43 df-br 4584 . . . . . . . . . . . . 13 (𝑥𝐹𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹)
4442, 43syl6rbbr 278 . . . . . . . . . . . 12 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ 𝑥𝐴) → (𝑥𝐹𝑦 ↔ (𝐹𝑥) = 𝑦))
45 vex 3176 . . . . . . . . . . . . 13 𝑦 ∈ V
46 vex 3176 . . . . . . . . . . . . 13 𝑥 ∈ V
4745, 46brcnv 5227 . . . . . . . . . . . 12 (𝑦𝐹𝑥𝑥𝐹𝑦)
48 eqcom 2617 . . . . . . . . . . . 12 (𝑦 = (𝐹𝑥) ↔ (𝐹𝑥) = 𝑦)
4944, 47, 483bitr4g 302 . . . . . . . . . . 11 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ 𝑥𝐴) → (𝑦𝐹𝑥𝑦 = (𝐹𝑥)))
5049biimpd 218 . . . . . . . . . 10 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ 𝑥𝐴) → (𝑦𝐹𝑥𝑦 = (𝐹𝑥)))
5133, 50anim12d 584 . . . . . . . . 9 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ 𝑥𝐴) → ((𝑥𝐺𝑦𝑦𝐹𝑥) → (𝑦 = (𝐺𝑥) ∧ 𝑦 = (𝐹𝑥))))
5251eximdv 1833 . . . . . . . 8 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ 𝑥𝐴) → (∃𝑦(𝑥𝐺𝑦𝑦𝐹𝑥) → ∃𝑦(𝑦 = (𝐺𝑥) ∧ 𝑦 = (𝐹𝑥))))
5346, 46brco 5214 . . . . . . . 8 (𝑥(𝐹𝐺)𝑥 ↔ ∃𝑦(𝑥𝐺𝑦𝑦𝐹𝑥))
54 fvex 6113 . . . . . . . . 9 (𝐺𝑥) ∈ V
5554eqvinc 3300 . . . . . . . 8 ((𝐺𝑥) = (𝐹𝑥) ↔ ∃𝑦(𝑦 = (𝐺𝑥) ∧ 𝑦 = (𝐹𝑥)))
5652, 53, 553imtr4g 284 . . . . . . 7 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ 𝑥𝐴) → (𝑥(𝐹𝐺)𝑥 → (𝐺𝑥) = (𝐹𝑥)))
5756adantlr 747 . . . . . 6 ((((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐴)) ∧ 𝑥𝐴) → (𝑥(𝐹𝐺)𝑥 → (𝐺𝑥) = (𝐹𝑥)))
5819, 57mpd 15 . . . . 5 ((((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐴)) ∧ 𝑥𝐴) → (𝐺𝑥) = (𝐹𝑥))
598, 11, 58eqfnfvd 6222 . . . 4 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐴)) → 𝐺 = 𝐹)
6059eqcomd 2616 . . 3 (((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐴)) → 𝐹 = 𝐺)
6160ex 449 . 2 ((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) → ((𝐹𝐺) = ( I ↾ 𝐴) → 𝐹 = 𝐺))
625, 61impbid 201 1 ((𝐹:𝐴1-1𝐵𝐺:𝐴1-1𝐵) → (𝐹 = 𝐺 ↔ (𝐹𝐺) = ( I ↾ 𝐴)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475  ∃wex 1695   ∈ wcel 1977  ⟨cop 4131   class class class wbr 4583   I cid 4948  ◡ccnv 5037  dom cdm 5038   ↾ cres 5040   ∘ ccom 5042  Fun wfun 5798   Fn wfn 5799  –1-1→wf1 5801  ‘cfv 5804 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812 This theorem is referenced by:  weisoeq  6505
 Copyright terms: Public domain W3C validator