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

Theorem cff1 10180
Description: There is always a map from (cf‘𝐴) to 𝐴 (this is a stronger condition than the definition, which only presupposes a map from some 𝑦 ≈ (cf‘𝐴). (Contributed by Mario Carneiro, 28-Feb-2013.)
Assertion
Ref Expression
cff1 (𝐴 ∈ On → ∃𝑓(𝑓:(cf‘𝐴)–1-1𝐴 ∧ ∀𝑧𝐴𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤)))
Distinct variable group:   𝐴,𝑓,𝑤,𝑧

Proof of Theorem cff1
Dummy variables 𝑠 𝑦 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cfval 10169 . . . 4 (𝐴 ∈ On → (cf‘𝐴) = {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠))})
2 cardon 9868 . . . . . . . . 9 (card‘𝑦) ∈ On
3 eleq1 2825 . . . . . . . . 9 (𝑥 = (card‘𝑦) → (𝑥 ∈ On ↔ (card‘𝑦) ∈ On))
42, 3mpbiri 258 . . . . . . . 8 (𝑥 = (card‘𝑦) → 𝑥 ∈ On)
54adantr 480 . . . . . . 7 ((𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)) → 𝑥 ∈ On)
65exlimiv 1932 . . . . . 6 (∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)) → 𝑥 ∈ On)
76abssi 4022 . . . . 5 {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠))} ⊆ On
8 cflem 10167 . . . . . 6 (𝐴 ∈ On → ∃𝑥𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)))
9 abn0 4339 . . . . . 6 ({𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠))} ≠ ∅ ↔ ∃𝑥𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)))
108, 9sylibr 234 . . . . 5 (𝐴 ∈ On → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠))} ≠ ∅)
11 onint 7745 . . . . 5 (({𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠))} ⊆ On ∧ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠))} ≠ ∅) → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠))} ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠))})
127, 10, 11sylancr 588 . . . 4 (𝐴 ∈ On → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠))} ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠))})
131, 12eqeltrd 2837 . . 3 (𝐴 ∈ On → (cf‘𝐴) ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠))})
14 fvex 6855 . . . 4 (cf‘𝐴) ∈ V
15 eqeq1 2741 . . . . . 6 (𝑥 = (cf‘𝐴) → (𝑥 = (card‘𝑦) ↔ (cf‘𝐴) = (card‘𝑦)))
1615anbi1d 632 . . . . 5 (𝑥 = (cf‘𝐴) → ((𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)) ↔ ((cf‘𝐴) = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠))))
1716exbidv 1923 . . . 4 (𝑥 = (cf‘𝐴) → (∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)) ↔ ∃𝑦((cf‘𝐴) = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠))))
1814, 17elab 3636 . . 3 ((cf‘𝐴) ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠))} ↔ ∃𝑦((cf‘𝐴) = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)))
1913, 18sylib 218 . 2 (𝐴 ∈ On → ∃𝑦((cf‘𝐴) = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)))
20 simplr 769 . . . . . 6 (((𝐴 ∈ On ∧ (cf‘𝐴) = (card‘𝑦)) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)) → (cf‘𝐴) = (card‘𝑦))
21 onss 7740 . . . . . . . . 9 (𝐴 ∈ On → 𝐴 ⊆ On)
22 sstr 3944 . . . . . . . . 9 ((𝑦𝐴𝐴 ⊆ On) → 𝑦 ⊆ On)
2321, 22sylan2 594 . . . . . . . 8 ((𝑦𝐴𝐴 ∈ On) → 𝑦 ⊆ On)
2423ancoms 458 . . . . . . 7 ((𝐴 ∈ On ∧ 𝑦𝐴) → 𝑦 ⊆ On)
2524ad2ant2r 748 . . . . . 6 (((𝐴 ∈ On ∧ (cf‘𝐴) = (card‘𝑦)) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)) → 𝑦 ⊆ On)
26 vex 3446 . . . . . . . . . . 11 𝑦 ∈ V
27 onssnum 9962 . . . . . . . . . . 11 ((𝑦 ∈ V ∧ 𝑦 ⊆ On) → 𝑦 ∈ dom card)
2826, 27mpan 691 . . . . . . . . . 10 (𝑦 ⊆ On → 𝑦 ∈ dom card)
29 cardid2 9877 . . . . . . . . . 10 (𝑦 ∈ dom card → (card‘𝑦) ≈ 𝑦)
3028, 29syl 17 . . . . . . . . 9 (𝑦 ⊆ On → (card‘𝑦) ≈ 𝑦)
3130adantl 481 . . . . . . . 8 (((cf‘𝐴) = (card‘𝑦) ∧ 𝑦 ⊆ On) → (card‘𝑦) ≈ 𝑦)
32 breq1 5103 . . . . . . . . 9 ((cf‘𝐴) = (card‘𝑦) → ((cf‘𝐴) ≈ 𝑦 ↔ (card‘𝑦) ≈ 𝑦))
3332adantr 480 . . . . . . . 8 (((cf‘𝐴) = (card‘𝑦) ∧ 𝑦 ⊆ On) → ((cf‘𝐴) ≈ 𝑦 ↔ (card‘𝑦) ≈ 𝑦))
3431, 33mpbird 257 . . . . . . 7 (((cf‘𝐴) = (card‘𝑦) ∧ 𝑦 ⊆ On) → (cf‘𝐴) ≈ 𝑦)
35 bren 8905 . . . . . . 7 ((cf‘𝐴) ≈ 𝑦 ↔ ∃𝑓 𝑓:(cf‘𝐴)–1-1-onto𝑦)
3634, 35sylib 218 . . . . . 6 (((cf‘𝐴) = (card‘𝑦) ∧ 𝑦 ⊆ On) → ∃𝑓 𝑓:(cf‘𝐴)–1-1-onto𝑦)
3720, 25, 36syl2anc 585 . . . . 5 (((𝐴 ∈ On ∧ (cf‘𝐴) = (card‘𝑦)) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)) → ∃𝑓 𝑓:(cf‘𝐴)–1-1-onto𝑦)
38 f1of1 6781 . . . . . . . . . . 11 (𝑓:(cf‘𝐴)–1-1-onto𝑦𝑓:(cf‘𝐴)–1-1𝑦)
39 f1ss 6743 . . . . . . . . . . . 12 ((𝑓:(cf‘𝐴)–1-1𝑦𝑦𝐴) → 𝑓:(cf‘𝐴)–1-1𝐴)
4039ancoms 458 . . . . . . . . . . 11 ((𝑦𝐴𝑓:(cf‘𝐴)–1-1𝑦) → 𝑓:(cf‘𝐴)–1-1𝐴)
4138, 40sylan2 594 . . . . . . . . . 10 ((𝑦𝐴𝑓:(cf‘𝐴)–1-1-onto𝑦) → 𝑓:(cf‘𝐴)–1-1𝐴)
4241adantlr 716 . . . . . . . . 9 (((𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠) ∧ 𝑓:(cf‘𝐴)–1-1-onto𝑦) → 𝑓:(cf‘𝐴)–1-1𝐴)
43423adant1 1131 . . . . . . . 8 (((𝐴 ∈ On ∧ (cf‘𝐴) = (card‘𝑦)) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠) ∧ 𝑓:(cf‘𝐴)–1-1-onto𝑦) → 𝑓:(cf‘𝐴)–1-1𝐴)
44 f1ofo 6789 . . . . . . . . . . . 12 (𝑓:(cf‘𝐴)–1-1-onto𝑦𝑓:(cf‘𝐴)–onto𝑦)
45 foelrn 7061 . . . . . . . . . . . . . . 15 ((𝑓:(cf‘𝐴)–onto𝑦𝑠𝑦) → ∃𝑤 ∈ (cf‘𝐴)𝑠 = (𝑓𝑤))
46 sseq2 3962 . . . . . . . . . . . . . . . . 17 (𝑠 = (𝑓𝑤) → (𝑧𝑠𝑧 ⊆ (𝑓𝑤)))
4746biimpcd 249 . . . . . . . . . . . . . . . 16 (𝑧𝑠 → (𝑠 = (𝑓𝑤) → 𝑧 ⊆ (𝑓𝑤)))
4847reximdv 3153 . . . . . . . . . . . . . . 15 (𝑧𝑠 → (∃𝑤 ∈ (cf‘𝐴)𝑠 = (𝑓𝑤) → ∃𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤)))
4945, 48syl5com 31 . . . . . . . . . . . . . 14 ((𝑓:(cf‘𝐴)–onto𝑦𝑠𝑦) → (𝑧𝑠 → ∃𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤)))
5049rexlimdva 3139 . . . . . . . . . . . . 13 (𝑓:(cf‘𝐴)–onto𝑦 → (∃𝑠𝑦 𝑧𝑠 → ∃𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤)))
5150ralimdv 3152 . . . . . . . . . . . 12 (𝑓:(cf‘𝐴)–onto𝑦 → (∀𝑧𝐴𝑠𝑦 𝑧𝑠 → ∀𝑧𝐴𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤)))
5244, 51syl 17 . . . . . . . . . . 11 (𝑓:(cf‘𝐴)–1-1-onto𝑦 → (∀𝑧𝐴𝑠𝑦 𝑧𝑠 → ∀𝑧𝐴𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤)))
5352impcom 407 . . . . . . . . . 10 ((∀𝑧𝐴𝑠𝑦 𝑧𝑠𝑓:(cf‘𝐴)–1-1-onto𝑦) → ∀𝑧𝐴𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤))
5453adantll 715 . . . . . . . . 9 (((𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠) ∧ 𝑓:(cf‘𝐴)–1-1-onto𝑦) → ∀𝑧𝐴𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤))
55543adant1 1131 . . . . . . . 8 (((𝐴 ∈ On ∧ (cf‘𝐴) = (card‘𝑦)) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠) ∧ 𝑓:(cf‘𝐴)–1-1-onto𝑦) → ∀𝑧𝐴𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤))
5643, 55jca 511 . . . . . . 7 (((𝐴 ∈ On ∧ (cf‘𝐴) = (card‘𝑦)) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠) ∧ 𝑓:(cf‘𝐴)–1-1-onto𝑦) → (𝑓:(cf‘𝐴)–1-1𝐴 ∧ ∀𝑧𝐴𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤)))
57563expia 1122 . . . . . 6 (((𝐴 ∈ On ∧ (cf‘𝐴) = (card‘𝑦)) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)) → (𝑓:(cf‘𝐴)–1-1-onto𝑦 → (𝑓:(cf‘𝐴)–1-1𝐴 ∧ ∀𝑧𝐴𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤))))
5857eximdv 1919 . . . . 5 (((𝐴 ∈ On ∧ (cf‘𝐴) = (card‘𝑦)) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)) → (∃𝑓 𝑓:(cf‘𝐴)–1-1-onto𝑦 → ∃𝑓(𝑓:(cf‘𝐴)–1-1𝐴 ∧ ∀𝑧𝐴𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤))))
5937, 58mpd 15 . . . 4 (((𝐴 ∈ On ∧ (cf‘𝐴) = (card‘𝑦)) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)) → ∃𝑓(𝑓:(cf‘𝐴)–1-1𝐴 ∧ ∀𝑧𝐴𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤)))
6059expl 457 . . 3 (𝐴 ∈ On → (((cf‘𝐴) = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)) → ∃𝑓(𝑓:(cf‘𝐴)–1-1𝐴 ∧ ∀𝑧𝐴𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤))))
6160exlimdv 1935 . 2 (𝐴 ∈ On → (∃𝑦((cf‘𝐴) = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑠𝑦 𝑧𝑠)) → ∃𝑓(𝑓:(cf‘𝐴)–1-1𝐴 ∧ ∀𝑧𝐴𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤))))
6219, 61mpd 15 1 (𝐴 ∈ On → ∃𝑓(𝑓:(cf‘𝐴)–1-1𝐴 ∧ ∀𝑧𝐴𝑤 ∈ (cf‘𝐴)𝑧 ⊆ (𝑓𝑤)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wex 1781  wcel 2114  {cab 2715  wne 2933  wral 3052  wrex 3062  Vcvv 3442  wss 3903  c0 4287   cint 4904   class class class wbr 5100  dom cdm 5632  Oncon0 6325  1-1wf1 6497  ontowfo 6498  1-1-ontowf1o 6499  cfv 6500  cen 8892  cardccrd 9859  cfccf 9861
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-se 5586  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-isom 6509  df-riota 7325  df-ov 7371  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-er 8645  df-en 8896  df-dom 8897  df-card 9863  df-cf 9865
This theorem is referenced by:  cfsmolem  10192  cfcoflem  10194  cfcof  10196  alephreg  10505
  Copyright terms: Public domain W3C validator