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

Theorem dfac8alem 8890
Description: Lemma for dfac8a 8891. If the power set of a set has a choice function, then the set is numerable. (Contributed by NM, 10-Feb-1997.) (Revised by Mario Carneiro, 5-Jan-2013.)
Hypotheses
Ref Expression
dfac8alem.2 𝐹 = recs(𝐺)
dfac8alem.3 𝐺 = (𝑓 ∈ V ↦ (𝑔‘(𝐴 ∖ ran 𝑓)))
Assertion
Ref Expression
dfac8alem (𝐴𝐶 → (∃𝑔𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) → 𝐴 ∈ dom card))
Distinct variable groups:   𝑓,𝑔,𝑦,𝐴   𝐶,𝑔   𝑓,𝐹,𝑦
Allowed substitution hints:   𝐶(𝑦,𝑓)   𝐹(𝑔)   𝐺(𝑦,𝑓,𝑔)

Proof of Theorem dfac8alem
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elex 3243 . . 3 (𝐴𝐶𝐴 ∈ V)
2 difss 3770 . . . . . . . . . . . 12 (𝐴 ∖ (𝐹𝑥)) ⊆ 𝐴
3 elpw2g 4857 . . . . . . . . . . . 12 (𝐴 ∈ V → ((𝐴 ∖ (𝐹𝑥)) ∈ 𝒫 𝐴 ↔ (𝐴 ∖ (𝐹𝑥)) ⊆ 𝐴))
42, 3mpbiri 248 . . . . . . . . . . 11 (𝐴 ∈ V → (𝐴 ∖ (𝐹𝑥)) ∈ 𝒫 𝐴)
5 neeq1 2885 . . . . . . . . . . . . 13 (𝑦 = (𝐴 ∖ (𝐹𝑥)) → (𝑦 ≠ ∅ ↔ (𝐴 ∖ (𝐹𝑥)) ≠ ∅))
6 fveq2 6229 . . . . . . . . . . . . . 14 (𝑦 = (𝐴 ∖ (𝐹𝑥)) → (𝑔𝑦) = (𝑔‘(𝐴 ∖ (𝐹𝑥))))
7 id 22 . . . . . . . . . . . . . 14 (𝑦 = (𝐴 ∖ (𝐹𝑥)) → 𝑦 = (𝐴 ∖ (𝐹𝑥)))
86, 7eleq12d 2724 . . . . . . . . . . . . 13 (𝑦 = (𝐴 ∖ (𝐹𝑥)) → ((𝑔𝑦) ∈ 𝑦 ↔ (𝑔‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥))))
95, 8imbi12d 333 . . . . . . . . . . . 12 (𝑦 = (𝐴 ∖ (𝐹𝑥)) → ((𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ↔ ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝑔‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥)))))
109rspcv 3336 . . . . . . . . . . 11 ((𝐴 ∖ (𝐹𝑥)) ∈ 𝒫 𝐴 → (∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) → ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝑔‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥)))))
114, 10syl 17 . . . . . . . . . 10 (𝐴 ∈ V → (∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) → ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝑔‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥)))))
12113imp 1275 . . . . . . . . 9 ((𝐴 ∈ V ∧ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ (𝐴 ∖ (𝐹𝑥)) ≠ ∅) → (𝑔‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥)))
13 dfac8alem.2 . . . . . . . . . . . 12 𝐹 = recs(𝐺)
1413tfr2 7539 . . . . . . . . . . 11 (𝑥 ∈ On → (𝐹𝑥) = (𝐺‘(𝐹𝑥)))
1513tfr1 7538 . . . . . . . . . . . . . 14 𝐹 Fn On
16 fnfun 6026 . . . . . . . . . . . . . 14 (𝐹 Fn On → Fun 𝐹)
1715, 16ax-mp 5 . . . . . . . . . . . . 13 Fun 𝐹
18 vex 3234 . . . . . . . . . . . . 13 𝑥 ∈ V
19 resfunexg 6520 . . . . . . . . . . . . 13 ((Fun 𝐹𝑥 ∈ V) → (𝐹𝑥) ∈ V)
2017, 18, 19mp2an 708 . . . . . . . . . . . 12 (𝐹𝑥) ∈ V
21 rneq 5383 . . . . . . . . . . . . . . . 16 (𝑓 = (𝐹𝑥) → ran 𝑓 = ran (𝐹𝑥))
22 df-ima 5156 . . . . . . . . . . . . . . . 16 (𝐹𝑥) = ran (𝐹𝑥)
2321, 22syl6eqr 2703 . . . . . . . . . . . . . . 15 (𝑓 = (𝐹𝑥) → ran 𝑓 = (𝐹𝑥))
2423difeq2d 3761 . . . . . . . . . . . . . 14 (𝑓 = (𝐹𝑥) → (𝐴 ∖ ran 𝑓) = (𝐴 ∖ (𝐹𝑥)))
2524fveq2d 6233 . . . . . . . . . . . . 13 (𝑓 = (𝐹𝑥) → (𝑔‘(𝐴 ∖ ran 𝑓)) = (𝑔‘(𝐴 ∖ (𝐹𝑥))))
26 dfac8alem.3 . . . . . . . . . . . . 13 𝐺 = (𝑓 ∈ V ↦ (𝑔‘(𝐴 ∖ ran 𝑓)))
27 fvex 6239 . . . . . . . . . . . . 13 (𝑔‘(𝐴 ∖ (𝐹𝑥))) ∈ V
2825, 26, 27fvmpt 6321 . . . . . . . . . . . 12 ((𝐹𝑥) ∈ V → (𝐺‘(𝐹𝑥)) = (𝑔‘(𝐴 ∖ (𝐹𝑥))))
2920, 28ax-mp 5 . . . . . . . . . . 11 (𝐺‘(𝐹𝑥)) = (𝑔‘(𝐴 ∖ (𝐹𝑥)))
3014, 29syl6eq 2701 . . . . . . . . . 10 (𝑥 ∈ On → (𝐹𝑥) = (𝑔‘(𝐴 ∖ (𝐹𝑥))))
3130eleq1d 2715 . . . . . . . . 9 (𝑥 ∈ On → ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) ↔ (𝑔‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥))))
3212, 31syl5ibrcom 237 . . . . . . . 8 ((𝐴 ∈ V ∧ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ (𝐴 ∖ (𝐹𝑥)) ≠ ∅) → (𝑥 ∈ On → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))))
33323expia 1286 . . . . . . 7 ((𝐴 ∈ V ∧ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦)) → ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝑥 ∈ On → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)))))
3433com23 86 . . . . . 6 ((𝐴 ∈ V ∧ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦)) → (𝑥 ∈ On → ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)))))
3534ralrimiv 2994 . . . . 5 ((𝐴 ∈ V ∧ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦)) → ∀𝑥 ∈ On ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))))
3635ex 449 . . . 4 (𝐴 ∈ V → (∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) → ∀𝑥 ∈ On ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)))))
3715tz7.49c 7586 . . . . . 6 ((𝐴 ∈ V ∧ ∀𝑥 ∈ On ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)))) → ∃𝑥 ∈ On (𝐹𝑥):𝑥1-1-onto𝐴)
3837ex 449 . . . . 5 (𝐴 ∈ V → (∀𝑥 ∈ On ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → ∃𝑥 ∈ On (𝐹𝑥):𝑥1-1-onto𝐴))
3918f1oen 8018 . . . . . . 7 ((𝐹𝑥):𝑥1-1-onto𝐴𝑥𝐴)
40 isnumi 8810 . . . . . . 7 ((𝑥 ∈ On ∧ 𝑥𝐴) → 𝐴 ∈ dom card)
4139, 40sylan2 490 . . . . . 6 ((𝑥 ∈ On ∧ (𝐹𝑥):𝑥1-1-onto𝐴) → 𝐴 ∈ dom card)
4241rexlimiva 3057 . . . . 5 (∃𝑥 ∈ On (𝐹𝑥):𝑥1-1-onto𝐴𝐴 ∈ dom card)
4338, 42syl6 35 . . . 4 (𝐴 ∈ V → (∀𝑥 ∈ On ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → 𝐴 ∈ dom card))
4436, 43syld 47 . . 3 (𝐴 ∈ V → (∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) → 𝐴 ∈ dom card))
451, 44syl 17 . 2 (𝐴𝐶 → (∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) → 𝐴 ∈ dom card))
4645exlimdv 1901 1 (𝐴𝐶 → (∃𝑔𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) → 𝐴 ∈ dom card))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  w3a 1054   = wceq 1523  wex 1744  wcel 2030  wne 2823  wral 2941  wrex 2942  Vcvv 3231  cdif 3604  wss 3607  c0 3948  𝒫 cpw 4191   class class class wbr 4685  cmpt 4762  dom cdm 5143  ran crn 5144  cres 5145  cima 5146  Oncon0 5761  Fun wfun 5920   Fn wfn 5921  1-1-ontowf1o 5925  cfv 5926  recscrecs 7512  cen 7994  cardccrd 8799
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-reu 2948  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-wrecs 7452  df-recs 7513  df-en 7998  df-card 8803
This theorem is referenced by:  dfac8a  8891
  Copyright terms: Public domain W3C validator