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

Theorem caovcan 6038
Description: Convert an operation cancellation law to class notation. (Contributed by NM, 20-Aug-1995.)
Hypotheses
Ref Expression
caovcan.1 𝐶 ∈ V
caovcan.2 ((𝑥𝑆𝑦𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧))
Assertion
Ref Expression
caovcan ((𝐴𝑆𝐵𝑆) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) → 𝐵 = 𝐶))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧

Proof of Theorem caovcan
StepHypRef Expression
1 oveq1 5881 . . . 4 (𝑥 = 𝐴 → (𝑥𝐹𝑦) = (𝐴𝐹𝑦))
2 oveq1 5881 . . . 4 (𝑥 = 𝐴 → (𝑥𝐹𝐶) = (𝐴𝐹𝐶))
31, 2eqeq12d 2192 . . 3 (𝑥 = 𝐴 → ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) ↔ (𝐴𝐹𝑦) = (𝐴𝐹𝐶)))
43imbi1d 231 . 2 (𝑥 = 𝐴 → (((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶) ↔ ((𝐴𝐹𝑦) = (𝐴𝐹𝐶) → 𝑦 = 𝐶)))
5 oveq2 5882 . . . 4 (𝑦 = 𝐵 → (𝐴𝐹𝑦) = (𝐴𝐹𝐵))
65eqeq1d 2186 . . 3 (𝑦 = 𝐵 → ((𝐴𝐹𝑦) = (𝐴𝐹𝐶) ↔ (𝐴𝐹𝐵) = (𝐴𝐹𝐶)))
7 eqeq1 2184 . . 3 (𝑦 = 𝐵 → (𝑦 = 𝐶𝐵 = 𝐶))
86, 7imbi12d 234 . 2 (𝑦 = 𝐵 → (((𝐴𝐹𝑦) = (𝐴𝐹𝐶) → 𝑦 = 𝐶) ↔ ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) → 𝐵 = 𝐶)))
9 caovcan.1 . . 3 𝐶 ∈ V
10 oveq2 5882 . . . . . 6 (𝑧 = 𝐶 → (𝑥𝐹𝑧) = (𝑥𝐹𝐶))
1110eqeq2d 2189 . . . . 5 (𝑧 = 𝐶 → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ (𝑥𝐹𝑦) = (𝑥𝐹𝐶)))
12 eqeq2 2187 . . . . 5 (𝑧 = 𝐶 → (𝑦 = 𝑧𝑦 = 𝐶))
1311, 12imbi12d 234 . . . 4 (𝑧 = 𝐶 → (((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧) ↔ ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶)))
1413imbi2d 230 . . 3 (𝑧 = 𝐶 → (((𝑥𝑆𝑦𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧)) ↔ ((𝑥𝑆𝑦𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶))))
15 caovcan.2 . . 3 ((𝑥𝑆𝑦𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧))
169, 14, 15vtocl 2791 . 2 ((𝑥𝑆𝑦𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶))
174, 8, 16vtocl2ga 2805 1 ((𝐴𝑆𝐵𝑆) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) → 𝐵 = 𝐶))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1353  wcel 2148  Vcvv 2737  (class class class)co 5874
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-rex 2461  df-v 2739  df-un 3133  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-br 4004  df-iota 5178  df-fv 5224  df-ov 5877
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator