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

Theorem dnnumch3 43036
Description: Define an injection from a set into the ordinals using a choice function. (Contributed by Stefan O'Rear, 18-Jan-2015.)
Hypotheses
Ref Expression
dnnumch.f 𝐹 = recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))
dnnumch.a (𝜑𝐴𝑉)
dnnumch.g (𝜑 → ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺𝑦) ∈ 𝑦))
Assertion
Ref Expression
dnnumch3 (𝜑 → (𝑥𝐴 (𝐹 “ {𝑥})):𝐴1-1→On)
Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦,𝑧   𝑥,𝐴,𝑦,𝑧   𝜑,𝑥
Allowed substitution hints:   𝜑(𝑦,𝑧)   𝐹(𝑧)   𝑉(𝑥,𝑦,𝑧)

Proof of Theorem dnnumch3
Dummy variables 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnvimass 6102 . . . . 5 (𝐹 “ {𝑥}) ⊆ dom 𝐹
2 dnnumch.f . . . . . . 7 𝐹 = recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))
32tfr1 8436 . . . . . 6 𝐹 Fn On
43fndmi 6673 . . . . 5 dom 𝐹 = On
51, 4sseqtri 4032 . . . 4 (𝐹 “ {𝑥}) ⊆ On
6 dnnumch.a . . . . . . 7 (𝜑𝐴𝑉)
7 dnnumch.g . . . . . . 7 (𝜑 → ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺𝑦) ∈ 𝑦))
82, 6, 7dnnumch2 43034 . . . . . 6 (𝜑𝐴 ⊆ ran 𝐹)
98sselda 3995 . . . . 5 ((𝜑𝑥𝐴) → 𝑥 ∈ ran 𝐹)
10 inisegn0 6119 . . . . 5 (𝑥 ∈ ran 𝐹 ↔ (𝐹 “ {𝑥}) ≠ ∅)
119, 10sylib 218 . . . 4 ((𝜑𝑥𝐴) → (𝐹 “ {𝑥}) ≠ ∅)
12 oninton 7815 . . . 4 (((𝐹 “ {𝑥}) ⊆ On ∧ (𝐹 “ {𝑥}) ≠ ∅) → (𝐹 “ {𝑥}) ∈ On)
135, 11, 12sylancr 587 . . 3 ((𝜑𝑥𝐴) → (𝐹 “ {𝑥}) ∈ On)
1413fmpttd 7135 . 2 (𝜑 → (𝑥𝐴 (𝐹 “ {𝑥})):𝐴⟶On)
152, 6, 7dnnumch3lem 43035 . . . . . 6 ((𝜑𝑣𝐴) → ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) = (𝐹 “ {𝑣}))
1615adantrr 717 . . . . 5 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) = (𝐹 “ {𝑣}))
172, 6, 7dnnumch3lem 43035 . . . . . 6 ((𝜑𝑤𝐴) → ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) = (𝐹 “ {𝑤}))
1817adantrl 716 . . . . 5 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) = (𝐹 “ {𝑤}))
1916, 18eqeq12d 2751 . . . 4 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → (((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) = ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) ↔ (𝐹 “ {𝑣}) = (𝐹 “ {𝑤})))
20 fveq2 6907 . . . . . . 7 ( (𝐹 “ {𝑣}) = (𝐹 “ {𝑤}) → (𝐹 (𝐹 “ {𝑣})) = (𝐹 (𝐹 “ {𝑤})))
2120adantl 481 . . . . . 6 (((𝜑 ∧ (𝑣𝐴𝑤𝐴)) ∧ (𝐹 “ {𝑣}) = (𝐹 “ {𝑤})) → (𝐹 (𝐹 “ {𝑣})) = (𝐹 (𝐹 “ {𝑤})))
22 cnvimass 6102 . . . . . . . . . . 11 (𝐹 “ {𝑣}) ⊆ dom 𝐹
2322, 4sseqtri 4032 . . . . . . . . . 10 (𝐹 “ {𝑣}) ⊆ On
248sselda 3995 . . . . . . . . . . 11 ((𝜑𝑣𝐴) → 𝑣 ∈ ran 𝐹)
25 inisegn0 6119 . . . . . . . . . . 11 (𝑣 ∈ ran 𝐹 ↔ (𝐹 “ {𝑣}) ≠ ∅)
2624, 25sylib 218 . . . . . . . . . 10 ((𝜑𝑣𝐴) → (𝐹 “ {𝑣}) ≠ ∅)
27 onint 7810 . . . . . . . . . 10 (((𝐹 “ {𝑣}) ⊆ On ∧ (𝐹 “ {𝑣}) ≠ ∅) → (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑣}))
2823, 26, 27sylancr 587 . . . . . . . . 9 ((𝜑𝑣𝐴) → (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑣}))
29 fniniseg 7080 . . . . . . . . . . 11 (𝐹 Fn On → ( (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑣}) ↔ ( (𝐹 “ {𝑣}) ∈ On ∧ (𝐹 (𝐹 “ {𝑣})) = 𝑣)))
303, 29ax-mp 5 . . . . . . . . . 10 ( (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑣}) ↔ ( (𝐹 “ {𝑣}) ∈ On ∧ (𝐹 (𝐹 “ {𝑣})) = 𝑣))
3130simprbi 496 . . . . . . . . 9 ( (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑣}) → (𝐹 (𝐹 “ {𝑣})) = 𝑣)
3228, 31syl 17 . . . . . . . 8 ((𝜑𝑣𝐴) → (𝐹 (𝐹 “ {𝑣})) = 𝑣)
3332adantrr 717 . . . . . . 7 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → (𝐹 (𝐹 “ {𝑣})) = 𝑣)
3433adantr 480 . . . . . 6 (((𝜑 ∧ (𝑣𝐴𝑤𝐴)) ∧ (𝐹 “ {𝑣}) = (𝐹 “ {𝑤})) → (𝐹 (𝐹 “ {𝑣})) = 𝑣)
35 cnvimass 6102 . . . . . . . . . . 11 (𝐹 “ {𝑤}) ⊆ dom 𝐹
3635, 4sseqtri 4032 . . . . . . . . . 10 (𝐹 “ {𝑤}) ⊆ On
378sselda 3995 . . . . . . . . . . 11 ((𝜑𝑤𝐴) → 𝑤 ∈ ran 𝐹)
38 inisegn0 6119 . . . . . . . . . . 11 (𝑤 ∈ ran 𝐹 ↔ (𝐹 “ {𝑤}) ≠ ∅)
3937, 38sylib 218 . . . . . . . . . 10 ((𝜑𝑤𝐴) → (𝐹 “ {𝑤}) ≠ ∅)
40 onint 7810 . . . . . . . . . 10 (((𝐹 “ {𝑤}) ⊆ On ∧ (𝐹 “ {𝑤}) ≠ ∅) → (𝐹 “ {𝑤}) ∈ (𝐹 “ {𝑤}))
4136, 39, 40sylancr 587 . . . . . . . . 9 ((𝜑𝑤𝐴) → (𝐹 “ {𝑤}) ∈ (𝐹 “ {𝑤}))
42 fniniseg 7080 . . . . . . . . . . 11 (𝐹 Fn On → ( (𝐹 “ {𝑤}) ∈ (𝐹 “ {𝑤}) ↔ ( (𝐹 “ {𝑤}) ∈ On ∧ (𝐹 (𝐹 “ {𝑤})) = 𝑤)))
433, 42ax-mp 5 . . . . . . . . . 10 ( (𝐹 “ {𝑤}) ∈ (𝐹 “ {𝑤}) ↔ ( (𝐹 “ {𝑤}) ∈ On ∧ (𝐹 (𝐹 “ {𝑤})) = 𝑤))
4443simprbi 496 . . . . . . . . 9 ( (𝐹 “ {𝑤}) ∈ (𝐹 “ {𝑤}) → (𝐹 (𝐹 “ {𝑤})) = 𝑤)
4541, 44syl 17 . . . . . . . 8 ((𝜑𝑤𝐴) → (𝐹 (𝐹 “ {𝑤})) = 𝑤)
4645adantrl 716 . . . . . . 7 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → (𝐹 (𝐹 “ {𝑤})) = 𝑤)
4746adantr 480 . . . . . 6 (((𝜑 ∧ (𝑣𝐴𝑤𝐴)) ∧ (𝐹 “ {𝑣}) = (𝐹 “ {𝑤})) → (𝐹 (𝐹 “ {𝑤})) = 𝑤)
4821, 34, 473eqtr3d 2783 . . . . 5 (((𝜑 ∧ (𝑣𝐴𝑤𝐴)) ∧ (𝐹 “ {𝑣}) = (𝐹 “ {𝑤})) → 𝑣 = 𝑤)
4948ex 412 . . . 4 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → ( (𝐹 “ {𝑣}) = (𝐹 “ {𝑤}) → 𝑣 = 𝑤))
5019, 49sylbid 240 . . 3 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → (((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) = ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) → 𝑣 = 𝑤))
5150ralrimivva 3200 . 2 (𝜑 → ∀𝑣𝐴𝑤𝐴 (((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) = ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) → 𝑣 = 𝑤))
52 dff13 7275 . 2 ((𝑥𝐴 (𝐹 “ {𝑥})):𝐴1-1→On ↔ ((𝑥𝐴 (𝐹 “ {𝑥})):𝐴⟶On ∧ ∀𝑣𝐴𝑤𝐴 (((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) = ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) → 𝑣 = 𝑤)))
5314, 51, 52sylanbrc 583 1 (𝜑 → (𝑥𝐴 (𝐹 “ {𝑥})):𝐴1-1→On)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2106  wne 2938  wral 3059  Vcvv 3478  cdif 3960  wss 3963  c0 4339  𝒫 cpw 4605  {csn 4631   cint 4951  cmpt 5231  ccnv 5688  dom cdm 5689  ran crn 5690  cima 5692  Oncon0 6386   Fn wfn 6558  wf 6559  1-1wf1 6560  cfv 6563  recscrecs 8409
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410
This theorem is referenced by:  dnwech  43037
  Copyright terms: Public domain W3C validator