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

Theorem acneq 7321
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 2269 . . . 4 (𝐴 = 𝐶 → (𝐴 ∈ V ↔ 𝐶 ∈ V))
2 oveq2 5959 . . . . 5 (𝐴 = 𝐶 → ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴) = ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶))
3 raleq 2703 . . . . . 6 (𝐴 = 𝐶 → (∀𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦) ↔ ∀𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦)))
43exbidv 1849 . . . . 5 (𝐴 = 𝐶 → (∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦) ↔ ∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦)))
52, 4raleqbidv 2719 . . . 4 (𝐴 = 𝐶 → (∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦) ↔ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦)))
61, 5anbi12d 473 . . 3 (𝐴 = 𝐶 → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦)) ↔ (𝐶 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦))))
76abbidv 2324 . 2 (𝐴 = 𝐶 → {𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦))} = {𝑥 ∣ (𝐶 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦))})
8 df-acnm 7294 . 2 AC 𝐴 = {𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦))}
9 df-acnm 7294 . 2 AC 𝐶 = {𝑥 ∣ (𝐶 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦))}
107, 8, 93eqtr4g 2264 1 (𝐴 = 𝐶AC 𝐴 = AC 𝐶)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1373  wex 1516  wcel 2177  {cab 2192  wral 2485  {crab 2489  Vcvv 2773  𝒫 cpw 3617  cfv 5276  (class class class)co 5951  𝑚 cmap 6742  AC wacn 7292
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2188
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-v 2775  df-un 3171  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-br 4048  df-iota 5237  df-fv 5284  df-ov 5954  df-acnm 7294
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator