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 40484
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 5933 . . . . 5 (𝐹 “ {𝑥}) ⊆ dom 𝐹
2 dnnumch.f . . . . . . 7 𝐹 = recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))
32tfr1 8074 . . . . . 6 𝐹 Fn On
43fndmi 6451 . . . . 5 dom 𝐹 = On
51, 4sseqtri 3923 . . . 4 (𝐹 “ {𝑥}) ⊆ On
6 dnnumch.a . . . . . . 7 (𝜑𝐴𝑉)
7 dnnumch.g . . . . . . 7 (𝜑 → ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺𝑦) ∈ 𝑦))
82, 6, 7dnnumch2 40482 . . . . . 6 (𝜑𝐴 ⊆ ran 𝐹)
98sselda 3887 . . . . 5 ((𝜑𝑥𝐴) → 𝑥 ∈ ran 𝐹)
10 inisegn0 5945 . . . . 5 (𝑥 ∈ ran 𝐹 ↔ (𝐹 “ {𝑥}) ≠ ∅)
119, 10sylib 221 . . . 4 ((𝜑𝑥𝐴) → (𝐹 “ {𝑥}) ≠ ∅)
12 oninton 7546 . . . 4 (((𝐹 “ {𝑥}) ⊆ On ∧ (𝐹 “ {𝑥}) ≠ ∅) → (𝐹 “ {𝑥}) ∈ On)
135, 11, 12sylancr 590 . . 3 ((𝜑𝑥𝐴) → (𝐹 “ {𝑥}) ∈ On)
1413fmpttd 6901 . 2 (𝜑 → (𝑥𝐴 (𝐹 “ {𝑥})):𝐴⟶On)
152, 6, 7dnnumch3lem 40483 . . . . . 6 ((𝜑𝑣𝐴) → ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) = (𝐹 “ {𝑣}))
1615adantrr 717 . . . . 5 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) = (𝐹 “ {𝑣}))
172, 6, 7dnnumch3lem 40483 . . . . . 6 ((𝜑𝑤𝐴) → ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) = (𝐹 “ {𝑤}))
1817adantrl 716 . . . . 5 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) = (𝐹 “ {𝑤}))
1916, 18eqeq12d 2755 . . . 4 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → (((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) = ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) ↔ (𝐹 “ {𝑣}) = (𝐹 “ {𝑤})))
20 fveq2 6686 . . . . . . 7 ( (𝐹 “ {𝑣}) = (𝐹 “ {𝑤}) → (𝐹 (𝐹 “ {𝑣})) = (𝐹 (𝐹 “ {𝑤})))
2120adantl 485 . . . . . 6 (((𝜑 ∧ (𝑣𝐴𝑤𝐴)) ∧ (𝐹 “ {𝑣}) = (𝐹 “ {𝑤})) → (𝐹 (𝐹 “ {𝑣})) = (𝐹 (𝐹 “ {𝑤})))
22 cnvimass 5933 . . . . . . . . . . 11 (𝐹 “ {𝑣}) ⊆ dom 𝐹
2322, 4sseqtri 3923 . . . . . . . . . 10 (𝐹 “ {𝑣}) ⊆ On
248sselda 3887 . . . . . . . . . . 11 ((𝜑𝑣𝐴) → 𝑣 ∈ ran 𝐹)
25 inisegn0 5945 . . . . . . . . . . 11 (𝑣 ∈ ran 𝐹 ↔ (𝐹 “ {𝑣}) ≠ ∅)
2624, 25sylib 221 . . . . . . . . . 10 ((𝜑𝑣𝐴) → (𝐹 “ {𝑣}) ≠ ∅)
27 onint 7541 . . . . . . . . . 10 (((𝐹 “ {𝑣}) ⊆ On ∧ (𝐹 “ {𝑣}) ≠ ∅) → (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑣}))
2823, 26, 27sylancr 590 . . . . . . . . 9 ((𝜑𝑣𝐴) → (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑣}))
29 fniniseg 6849 . . . . . . . . . . 11 (𝐹 Fn On → ( (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑣}) ↔ ( (𝐹 “ {𝑣}) ∈ On ∧ (𝐹 (𝐹 “ {𝑣})) = 𝑣)))
303, 29ax-mp 5 . . . . . . . . . 10 ( (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑣}) ↔ ( (𝐹 “ {𝑣}) ∈ On ∧ (𝐹 (𝐹 “ {𝑣})) = 𝑣))
3130simprbi 500 . . . . . . . . 9 ( (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑣}) → (𝐹 (𝐹 “ {𝑣})) = 𝑣)
3228, 31syl 17 . . . . . . . 8 ((𝜑𝑣𝐴) → (𝐹 (𝐹 “ {𝑣})) = 𝑣)
3332adantrr 717 . . . . . . 7 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → (𝐹 (𝐹 “ {𝑣})) = 𝑣)
3433adantr 484 . . . . . 6 (((𝜑 ∧ (𝑣𝐴𝑤𝐴)) ∧ (𝐹 “ {𝑣}) = (𝐹 “ {𝑤})) → (𝐹 (𝐹 “ {𝑣})) = 𝑣)
35 cnvimass 5933 . . . . . . . . . . 11 (𝐹 “ {𝑤}) ⊆ dom 𝐹
3635, 4sseqtri 3923 . . . . . . . . . 10 (𝐹 “ {𝑤}) ⊆ On
378sselda 3887 . . . . . . . . . . 11 ((𝜑𝑤𝐴) → 𝑤 ∈ ran 𝐹)
38 inisegn0 5945 . . . . . . . . . . 11 (𝑤 ∈ ran 𝐹 ↔ (𝐹 “ {𝑤}) ≠ ∅)
3937, 38sylib 221 . . . . . . . . . 10 ((𝜑𝑤𝐴) → (𝐹 “ {𝑤}) ≠ ∅)
40 onint 7541 . . . . . . . . . 10 (((𝐹 “ {𝑤}) ⊆ On ∧ (𝐹 “ {𝑤}) ≠ ∅) → (𝐹 “ {𝑤}) ∈ (𝐹 “ {𝑤}))
4136, 39, 40sylancr 590 . . . . . . . . 9 ((𝜑𝑤𝐴) → (𝐹 “ {𝑤}) ∈ (𝐹 “ {𝑤}))
42 fniniseg 6849 . . . . . . . . . . 11 (𝐹 Fn On → ( (𝐹 “ {𝑤}) ∈ (𝐹 “ {𝑤}) ↔ ( (𝐹 “ {𝑤}) ∈ On ∧ (𝐹 (𝐹 “ {𝑤})) = 𝑤)))
433, 42ax-mp 5 . . . . . . . . . 10 ( (𝐹 “ {𝑤}) ∈ (𝐹 “ {𝑤}) ↔ ( (𝐹 “ {𝑤}) ∈ On ∧ (𝐹 (𝐹 “ {𝑤})) = 𝑤))
4443simprbi 500 . . . . . . . . 9 ( (𝐹 “ {𝑤}) ∈ (𝐹 “ {𝑤}) → (𝐹 (𝐹 “ {𝑤})) = 𝑤)
4541, 44syl 17 . . . . . . . 8 ((𝜑𝑤𝐴) → (𝐹 (𝐹 “ {𝑤})) = 𝑤)
4645adantrl 716 . . . . . . 7 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → (𝐹 (𝐹 “ {𝑤})) = 𝑤)
4746adantr 484 . . . . . 6 (((𝜑 ∧ (𝑣𝐴𝑤𝐴)) ∧ (𝐹 “ {𝑣}) = (𝐹 “ {𝑤})) → (𝐹 (𝐹 “ {𝑤})) = 𝑤)
4821, 34, 473eqtr3d 2782 . . . . 5 (((𝜑 ∧ (𝑣𝐴𝑤𝐴)) ∧ (𝐹 “ {𝑣}) = (𝐹 “ {𝑤})) → 𝑣 = 𝑤)
4948ex 416 . . . 4 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → ( (𝐹 “ {𝑣}) = (𝐹 “ {𝑤}) → 𝑣 = 𝑤))
5019, 49sylbid 243 . . 3 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → (((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) = ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) → 𝑣 = 𝑤))
5150ralrimivva 3104 . 2 (𝜑 → ∀𝑣𝐴𝑤𝐴 (((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) = ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) → 𝑣 = 𝑤))
52 dff13 7036 . 2 ((𝑥𝐴 (𝐹 “ {𝑥})):𝐴1-1→On ↔ ((𝑥𝐴 (𝐹 “ {𝑥})):𝐴⟶On ∧ ∀𝑣𝐴𝑤𝐴 (((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) = ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) → 𝑣 = 𝑤)))
5314, 51, 52sylanbrc 586 1 (𝜑 → (𝑥𝐴 (𝐹 “ {𝑥})):𝐴1-1→On)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1542  wcel 2114  wne 2935  wral 3054  Vcvv 3400  cdif 3850  wss 3853  c0 4221  𝒫 cpw 4498  {csn 4526   cint 4846  cmpt 5120  ccnv 5534  dom cdm 5535  ran crn 5536  cima 5538  Oncon0 6182   Fn wfn 6344  wf 6345  1-1wf1 6346  cfv 6349  recscrecs 8048
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2020  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2162  ax-12 2179  ax-ext 2711  ax-rep 5164  ax-sep 5177  ax-nul 5184  ax-pr 5306  ax-un 7491
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2075  df-mo 2541  df-eu 2571  df-clab 2718  df-cleq 2731  df-clel 2812  df-nfc 2882  df-ne 2936  df-ral 3059  df-rex 3060  df-reu 3061  df-rab 3063  df-v 3402  df-sbc 3686  df-csb 3801  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-pss 3872  df-nul 4222  df-if 4425  df-pw 4500  df-sn 4527  df-pr 4529  df-tp 4531  df-op 4533  df-uni 4807  df-int 4847  df-iun 4893  df-br 5041  df-opab 5103  df-mpt 5121  df-tr 5147  df-id 5439  df-eprel 5444  df-po 5452  df-so 5453  df-fr 5493  df-we 5495  df-xp 5541  df-rel 5542  df-cnv 5543  df-co 5544  df-dm 5545  df-rn 5546  df-res 5547  df-ima 5548  df-pred 6139  df-ord 6185  df-on 6186  df-suc 6188  df-iota 6307  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-wrecs 7988  df-recs 8049
This theorem is referenced by:  dnwech  40485
  Copyright terms: Public domain W3C validator