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

Theorem dnwech 38120
 Description: Define a well-ordering from a choice function. (Contributed by Stefan O'Rear, 18-Jan-2015.)
Hypotheses
Ref Expression
dnnumch.f 𝐹 = recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))
dnnumch.a (𝜑𝐴𝑉)
dnnumch.g (𝜑 → ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺𝑦) ∈ 𝑦))
dnwech.h 𝐻 = {⟨𝑣, 𝑤⟩ ∣ (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑤})}
Assertion
Ref Expression
dnwech (𝜑𝐻 We 𝐴)
Distinct variable groups:   𝑣,𝐹,𝑤,𝑦   𝑣,𝐺,𝑤,𝑦,𝑧   𝑣,𝐴,𝑤,𝑦,𝑧   𝜑,𝑣,𝑤
Allowed substitution hints:   𝜑(𝑦,𝑧)   𝐹(𝑧)   𝐻(𝑦,𝑧,𝑤,𝑣)   𝑉(𝑦,𝑧,𝑤,𝑣)

Proof of Theorem dnwech
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 dnnumch.f . . . . 5 𝐹 = recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))
2 dnnumch.a . . . . 5 (𝜑𝐴𝑉)
3 dnnumch.g . . . . 5 (𝜑 → ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺𝑦) ∈ 𝑦))
41, 2, 3dnnumch3 38119 . . . 4 (𝜑 → (𝑥𝐴 (𝐹 “ {𝑥})):𝐴1-1→On)
5 f1f1orn 6309 . . . 4 ((𝑥𝐴 (𝐹 “ {𝑥})):𝐴1-1→On → (𝑥𝐴 (𝐹 “ {𝑥})):𝐴1-1-onto→ran (𝑥𝐴 (𝐹 “ {𝑥})))
64, 5syl 17 . . 3 (𝜑 → (𝑥𝐴 (𝐹 “ {𝑥})):𝐴1-1-onto→ran (𝑥𝐴 (𝐹 “ {𝑥})))
7 f1f 6262 . . . . 5 ((𝑥𝐴 (𝐹 “ {𝑥})):𝐴1-1→On → (𝑥𝐴 (𝐹 “ {𝑥})):𝐴⟶On)
8 frn 6214 . . . . 5 ((𝑥𝐴 (𝐹 “ {𝑥})):𝐴⟶On → ran (𝑥𝐴 (𝐹 “ {𝑥})) ⊆ On)
94, 7, 83syl 18 . . . 4 (𝜑 → ran (𝑥𝐴 (𝐹 “ {𝑥})) ⊆ On)
10 epweon 7148 . . . 4 E We On
11 wess 5253 . . . 4 (ran (𝑥𝐴 (𝐹 “ {𝑥})) ⊆ On → ( E We On → E We ran (𝑥𝐴 (𝐹 “ {𝑥}))))
129, 10, 11mpisyl 21 . . 3 (𝜑 → E We ran (𝑥𝐴 (𝐹 “ {𝑥})))
13 eqid 2760 . . . 4 {⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)} = {⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)}
1413f1owe 6766 . . 3 ((𝑥𝐴 (𝐹 “ {𝑥})):𝐴1-1-onto→ran (𝑥𝐴 (𝐹 “ {𝑥})) → ( E We ran (𝑥𝐴 (𝐹 “ {𝑥})) → {⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)} We 𝐴))
156, 12, 14sylc 65 . 2 (𝜑 → {⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)} We 𝐴)
16 fvex 6362 . . . . . . . . 9 ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) ∈ V
1716epelc 5181 . . . . . . . 8 (((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) ↔ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) ∈ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤))
181, 2, 3dnnumch3lem 38118 . . . . . . . . . 10 ((𝜑𝑣𝐴) → ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) = (𝐹 “ {𝑣}))
1918adantrr 755 . . . . . . . . 9 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) = (𝐹 “ {𝑣}))
201, 2, 3dnnumch3lem 38118 . . . . . . . . . 10 ((𝜑𝑤𝐴) → ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) = (𝐹 “ {𝑤}))
2120adantrl 754 . . . . . . . . 9 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) = (𝐹 “ {𝑤}))
2219, 21eleq12d 2833 . . . . . . . 8 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → (((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) ∈ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤) ↔ (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑤})))
2317, 22syl5rbb 273 . . . . . . 7 ((𝜑 ∧ (𝑣𝐴𝑤𝐴)) → ( (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑤}) ↔ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)))
2423pm5.32da 676 . . . . . 6 (𝜑 → (((𝑣𝐴𝑤𝐴) ∧ (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑤})) ↔ ((𝑣𝐴𝑤𝐴) ∧ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤))))
2524opabbidv 4868 . . . . 5 (𝜑 → {⟨𝑣, 𝑤⟩ ∣ ((𝑣𝐴𝑤𝐴) ∧ (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑤}))} = {⟨𝑣, 𝑤⟩ ∣ ((𝑣𝐴𝑤𝐴) ∧ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤))})
26 incom 3948 . . . . . 6 (𝐻 ∩ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∩ 𝐻)
27 df-xp 5272 . . . . . . 7 (𝐴 × 𝐴) = {⟨𝑣, 𝑤⟩ ∣ (𝑣𝐴𝑤𝐴)}
28 dnwech.h . . . . . . 7 𝐻 = {⟨𝑣, 𝑤⟩ ∣ (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑤})}
2927, 28ineq12i 3955 . . . . . 6 ((𝐴 × 𝐴) ∩ 𝐻) = ({⟨𝑣, 𝑤⟩ ∣ (𝑣𝐴𝑤𝐴)} ∩ {⟨𝑣, 𝑤⟩ ∣ (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑤})})
30 inopab 5408 . . . . . 6 ({⟨𝑣, 𝑤⟩ ∣ (𝑣𝐴𝑤𝐴)} ∩ {⟨𝑣, 𝑤⟩ ∣ (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑤})}) = {⟨𝑣, 𝑤⟩ ∣ ((𝑣𝐴𝑤𝐴) ∧ (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑤}))}
3126, 29, 303eqtri 2786 . . . . 5 (𝐻 ∩ (𝐴 × 𝐴)) = {⟨𝑣, 𝑤⟩ ∣ ((𝑣𝐴𝑤𝐴) ∧ (𝐹 “ {𝑣}) ∈ (𝐹 “ {𝑤}))}
32 incom 3948 . . . . . 6 ({⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)} ∩ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∩ {⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)})
3327ineq1i 3953 . . . . . 6 ((𝐴 × 𝐴) ∩ {⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)}) = ({⟨𝑣, 𝑤⟩ ∣ (𝑣𝐴𝑤𝐴)} ∩ {⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)})
34 inopab 5408 . . . . . 6 ({⟨𝑣, 𝑤⟩ ∣ (𝑣𝐴𝑤𝐴)} ∩ {⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)}) = {⟨𝑣, 𝑤⟩ ∣ ((𝑣𝐴𝑤𝐴) ∧ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤))}
3532, 33, 343eqtri 2786 . . . . 5 ({⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)} ∩ (𝐴 × 𝐴)) = {⟨𝑣, 𝑤⟩ ∣ ((𝑣𝐴𝑤𝐴) ∧ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤))}
3625, 31, 353eqtr4g 2819 . . . 4 (𝜑 → (𝐻 ∩ (𝐴 × 𝐴)) = ({⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)} ∩ (𝐴 × 𝐴)))
37 weeq1 5254 . . . 4 ((𝐻 ∩ (𝐴 × 𝐴)) = ({⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)} ∩ (𝐴 × 𝐴)) → ((𝐻 ∩ (𝐴 × 𝐴)) We 𝐴 ↔ ({⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)} ∩ (𝐴 × 𝐴)) We 𝐴))
3836, 37syl 17 . . 3 (𝜑 → ((𝐻 ∩ (𝐴 × 𝐴)) We 𝐴 ↔ ({⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)} ∩ (𝐴 × 𝐴)) We 𝐴))
39 weinxp 5343 . . 3 (𝐻 We 𝐴 ↔ (𝐻 ∩ (𝐴 × 𝐴)) We 𝐴)
40 weinxp 5343 . . 3 ({⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)} We 𝐴 ↔ ({⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)} ∩ (𝐴 × 𝐴)) We 𝐴)
4138, 39, 403bitr4g 303 . 2 (𝜑 → (𝐻 We 𝐴 ↔ {⟨𝑣, 𝑤⟩ ∣ ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑣) E ((𝑥𝐴 (𝐹 “ {𝑥}))‘𝑤)} We 𝐴))
4215, 41mpbird 247 1 (𝜑𝐻 We 𝐴)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   = wceq 1632   ∈ wcel 2139   ≠ wne 2932  ∀wral 3050  Vcvv 3340   ∖ cdif 3712   ∩ cin 3714   ⊆ wss 3715  ∅c0 4058  𝒫 cpw 4302  {csn 4321  ∩ cint 4627   class class class wbr 4804  {copab 4864   ↦ cmpt 4881   E cep 5178   We wwe 5224   × cxp 5264  ◡ccnv 5265  ran crn 5267   “ cima 5269  Oncon0 5884  ⟶wf 6045  –1-1→wf1 6046  –1-1-onto→wf1o 6048  ‘cfv 6049  recscrecs 7636 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7114 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-ral 3055  df-rex 3056  df-reu 3057  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-int 4628  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-tr 4905  df-id 5174  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-we 5227  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-pred 5841  df-ord 5887  df-on 5888  df-suc 5890  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-isom 6058  df-wrecs 7576  df-recs 7637 This theorem is referenced by:  aomclem3  38128
 Copyright terms: Public domain W3C validator