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 43626
Description: Define an enumeration of a set from a choice function; second part, it restricts to a bijection. EDITORIAL: overlaps dfac8a 9988. (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 8377 . . . . . . 7 (𝑥 ∈ On → (recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))‘𝑥) = ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥)))
3 dnnumch.f . . . . . . . 8 𝐹 = recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))
43fveq1i 6870 . . . . . . 7 (𝐹𝑥) = (recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))‘𝑥)
53tfr1 8370 . . . . . . . . . . 11 𝐹 Fn On
6 fnfun 6623 . . . . . . . . . . 11 (𝐹 Fn On → Fun 𝐹)
75, 6ax-mp 5 . . . . . . . . . 10 Fun 𝐹
8 vex 3460 . . . . . . . . . 10 𝑥 ∈ V
9 resfunexg 7201 . . . . . . . . . 10 ((Fun 𝐹𝑥 ∈ V) → (𝐹𝑥) ∈ V)
107, 8, 9mp2an 702 . . . . . . . . 9 (𝐹𝑥) ∈ V
11 rneq 5914 . . . . . . . . . . . . 13 (𝑤 = (𝐹𝑥) → ran 𝑤 = ran (𝐹𝑥))
12 df-ima 5662 . . . . . . . . . . . . 13 (𝐹𝑥) = ran (𝐹𝑥)
1311, 12eqtr4di 2817 . . . . . . . . . . . 12 (𝑤 = (𝐹𝑥) → ran 𝑤 = (𝐹𝑥))
1413difeq2d 4082 . . . . . . . . . . 11 (𝑤 = (𝐹𝑥) → (𝐴 ∖ ran 𝑤) = (𝐴 ∖ (𝐹𝑥)))
1514fveq2d 6873 . . . . . . . . . 10 (𝑤 = (𝐹𝑥) → (𝐺‘(𝐴 ∖ ran 𝑤)) = (𝐺‘(𝐴 ∖ (𝐹𝑥))))
16 rneq 5914 . . . . . . . . . . . . 13 (𝑧 = 𝑤 → ran 𝑧 = ran 𝑤)
1716difeq2d 4082 . . . . . . . . . . . 12 (𝑧 = 𝑤 → (𝐴 ∖ ran 𝑧) = (𝐴 ∖ ran 𝑤))
1817fveq2d 6873 . . . . . . . . . . 11 (𝑧 = 𝑤 → (𝐺‘(𝐴 ∖ ran 𝑧)) = (𝐺‘(𝐴 ∖ ran 𝑤)))
1918cbvmptv 5206 . . . . . . . . . 10 (𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))) = (𝑤 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑤)))
20 fvex 6882 . . . . . . . . . 10 (𝐺‘(𝐴 ∖ (𝐹𝑥))) ∈ V
2115, 19, 20fvmpt 6977 . . . . . . . . 9 ((𝐹𝑥) ∈ V → ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(𝐹𝑥)) = (𝐺‘(𝐴 ∖ (𝐹𝑥))))
2210, 21ax-mp 5 . . . . . . . 8 ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(𝐹𝑥)) = (𝐺‘(𝐴 ∖ (𝐹𝑥)))
233reseq1i 5963 . . . . . . . . 9 (𝐹𝑥) = (recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥)
2423fveq2i 6872 . . . . . . . 8 ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(𝐹𝑥)) = ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥))
2522, 24eqtr3i 2789 . . . . . . 7 (𝐺‘(𝐴 ∖ (𝐹𝑥))) = ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥))
262, 4, 253eqtr4g 2824 . . . . . 6 (𝑥 ∈ On → (𝐹𝑥) = (𝐺‘(𝐴 ∖ (𝐹𝑥))))
2726ad2antlr 737 . . . . 5 (((𝜑𝑥 ∈ On) ∧ (𝐴 ∖ (𝐹𝑥)) ≠ ∅) → (𝐹𝑥) = (𝐺‘(𝐴 ∖ (𝐹𝑥))))
28 difss 4091 . . . . . . . . 9 (𝐴 ∖ (𝐹𝑥)) ⊆ 𝐴
29 elpw2g 5291 . . . . . . . . . 10 (𝐴𝑉 → ((𝐴 ∖ (𝐹𝑥)) ∈ 𝒫 𝐴 ↔ (𝐴 ∖ (𝐹𝑥)) ⊆ 𝐴))
301, 29syl 17 . . . . . . . . 9 (𝜑 → ((𝐴 ∖ (𝐹𝑥)) ∈ 𝒫 𝐴 ↔ (𝐴 ∖ (𝐹𝑥)) ⊆ 𝐴))
3128, 30mpbiri 260 . . . . . . . 8 (𝜑 → (𝐴 ∖ (𝐹𝑥)) ∈ 𝒫 𝐴)
32 dnnumch.g . . . . . . . 8 (𝜑 → ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺𝑦) ∈ 𝑦))
33 neeq1 3021 . . . . . . . . . 10 (𝑦 = (𝐴 ∖ (𝐹𝑥)) → (𝑦 ≠ ∅ ↔ (𝐴 ∖ (𝐹𝑥)) ≠ ∅))
34 fveq2 6869 . . . . . . . . . . 11 (𝑦 = (𝐴 ∖ (𝐹𝑥)) → (𝐺𝑦) = (𝐺‘(𝐴 ∖ (𝐹𝑥))))
35 id 22 . . . . . . . . . . 11 (𝑦 = (𝐴 ∖ (𝐹𝑥)) → 𝑦 = (𝐴 ∖ (𝐹𝑥)))
3634, 35eleq12d 2858 . . . . . . . . . 10 (𝑦 = (𝐴 ∖ (𝐹𝑥)) → ((𝐺𝑦) ∈ 𝑦 ↔ (𝐺‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥))))
3733, 36imbi12d 346 . . . . . . . . 9 (𝑦 = (𝐴 ∖ (𝐹𝑥)) → ((𝑦 ≠ ∅ → (𝐺𝑦) ∈ 𝑦) ↔ ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥)))))
3837rspcva 3581 . . . . . . . 8 (((𝐴 ∖ (𝐹𝑥)) ∈ 𝒫 𝐴 ∧ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺𝑦) ∈ 𝑦)) → ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥))))
3931, 32, 38syl2anc 593 . . . . . . 7 (𝜑 → ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥))))
4039adantr 484 . . . . . 6 ((𝜑𝑥 ∈ On) → ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥))))
4140imp 410 . . . . 5 (((𝜑𝑥 ∈ On) ∧ (𝐴 ∖ (𝐹𝑥)) ≠ ∅) → (𝐺‘(𝐴 ∖ (𝐹𝑥))) ∈ (𝐴 ∖ (𝐹𝑥)))
4227, 41eqeltrd 2864 . . . 4 (((𝜑𝑥 ∈ On) ∧ (𝐴 ∖ (𝐹𝑥)) ≠ ∅) → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)))
4342ex 416 . . 3 ((𝜑𝑥 ∈ On) → ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))))
4443ralrimiva 3156 . 2 (𝜑 → ∀𝑥 ∈ On ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))))
455tz7.49c 8419 . 2 ((𝐴𝑉 ∧ ∀𝑥 ∈ On ((𝐴 ∖ (𝐹𝑥)) ≠ ∅ → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)))) → ∃𝑥 ∈ On (𝐹𝑥):𝑥1-1-onto𝐴)
461, 44, 45syl2anc 593 1 (𝜑 → ∃𝑥 ∈ On (𝐹𝑥):𝑥1-1-onto𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1562  wcel 2144  wne 2959  wral 3078  wrex 3088  Vcvv 3456  cdif 3903  wss 3906  c0 4287  𝒫 cpw 4557  cmpt 5183  ran crn 5650  cres 5651  cima 5652  Oncon0 6348  Fun wfun 6517   Fn wfn 6518  1-1-ontowf1o 6522  cfv 6523  recscrecs 8343
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-rep 5229  ax-sep 5248  ax-nul 5258  ax-pr 5392  ax-un 7720
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-reu 3370  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5544  df-eprel 5549  df-po 5557  df-so 5558  df-fr 5602  df-we 5604  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-pred 6290  df-ord 6351  df-on 6352  df-suc 6354  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-ov 7401  df-2nd 7973  df-frecs 8264  df-wrecs 8295  df-recs 8344
This theorem is referenced by:  dnnumch2  43627
  Copyright terms: Public domain W3C validator