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

Theorem acneq 7417
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 2294 . . . 4 (𝐴 = 𝐶 → (𝐴 ∈ V ↔ 𝐶 ∈ V))
2 oveq2 6026 . . . . 5 (𝐴 = 𝐶 → ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴) = ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶))
3 raleq 2730 . . . . . 6 (𝐴 = 𝐶 → (∀𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦) ↔ ∀𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦)))
43exbidv 1873 . . . . 5 (𝐴 = 𝐶 → (∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦) ↔ ∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦)))
52, 4raleqbidv 2746 . . . 4 (𝐴 = 𝐶 → (∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦) ↔ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦)))
61, 5anbi12d 473 . . 3 (𝐴 = 𝐶 → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦)) ↔ (𝐶 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦))))
76abbidv 2349 . 2 (𝐴 = 𝐶 → {𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦))} = {𝑥 ∣ (𝐶 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦))})
8 df-acnm 7384 . 2 AC 𝐴 = {𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦))}
9 df-acnm 7384 . 2 AC 𝐶 = {𝑥 ∣ (𝐶 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦))}
107, 8, 93eqtr4g 2289 1 (𝐴 = 𝐶AC 𝐴 = AC 𝐶)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1397  wex 1540  wcel 2202  {cab 2217  wral 2510  {crab 2514  Vcvv 2802  𝒫 cpw 3652  cfv 5326  (class class class)co 6018  𝑚 cmap 6817  AC wacn 7382
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-iota 5286  df-fv 5334  df-ov 6021  df-acnm 7384
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator