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

Theorem acneq 7352
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 2272 . . . 4 (𝐴 = 𝐶 → (𝐴 ∈ V ↔ 𝐶 ∈ V))
2 oveq2 5982 . . . . 5 (𝐴 = 𝐶 → ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴) = ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶))
3 raleq 2708 . . . . . 6 (𝐴 = 𝐶 → (∀𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦) ↔ ∀𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦)))
43exbidv 1851 . . . . 5 (𝐴 = 𝐶 → (∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦) ↔ ∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦)))
52, 4raleqbidv 2724 . . . 4 (𝐴 = 𝐶 → (∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦) ↔ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦)))
61, 5anbi12d 473 . . 3 (𝐴 = 𝐶 → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦)) ↔ (𝐶 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦))))
76abbidv 2327 . 2 (𝐴 = 𝐶 → {𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦))} = {𝑥 ∣ (𝐶 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦))})
8 df-acnm 7320 . 2 AC 𝐴 = {𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐴)∃𝑔𝑦𝐴 (𝑔𝑦) ∈ (𝑓𝑦))}
9 df-acnm 7320 . 2 AC 𝐶 = {𝑥 ∣ (𝐶 ∈ V ∧ ∀𝑓 ∈ ({𝑧 ∈ 𝒫 𝑥 ∣ ∃𝑗 𝑗𝑧} ↑𝑚 𝐶)∃𝑔𝑦𝐶 (𝑔𝑦) ∈ (𝑓𝑦))}
107, 8, 93eqtr4g 2267 1 (𝐴 = 𝐶AC 𝐴 = AC 𝐶)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1375  wex 1518  wcel 2180  {cab 2195  wral 2488  {crab 2492  Vcvv 2779  𝒫 cpw 3629  cfv 5294  (class class class)co 5974  𝑚 cmap 6765  AC wacn 7318
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 713  ax-5 1473  ax-7 1474  ax-gen 1475  ax-ie1 1519  ax-ie2 1520  ax-8 1530  ax-10 1531  ax-11 1532  ax-i12 1533  ax-bndl 1535  ax-4 1536  ax-17 1552  ax-i9 1556  ax-ial 1560  ax-i5r 1561  ax-ext 2191
This theorem depends on definitions:  df-bi 117  df-3an 985  df-tru 1378  df-nf 1487  df-sb 1789  df-clab 2196  df-cleq 2202  df-clel 2205  df-nfc 2341  df-ral 2493  df-rex 2494  df-v 2781  df-un 3181  df-sn 3652  df-pr 3653  df-op 3655  df-uni 3868  df-br 4063  df-iota 5254  df-fv 5302  df-ov 5977  df-acnm 7320
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator