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

Theorem acneq 7285
Description: Equality theorem for the choice set function. (Contributed by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
acneq (𝐴 = 𝐶AC 𝐴 = AC 𝐶)

Proof of Theorem acneq
Dummy variables 𝑓 𝑔 𝑥 𝑦 𝑧 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1 2259 . . . 4 (𝐴 = 𝐶 → (𝐴 ∈ V ↔ 𝐶 ∈ V))
2 oveq2 5933 . . . . 5 (𝐴 = 𝐶 → ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴) = ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶))
3 raleq 2693 . . . . . 6 (𝐴 = 𝐶 → (∀𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦) ↔ ∀𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦)))
43exbidv 1839 . . . . 5 (𝐴 = 𝐶 → (∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦) ↔ ∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦)))
52, 4raleqbidv 2709 . . . 4 (𝐴 = 𝐶 → (∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦) ↔ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦)))
61, 5anbi12d 473 . . 3 (𝐴 = 𝐶 → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦)) ↔ (𝐶 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦))))
76abbidv 2314 . 2 (𝐴 = 𝐶 → {𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦))} = {𝑥 ∣ (𝐶 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦))})
8 df-acnm 7258 . 2 AC 𝐴 = {𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦))}
9 df-acnm 7258 . 2 AC 𝐶 = {𝑥 ∣ (𝐶 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦))}
107, 8, 93eqtr4g 2254 1 (𝐴 = 𝐶AC 𝐴 = AC 𝐶)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1364  wex 1506  wcel 2167  {cab 2182  wral 2475  {crab 2479  Vcvv 2763  𝒫 cpw 3606  cfv 5259  (class class class)co 5925  𝑚 cmap 6716  AC wacn 7256
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-iota 5220  df-fv 5267  df-ov 5928  df-acnm 7258
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator