Theorem dnwech 43498

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.

Step	Hyp	Ref	Expression
1		dnnumch.f	. . . . 5 ⊢ 𝐹 = recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))
2		dnnumch.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
3		dnnumch.g	. . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺‘𝑦) ∈ 𝑦))
4	1, 2, 3	dnnumch3 43497	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})):𝐴–1-1→On)
5		f1f1orn 6787	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})):𝐴–1-1→On → (𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})):𝐴–1-1-onto→ran (𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})))
6	4, 5	syl 17	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})):𝐴–1-1-onto→ran (𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})))
7		f1f 6732	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})):𝐴–1-1→On → (𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})):𝐴⟶On)
8		frn 6671	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})):𝐴⟶On → ran (𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})) ⊆ On)
9	4, 7, 8	3syl 18	. . . 4 ⊢ (𝜑 → ran (𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})) ⊆ On)
10		epweon 7724	. . . 4 ⊢ E We On
11		wess 5612	. . . 4 ⊢ (ran (𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})) ⊆ On → ( E We On → E We ran (𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))))
12	9, 10, 11	mpisyl 21	. . 3 ⊢ (𝜑 → E We ran (𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})))
13		eqid 2737	. . . 4 ⊢ {⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)} = {⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)}
14	13	f1owe 7303	. . 3 ⊢ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})):𝐴–1-1-onto→ran (𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})) → ( E We ran (𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥})) → {⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)} We 𝐴))
15	6, 12, 14	sylc 65	. 2 ⊢ (𝜑 → {⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)} We 𝐴)
16		fvex 6849	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤) ∈ V
17	16	epeli 5528	. . . . . . . 8 ⊢ (((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤) ↔ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) ∈ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤))
18	1, 2, 3	dnnumch3lem 43496	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) = ∩ (◡𝐹 “ {𝑣}))
19	18	adantrr 718	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) = ∩ (◡𝐹 “ {𝑣}))
20	1, 2, 3	dnnumch3lem 43496	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤) = ∩ (◡𝐹 “ {𝑤}))
21	20	adantrl 717	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤) = ∩ (◡𝐹 “ {𝑤}))
22	19, 21	eleq12d 2831	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) ∈ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤) ↔ ∩ (◡𝐹 “ {𝑣}) ∈ ∩ (◡𝐹 “ {𝑤})))
23	17, 22	bitr2id 284	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (∩ (◡𝐹 “ {𝑣}) ∈ ∩ (◡𝐹 “ {𝑤}) ↔ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)))
24	23	pm5.32da 579	. . . . . 6 ⊢ (𝜑 → (((𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) ∧ ∩ (◡𝐹 “ {𝑣}) ∈ ∩ (◡𝐹 “ {𝑤})) ↔ ((𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) ∧ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤))))
25	24	opabbidv 5152	. . . . 5 ⊢ (𝜑 → {⟨𝑣, 𝑤⟩ ∣ ((𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) ∧ ∩ (◡𝐹 “ {𝑣}) ∈ ∩ (◡𝐹 “ {𝑤}))} = {⟨𝑣, 𝑤⟩ ∣ ((𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) ∧ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤))})
26		incom 4150	. . . . . 6 ⊢ (𝐻 ∩ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∩ 𝐻)
27		df-xp 5632	. . . . . . 7 ⊢ (𝐴 × 𝐴) = {⟨𝑣, 𝑤⟩ ∣ (𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)}
28		dnwech.h	. . . . . . 7 ⊢ 𝐻 = {⟨𝑣, 𝑤⟩ ∣ ∩ (◡𝐹 “ {𝑣}) ∈ ∩ (◡𝐹 “ {𝑤})}
29	27, 28	ineq12i 4159	. . . . . 6 ⊢ ((𝐴 × 𝐴) ∩ 𝐻) = ({⟨𝑣, 𝑤⟩ ∣ (𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)} ∩ {⟨𝑣, 𝑤⟩ ∣ ∩ (◡𝐹 “ {𝑣}) ∈ ∩ (◡𝐹 “ {𝑤})})
30		inopab 5780	. . . . . 6 ⊢ ({⟨𝑣, 𝑤⟩ ∣ (𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)} ∩ {⟨𝑣, 𝑤⟩ ∣ ∩ (◡𝐹 “ {𝑣}) ∈ ∩ (◡𝐹 “ {𝑤})}) = {⟨𝑣, 𝑤⟩ ∣ ((𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) ∧ ∩ (◡𝐹 “ {𝑣}) ∈ ∩ (◡𝐹 “ {𝑤}))}
31	26, 29, 30	3eqtri 2764	. . . . 5 ⊢ (𝐻 ∩ (𝐴 × 𝐴)) = {⟨𝑣, 𝑤⟩ ∣ ((𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) ∧ ∩ (◡𝐹 “ {𝑣}) ∈ ∩ (◡𝐹 “ {𝑤}))}
32		incom 4150	. . . . . 6 ⊢ ({⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)} ∩ (𝐴 × 𝐴)) = ((𝐴 × 𝐴) ∩ {⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)})
33	27	ineq1i 4157	. . . . . 6 ⊢ ((𝐴 × 𝐴) ∩ {⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)}) = ({⟨𝑣, 𝑤⟩ ∣ (𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)} ∩ {⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)})
34		inopab 5780	. . . . . 6 ⊢ ({⟨𝑣, 𝑤⟩ ∣ (𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)} ∩ {⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)}) = {⟨𝑣, 𝑤⟩ ∣ ((𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) ∧ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤))}
35	32, 33, 34	3eqtri 2764	. . . . 5 ⊢ ({⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)} ∩ (𝐴 × 𝐴)) = {⟨𝑣, 𝑤⟩ ∣ ((𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) ∧ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤))}
36	25, 31, 35	3eqtr4g 2797	. . . 4 ⊢ (𝜑 → (𝐻 ∩ (𝐴 × 𝐴)) = ({⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)} ∩ (𝐴 × 𝐴)))
37		weeq1 5613	. . . 4 ⊢ ((𝐻 ∩ (𝐴 × 𝐴)) = ({⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)} ∩ (𝐴 × 𝐴)) → ((𝐻 ∩ (𝐴 × 𝐴)) We 𝐴 ↔ ({⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)} ∩ (𝐴 × 𝐴)) We 𝐴))
38	36, 37	syl 17	. . 3 ⊢ (𝜑 → ((𝐻 ∩ (𝐴 × 𝐴)) We 𝐴 ↔ ({⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)} ∩ (𝐴 × 𝐴)) We 𝐴))
39		weinxp 5711	. . 3 ⊢ (𝐻 We 𝐴 ↔ (𝐻 ∩ (𝐴 × 𝐴)) We 𝐴)
40		weinxp 5711	. . 3 ⊢ ({⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)} We 𝐴 ↔ ({⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)} ∩ (𝐴 × 𝐴)) We 𝐴)
41	38, 39, 40	3bitr4g 314	. 2 ⊢ (𝜑 → (𝐻 We 𝐴 ↔ {⟨𝑣, 𝑤⟩ ∣ ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑣) E ((𝑥 ∈ 𝐴 ↦ ∩ (◡𝐹 “ {𝑥}))‘𝑤)} We 𝐴))
42	15, 41	mpbird 257	1 ⊢ (𝜑 → 𝐻 We 𝐴)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  Vcvv 3430   ∖ cdif 3887   ∩ cin 3889   ⊆ wss 3890  ∅c0 4274  𝒫 cpw 4542  {csn 4568  ∩ cint 4890   class class class wbr 5086  {copab 5148   ↦ cmpt 5167   E cep 5525   We wwe 5578   × cxp 5624  ^◡ccnv 5625  ran crn 5627   “ cima 5629  Oncon0 6319  ⟶wf 6490  –1-1→wf1 6491  –1-1-onto→wf1o 6493  ‘cfv 6494  recscrecs 8305

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pr 5372  ax-un 7684

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5521  df-eprel 5526  df-po 5534  df-so 5535  df-fr 5579  df-we 5581  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-pred 6261  df-ord 6322  df-on 6323  df-suc 6325  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-f1 6499  df-fo 6500  df-f1o 6501  df-fv 6502  df-isom 6503  df-ov 7365  df-2nd 7938  df-frecs 8226  df-wrecs 8257  df-recs 8306

This theorem is referenced by:  aomclem3  43506