Theorem ltbval 20711

Description: Value of the well-order on finite bags. (Contributed by Mario Carneiro, 8-Feb-2015.)

Hypotheses

Ref	Expression
ltbval.c	⊢ 𝐶 = (𝑇 <bag 𝐼)
ltbval.d	⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
ltbval.i	⊢ (𝜑 → 𝐼 ∈ 𝑉)
ltbval.t	⊢ (𝜑 → 𝑇 ∈ 𝑊)

Assertion

Ref	Expression
ltbval	⊢ (𝜑 → 𝐶 = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐷 ∧ ∃𝑧 ∈ 𝐼 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))})

Distinct variable groups:   𝑥,𝑦,𝐷   𝑤,ℎ,𝑥,𝑦,𝑧,𝐼   𝜑,ℎ,𝑥,𝑦   𝑤,𝑇,𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑧,𝑤)   𝐶(𝑥,𝑦,𝑧,𝑤,ℎ)   𝐷(𝑧,𝑤,ℎ)   𝑇(ℎ)   𝑉(𝑥,𝑦,𝑧,𝑤,ℎ)   𝑊(𝑥,𝑦,𝑧,𝑤,ℎ)

Proof of Theorem ltbval

Dummy variables 𝑖 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ltbval.c	. 2 ⊢ 𝐶 = (𝑇 <bag 𝐼)
2		ltbval.t	. . 3 ⊢ (𝜑 → 𝑇 ∈ 𝑊)
3		ltbval.i	. . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
4		elex 3459	. . . 4 ⊢ (𝑇 ∈ 𝑊 → 𝑇 ∈ V)
5		elex 3459	. . . 4 ⊢ (𝐼 ∈ 𝑉 → 𝐼 ∈ V)
6		simpr 488	. . . . . . . . . . 11 ⊢ ((𝑟 = 𝑇 ∧ 𝑖 = 𝐼) → 𝑖 = 𝐼)
7	6	oveq2d 7151	. . . . . . . . . 10 ⊢ ((𝑟 = 𝑇 ∧ 𝑖 = 𝐼) → (ℕ0 ↑m 𝑖) = (ℕ0 ↑m 𝐼))
8		rabeq 3431	. . . . . . . . . 10 ⊢ ((ℕ0 ↑m 𝑖) = (ℕ0 ↑m 𝐼) → {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})
9	7, 8	syl 17	. . . . . . . . 9 ⊢ ((𝑟 = 𝑇 ∧ 𝑖 = 𝐼) → {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})
10		ltbval.d	. . . . . . . . 9 ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
11	9, 10	eqtr4di 2851	. . . . . . . 8 ⊢ ((𝑟 = 𝑇 ∧ 𝑖 = 𝐼) → {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} = 𝐷)
12	11	sseq2d 3947	. . . . . . 7 ⊢ ((𝑟 = 𝑇 ∧ 𝑖 = 𝐼) → ({𝑥, 𝑦} ⊆ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↔ {𝑥, 𝑦} ⊆ 𝐷))
13		simpl 486	. . . . . . . . . . . 12 ⊢ ((𝑟 = 𝑇 ∧ 𝑖 = 𝐼) → 𝑟 = 𝑇)
14	13	breqd 5041	. . . . . . . . . . 11 ⊢ ((𝑟 = 𝑇 ∧ 𝑖 = 𝐼) → (𝑧𝑟𝑤 ↔ 𝑧𝑇𝑤))
15	14	imbi1d 345	. . . . . . . . . 10 ⊢ ((𝑟 = 𝑇 ∧ 𝑖 = 𝐼) → ((𝑧𝑟𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)) ↔ (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))
16	6, 15	raleqbidv 3354	. . . . . . . . 9 ⊢ ((𝑟 = 𝑇 ∧ 𝑖 = 𝐼) → (∀𝑤 ∈ 𝑖 (𝑧𝑟𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)) ↔ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))
17	16	anbi2d 631	. . . . . . . 8 ⊢ ((𝑟 = 𝑇 ∧ 𝑖 = 𝐼) → (((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝑖 (𝑧𝑟𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))))
18	6, 17	rexeqbidv 3355	. . . . . . 7 ⊢ ((𝑟 = 𝑇 ∧ 𝑖 = 𝐼) → (∃𝑧 ∈ 𝑖 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝑖 (𝑧𝑟𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ∃𝑧 ∈ 𝐼 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))))
19	12, 18	anbi12d 633	. . . . . 6 ⊢ ((𝑟 = 𝑇 ∧ 𝑖 = 𝐼) → (({𝑥, 𝑦} ⊆ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ∧ ∃𝑧 ∈ 𝑖 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝑖 (𝑧𝑟𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))) ↔ ({𝑥, 𝑦} ⊆ 𝐷 ∧ ∃𝑧 ∈ 𝐼 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))))
20	19	opabbidv 5096	. . . . 5 ⊢ ((𝑟 = 𝑇 ∧ 𝑖 = 𝐼) → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ∧ ∃𝑧 ∈ 𝑖 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝑖 (𝑧𝑟𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐷 ∧ ∃𝑧 ∈ 𝐼 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))})
21		df-ltbag 20597	. . . . 5 ⊢ <bag = (𝑟 ∈ V, 𝑖 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ∧ ∃𝑧 ∈ 𝑖 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝑖 (𝑧𝑟𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))})
22		vex 3444	. . . . . . . . 9 ⊢ 𝑥 ∈ V
23		vex 3444	. . . . . . . . 9 ⊢ 𝑦 ∈ V
24	22, 23	prss 4713	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐷) ↔ {𝑥, 𝑦} ⊆ 𝐷)
25	24	anbi1i 626	. . . . . . 7 ⊢ (((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐷) ∧ ∃𝑧 ∈ 𝐼 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))) ↔ ({𝑥, 𝑦} ⊆ 𝐷 ∧ ∃𝑧 ∈ 𝐼 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))))
26	25	opabbii 5097	. . . . . 6 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐷) ∧ ∃𝑧 ∈ 𝐼 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐷 ∧ ∃𝑧 ∈ 𝐼 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))}
27		ovex 7168	. . . . . . . . 9 ⊢ (ℕ0 ↑m 𝐼) ∈ V
28	10, 27	rabex2 5201	. . . . . . . 8 ⊢ 𝐷 ∈ V
29	28, 28	xpex 7456	. . . . . . 7 ⊢ (𝐷 × 𝐷) ∈ V
30		opabssxp 5607	. . . . . . 7 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐷) ∧ ∃𝑧 ∈ 𝐼 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))} ⊆ (𝐷 × 𝐷)
31	29, 30	ssexi 5190	. . . . . 6 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐷) ∧ ∃𝑧 ∈ 𝐼 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))} ∈ V
32	26, 31	eqeltrri 2887	. . . . 5 ⊢ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐷 ∧ ∃𝑧 ∈ 𝐼 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))} ∈ V
33	20, 21, 32	ovmpoa 7284	. . . 4 ⊢ ((𝑇 ∈ V ∧ 𝐼 ∈ V) → (𝑇 <bag 𝐼) = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐷 ∧ ∃𝑧 ∈ 𝐼 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))})
34	4, 5, 33	syl2an 598	. . 3 ⊢ ((𝑇 ∈ 𝑊 ∧ 𝐼 ∈ 𝑉) → (𝑇 <bag 𝐼) = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐷 ∧ ∃𝑧 ∈ 𝐼 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))})
35	2, 3, 34	syl2anc 587	. 2 ⊢ (𝜑 → (𝑇 <bag 𝐼) = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐷 ∧ ∃𝑧 ∈ 𝐼 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))})
36	1, 35	syl5eq 2845	1 ⊢ (𝜑 → 𝐶 = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐷 ∧ ∃𝑧 ∈ 𝐼 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐼 (𝑧𝑇𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))})

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∀wral 3106  ∃wrex 3107  {crab 3110  Vcvv 3441   ⊆ wss 3881  {cpr 4527   class class class wbr 5030  {copab 5092   × cxp 5517  ^◡ccnv 5518   “ cima 5522  ‘cfv 6324  (class class class)co 7135   ↑_m cmap 8389  Fincfn 8492   < clt 10664  ℕcn 11625  ℕ₀cn0 11885   <_bag cltb 20592

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-iota 6283  df-fun 6326  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-ltbag 20597

This theorem is referenced by:  ltbwe  20712