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

Theorem eqfnfv3 5673
Description: Derive equality of functions from equality of their values. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
eqfnfv3 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → (𝐹 = 𝐺 ↔ (𝐵𝐴 ∧ ∀𝑥𝐴 (𝑥𝐵 ∧ (𝐹𝑥) = (𝐺𝑥)))))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝐺   𝑥,𝐵

Proof of Theorem eqfnfv3
StepHypRef Expression
1 eqfnfv2 5672 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → (𝐹 = 𝐺 ↔ (𝐴 = 𝐵 ∧ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥))))
2 eqss 3207 . . . . 5 (𝐴 = 𝐵 ↔ (𝐴𝐵𝐵𝐴))
3 ancom 266 . . . . 5 ((𝐴𝐵𝐵𝐴) ↔ (𝐵𝐴𝐴𝐵))
42, 3bitri 184 . . . 4 (𝐴 = 𝐵 ↔ (𝐵𝐴𝐴𝐵))
54anbi1i 458 . . 3 ((𝐴 = 𝐵 ∧ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)) ↔ ((𝐵𝐴𝐴𝐵) ∧ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)))
6 anass 401 . . . 4 (((𝐵𝐴𝐴𝐵) ∧ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)) ↔ (𝐵𝐴 ∧ (𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥))))
7 dfss3 3181 . . . . . . 7 (𝐴𝐵 ↔ ∀𝑥𝐴 𝑥𝐵)
87anbi1i 458 . . . . . 6 ((𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)) ↔ (∀𝑥𝐴 𝑥𝐵 ∧ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)))
9 r19.26 2631 . . . . . 6 (∀𝑥𝐴 (𝑥𝐵 ∧ (𝐹𝑥) = (𝐺𝑥)) ↔ (∀𝑥𝐴 𝑥𝐵 ∧ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)))
108, 9bitr4i 187 . . . . 5 ((𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)) ↔ ∀𝑥𝐴 (𝑥𝐵 ∧ (𝐹𝑥) = (𝐺𝑥)))
1110anbi2i 457 . . . 4 ((𝐵𝐴 ∧ (𝐴𝐵 ∧ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥))) ↔ (𝐵𝐴 ∧ ∀𝑥𝐴 (𝑥𝐵 ∧ (𝐹𝑥) = (𝐺𝑥))))
126, 11bitri 184 . . 3 (((𝐵𝐴𝐴𝐵) ∧ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)) ↔ (𝐵𝐴 ∧ ∀𝑥𝐴 (𝑥𝐵 ∧ (𝐹𝑥) = (𝐺𝑥))))
135, 12bitri 184 . 2 ((𝐴 = 𝐵 ∧ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)) ↔ (𝐵𝐴 ∧ ∀𝑥𝐴 (𝑥𝐵 ∧ (𝐹𝑥) = (𝐺𝑥))))
141, 13bitrdi 196 1 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → (𝐹 = 𝐺 ↔ (𝐵𝐴 ∧ ∀𝑥𝐴 (𝑥𝐵 ∧ (𝐹𝑥) = (𝐺𝑥)))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1372  wcel 2175  wral 2483  wss 3165   Fn wfn 5263  cfv 5268
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-v 2773  df-sbc 2998  df-csb 3093  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-mpt 4106  df-id 4338  df-xp 4679  df-rel 4680  df-cnv 4681  df-co 4682  df-dm 4683  df-iota 5229  df-fun 5270  df-fn 5271  df-fv 5276
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator