MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isacn Structured version   Visualization version   GIF version

Theorem isacn 10127
Description: The property of being a choice set of length 𝐴. (Contributed by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
isacn ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑋 ∈ AC 𝐴 ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)))
Distinct variable groups:   𝑓,𝑔,𝑥,𝐴   𝑓,𝑋,𝑔,𝑥
Allowed substitution hints:   𝑉(𝑥, 𝑓, 𝑔)   𝑊(𝑥, 𝑓, 𝑔)

Proof of Theorem isacn
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 pweq 4570 . . . . . . 7 (𝑦 = 𝑋 → 𝒫 𝑦 = 𝒫 𝑋)
21difeq1d 4062 . . . . . 6 (𝑦 = 𝑋 → (𝒫 𝑦 ∖ {∅}) = (𝒫 𝑋 ∖ {∅}))
32oveq1d 7436 . . . . 5 (𝑦 = 𝑋 → ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴) = ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴))
43raleqdv 3319 . . . 4 (𝑦 = 𝑋 → (∀𝑓 ∈ ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥) ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)))
54anbi2d 642 . . 3 (𝑦 = 𝑋 → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))))
6 df-acn 10027 . . 3 AC 𝐴 = {𝑦 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))}
75, 6elab2g 3633 . 2 (𝑋 ∈ 𝑉 → (𝑋 ∈ AC 𝐴 ↔ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))))
8 elex 3471 . . 3 (𝐴 ∈ 𝑊 → 𝐴 ∈ V)
9 biid 264 . . . 4 ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)))
109baib 545 . . 3 (𝐴 ∈ V → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)))
118, 10syl 18 . 2 (𝐴 ∈ 𝑊 → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)))
127, 11sylan9bb 519 1 ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑋 ∈ AC 𝐴 ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∀wral 3076  Vcvv 3450   ∖ cdif 4045  ∅c0 4278  𝒫 cpw 4556  {csn 4584  ‘cfv 6539  (class class class)co 7421   ↑m cmap 8851  AC wacn 10023
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6494  df-fv 6547  df-ov 7424  df-acn 10027
This theorem is used by:  acni  10128  numacn  10132  finacn  10133  acndom  10134  acndom2  10137  acncc  10522
  Copyright terms: Public domain W3C validator