Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dnnumch1 Structured version   Visualization version   GIF version

Theorem dnnumch1 43001
Description: Define an enumeration of a set from a choice function; second part, it restricts to a bijection. EDITORIAL: overlaps dfac8a 10099. (Contributed by Stefan O'Rear, 18-Jan-2015.)
Hypotheses
Ref Expression
dnnumch.f 𝐹 = recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))
dnnumch.a (𝜑𝐴𝑉)
dnnumch.g (𝜑 → ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺𝑦) ∈ 𝑦))
Assertion
Ref Expression
dnnumch1 (𝜑 → ∃𝑥 ∈ On (𝐹𝑥):𝑥1-1-onto𝐴)
Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦,𝑧   𝑥,𝐴,𝑦,𝑧   𝜑,𝑥
Allowed substitution hints:   𝜑(𝑦,𝑧)   𝐹(𝑧)   𝑉(𝑥,𝑦,𝑧)

Proof of Theorem dnnumch1
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 dnnumch.a . 2 (𝜑𝐴𝑉)
2 recsval 8460 . . . . . . 7 (𝑥 ∈ On → (recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))‘𝑥) = ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥)))
3 dnnumch.f . . . . . . . 8 𝐹 = recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))
43fveq1i 6921 . . . . . . 7 (𝐹𝑥) = (recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))‘𝑥)
53tfr1 8453 . . . . . . . . . . 11 𝐹 Fn On
6 fnfun 6679 . . . . . . . . . . 11 (𝐹 Fn On → Fun 𝐹)
75, 6ax-mp 5 . . . . . . . . . 10 Fun 𝐹
8 vex 3492 . . . . . . . . . 10 𝑥 ∈ V
9 resfunexg 7252 . . . . . . . . . 10 ((Fun 𝐹𝑥 ∈ V) → (𝐹𝑥) ∈ V)
107, 8, 9mp2an 691 . . . . . . . . 9 (𝐹𝑥) ∈ V
11 rneq 5961 . . . . . . . . . . . . 13 (𝑤 = (𝐹𝑥) → ran 𝑤 = ran (𝐹𝑥))
12 df-ima 5713 . . . . . . . . . . . . 13 (𝐹𝑥) = ran (𝐹𝑥)
1311, 12eqtr4di 2798 . . . . . . . . . . . 12 (𝑤 = (𝐹𝑥) → ran 𝑤 = (𝐹𝑥))
1413difeq2d 4149 . . . . . . . . . . 11 (𝑤 = (𝐹𝑥) → (𝐴 ∖ ran 𝑤) = (𝐴 ∖ (𝐹𝑥)))
1514fveq2d 6924 . . . . . . . . . 10 (𝑤 = (𝐹𝑥) → (𝐺‘(𝐴 ∖ ran 𝑤)) = (𝐺‘(𝐴 ∖ (𝐹𝑥))))
16 rneq 5961 . . . . . . . . . . . . 13 (𝑧 = 𝑤 → ran 𝑧 = ran 𝑤)
1716difeq2d 4149 . . . . . . . . . . . 12 (𝑧 = 𝑤 → (𝐴 ∖ ran 𝑧) = (𝐴 ∖ ran 𝑤))
1817fveq2d 6924 . . . . . . . . . . 11 (𝑧 = 𝑤 → (𝐺‘(𝐴 ∖ ran 𝑧)) = (𝐺‘(𝐴 ∖ ran 𝑤)))
1918cbvmptv 5279 . . . . . . . . . 10 (𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))) = (𝑤 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑤)))
20 fvex 6933 . . . . . . . . . 10 (𝐺‘(𝐴 ∖ (𝐹𝑥))) ∈ V
2115, 19, 20fvmpt 7029 . . . . . . . . 9 ((𝐹𝑥) ∈ V → ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(𝐹𝑥)) = (𝐺‘(𝐴 ∖ (𝐹𝑥))))
2210, 21ax-mp 5 . . . . . . . 8 ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(𝐹𝑥)) = (𝐺‘(𝐴 ∖ (𝐹𝑥)))
233reseq1i 6005 . . . . . . . . 9 (𝐹𝑥) = (recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥)
2423fveq2i 6923 . . . . . . . 8 ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(𝐹𝑥)) = ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥))
2522, 24eqtr3i 2770 . . . . . . 7 (𝐺‘(𝐴 ∖ (𝐹𝑥))) = ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥))
262, 4, 253eqtr4g 2805 . . . . . 6 (𝑥 ∈ On → (𝐹𝑥) = (𝐺‘(𝐴 ∖ (𝐹𝑥))))
2726ad2antlr 726 . . . . 5 (((𝜑𝑥 ∈ On) ∧ (𝐴 ∖ (𝐹𝑥)) ≠ ∅) → (𝐹𝑥) = (𝐺‘(𝐴 ∖ (𝐹𝑥))))
28 difss 4159 . . . . . . . . 9 (𝐴 ∖ (𝐹𝑥)) ⊆ 𝐴
29 elpw2g 5351 . . . . . . . . . 10 (𝐴𝑉 → ((𝐴 ∖ (𝐹𝑥)) ∈ 𝒫 𝐴 ↔ (𝐴 ∖ (𝐹𝑥)) ⊆ 𝐴))
301, 29syl 17 . . . . . . . . 9 (𝜑 → ((𝐴 ∖ (𝐹𝑥)) ∈ 𝒫 𝐴 ↔ (𝐴 ∖ (𝐹𝑥)) ⊆ 𝐴))
3128, 30mpbiri 258 . . . . . . . 8 (𝜑 → (𝐴 ∖ (𝐹𝑥)) ∈ 𝒫 𝐴)
32 dnnumch.g . . . . . . . 8 (𝜑 → ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺𝑦) ∈ 𝑦))
33 neeq1 3009 . . . . . . . . . 10 (𝑦 = (𝐴 ∖ (𝐹𝑥)) → (𝑦 ≠ ∅ ↔ (𝐴 ∖ (𝐹𝑥)) ≠ ∅))
34 fveq2 6920 . . . . . . . . . . 11 (𝑦 = (𝐴 ∖ (𝐹𝑥)) → (𝐺𝑦) = (𝐺‘(𝐴 ∖ (𝐹𝑥))))
35 id 22 . . . . . . . . . . 11 (𝑦 = (𝐴 ∖ (𝐹𝑥)) → 𝑦 = (𝐴 ∖ (𝐹𝑥)))
3634, 35eleq12d 2838 . . . . . . . . . 10 (𝑦 = (𝐴 ∖ (𝐹𝑥)) → ((𝐺𝑦) ∈ 𝑦 ↔ (𝐺‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥))))
3733, 36imbi12d 344 . . . . . . . . 9 (𝑦 = (𝐴 ∖ (𝐹𝑥)) → ((𝑦 ≠ ∅ → (𝐺𝑦) ∈ 𝑦) ↔ ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥)))))
3837rspcva 3633 . . . . . . . 8 (((𝐴 ∖ (𝐹𝑥)) ∈ 𝒫 𝐴 ∧ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺𝑦) ∈ 𝑦)) → ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥))))
3931, 32, 38syl2anc 583 . . . . . . 7 (𝜑 → ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥))))
4039adantr 480 . . . . . 6 ((𝜑𝑥 ∈ On) → ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥))))
4140imp 406 . . . . 5 (((𝜑𝑥 ∈ On) ∧ (𝐴 ∖ (𝐹𝑥)) ≠ ∅) → (𝐺‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥)))
4227, 41eqeltrd 2844 . . . 4 (((𝜑𝑥 ∈ On) ∧ (𝐴 ∖ (𝐹𝑥)) ≠ ∅) → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)))
4342ex 412 . . 3 ((𝜑𝑥 ∈ On) → ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))))
4443ralrimiva 3152 . 2 (𝜑 → ∀𝑥 ∈ On ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))))
455tz7.49c 8502 . 2 ((𝐴𝑉 ∧ ∀𝑥 ∈ On ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)))) → ∃𝑥 ∈ On (𝐹𝑥):𝑥1-1-onto𝐴)
461, 44, 45syl2anc 583 1 (𝜑 → ∃𝑥 ∈ On (𝐹𝑥):𝑥1-1-onto𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2108  wne 2946  wral 3067  wrex 3076  Vcvv 3488  cdif 3973  wss 3976  c0 4352  𝒫 cpw 4622  cmpt 5249  ran crn 5701  cres 5702  cima 5703  Oncon0 6395  Fun wfun 6567   Fn wfn 6568  1-1-ontowf1o 6572  cfv 6573  recscrecs 8426
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-ov 7451  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427
This theorem is referenced by:  dnnumch2  43002
  Copyright terms: Public domain W3C validator