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

Theorem acneq 7508
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 2295 . . . 4 (𝐴 = 𝐶 → (𝐴 ∈ V ↔ 𝐶 ∈ V))
2 oveq2 6057 . . . . 5 (𝐴 = 𝐶 → ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴) = ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶))
3 raleq 2740 . . . . . 6 (𝐴 = 𝐶 → (∀𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦) ↔ ∀𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦)))
43exbidv 1874 . . . . 5 (𝐴 = 𝐶 → (∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦) ↔ ∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦)))
52, 4raleqbidv 2756 . . . 4 (𝐴 = 𝐶 → (∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦) ↔ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦)))
61, 5anbi12d 473 . . 3 (𝐴 = 𝐶 → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦)) ↔ (𝐶 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦))))
76abbidv 2352 . 2 (𝐴 = 𝐶 → {𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦))} = {𝑥 ∣ (𝐶 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦))})
8 df-acnm 7475 . 2 AC 𝐴 = {𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦))}
9 df-acnm 7475 . 2 AC 𝐶 = {𝑥 ∣ (𝐶 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦))}
107, 8, 93eqtr4g 2290 1 (𝐴 = 𝐶AC 𝐴 = AC 𝐶)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wex 1541  wcel 2203  {cab 2218  wral 2520  {crab 2524  Vcvv 2812  𝒫 cpw 3668  cfv 5351  (class class class)co 6049  𝑚 cmap 6881  AC wacn 7473
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2814  df-un 3214  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-br 4109  df-iota 5311  df-fv 5359  df-ov 6052  df-acnm 7475
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator