Theorem safesnsupfilb 43848

Description: If 𝐵 is a finite subset of ordered class 𝐴, we can safely create a small subset with the same largest element and upper bound, if any. (Contributed by RP, 3-Sep-2024.)

Hypotheses

Ref	Expression
safesnsupfilb.small	⊢ (𝜑 → (𝑂 = ∅ ∨ 𝑂 = 1o))
safesnsupfilb.finite	⊢ (𝜑 → 𝐵 ∈ Fin)
safesnsupfilb.subset	⊢ (𝜑 → 𝐵 ⊆ 𝐴)
safesnsupfilb.ordered	⊢ (𝜑 → 𝑅 Or 𝐴)

Assertion

Ref	Expression
safesnsupfilb	⊢ (𝜑 → ∀𝑥 ∈ (𝐵 ∖ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵))∀𝑦 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)𝑥𝑅𝑦)

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝑂,𝑦   𝑥,𝑅,𝑦   𝜑,𝑥

Allowed substitution hint:   𝜑(𝑦)

Proof of Theorem safesnsupfilb

Step	Hyp	Ref	Expression
1		safesnsupfilb.ordered	. . . . . . 7 ⊢ (𝜑 → 𝑅 Or 𝐴)
2	1	ad2antrr 727	. . . . . 6 ⊢ (((𝜑 ∧ 𝑂 ≺ 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑅 Or 𝐴)
3		safesnsupfilb.subset	. . . . . . 7 ⊢ (𝜑 → 𝐵 ⊆ 𝐴)
4	3	ad2antrr 727	. . . . . 6 ⊢ (((𝜑 ∧ 𝑂 ≺ 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝐵 ⊆ 𝐴)
5		safesnsupfilb.finite	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ Fin)
6	5	ad2antrr 727	. . . . . 6 ⊢ (((𝜑 ∧ 𝑂 ≺ 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝐵 ∈ Fin)
7		simpr 484	. . . . . 6 ⊢ (((𝜑 ∧ 𝑂 ≺ 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
8		eqidd 2738	. . . . . 6 ⊢ (((𝜑 ∧ 𝑂 ≺ 𝐵) ∧ 𝑥 ∈ 𝐵) → sup(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, 𝑅))
9	2, 4, 6, 7, 8	supgtoreq 9375	. . . . 5 ⊢ (((𝜑 ∧ 𝑂 ≺ 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑥𝑅sup(𝐵, 𝐴, 𝑅) ∨ 𝑥 = sup(𝐵, 𝐴, 𝑅)))
10		df-or 849	. . . . . 6 ⊢ ((𝑥 = sup(𝐵, 𝐴, 𝑅) ∨ 𝑥𝑅sup(𝐵, 𝐴, 𝑅)) ↔ (¬ 𝑥 = sup(𝐵, 𝐴, 𝑅) → 𝑥𝑅sup(𝐵, 𝐴, 𝑅)))
11		orcom 871	. . . . . 6 ⊢ ((𝑥𝑅sup(𝐵, 𝐴, 𝑅) ∨ 𝑥 = sup(𝐵, 𝐴, 𝑅)) ↔ (𝑥 = sup(𝐵, 𝐴, 𝑅) ∨ 𝑥𝑅sup(𝐵, 𝐴, 𝑅)))
12		df-ne 2934	. . . . . . 7 ⊢ (𝑥 ≠ sup(𝐵, 𝐴, 𝑅) ↔ ¬ 𝑥 = sup(𝐵, 𝐴, 𝑅))
13	12	imbi1i 349	. . . . . 6 ⊢ ((𝑥 ≠ sup(𝐵, 𝐴, 𝑅) → 𝑥𝑅sup(𝐵, 𝐴, 𝑅)) ↔ (¬ 𝑥 = sup(𝐵, 𝐴, 𝑅) → 𝑥𝑅sup(𝐵, 𝐴, 𝑅)))
14	10, 11, 13	3bitr4i 303	. . . . 5 ⊢ ((𝑥𝑅sup(𝐵, 𝐴, 𝑅) ∨ 𝑥 = sup(𝐵, 𝐴, 𝑅)) ↔ (𝑥 ≠ sup(𝐵, 𝐴, 𝑅) → 𝑥𝑅sup(𝐵, 𝐴, 𝑅)))
15	9, 14	sylib 218	. . . 4 ⊢ (((𝜑 ∧ 𝑂 ≺ 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑥 ≠ sup(𝐵, 𝐴, 𝑅) → 𝑥𝑅sup(𝐵, 𝐴, 𝑅)))
16	15	ralrimiva 3130	. . 3 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → ∀𝑥 ∈ 𝐵 (𝑥 ≠ sup(𝐵, 𝐴, 𝑅) → 𝑥𝑅sup(𝐵, 𝐴, 𝑅)))
17		iftrue 4473	. . . . . . 7 ⊢ (𝑂 ≺ 𝐵 → if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) = {sup(𝐵, 𝐴, 𝑅)})
18	17	difeq2d 4067	. . . . . 6 ⊢ (𝑂 ≺ 𝐵 → (𝐵 ∖ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)) = (𝐵 ∖ {sup(𝐵, 𝐴, 𝑅)}))
19	18	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → (𝐵 ∖ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)) = (𝐵 ∖ {sup(𝐵, 𝐴, 𝑅)}))
20	19	raleqdv 3296	. . . 4 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → (∀𝑥 ∈ (𝐵 ∖ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵))∀𝑦 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)𝑥𝑅𝑦 ↔ ∀𝑥 ∈ (𝐵 ∖ {sup(𝐵, 𝐴, 𝑅)})∀𝑦 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)𝑥𝑅𝑦))
21		simpr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → 𝑂 ≺ 𝐵)
22	21	iftrued 4475	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) = {sup(𝐵, 𝐴, 𝑅)})
23	22	raleqdv 3296	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → (∀𝑦 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)𝑥𝑅𝑦 ↔ ∀𝑦 ∈ {sup(𝐵, 𝐴, 𝑅)}𝑥𝑅𝑦))
24	5	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → 𝐵 ∈ Fin)
25		safesnsupfilb.small	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑂 = ∅ ∨ 𝑂 = 1o))
26	25	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → (𝑂 = ∅ ∨ 𝑂 = 1o))
27		0elon 6370	. . . . . . . . . . . . . 14 ⊢ ∅ ∈ On
28		eleq1 2825	. . . . . . . . . . . . . 14 ⊢ (𝑂 = ∅ → (𝑂 ∈ On ↔ ∅ ∈ On))
29	27, 28	mpbiri 258	. . . . . . . . . . . . 13 ⊢ (𝑂 = ∅ → 𝑂 ∈ On)
30		1on 8408	. . . . . . . . . . . . . 14 ⊢ 1o ∈ On
31		eleq1 2825	. . . . . . . . . . . . . 14 ⊢ (𝑂 = 1o → (𝑂 ∈ On ↔ 1o ∈ On))
32	30, 31	mpbiri 258	. . . . . . . . . . . . 13 ⊢ (𝑂 = 1o → 𝑂 ∈ On)
33	29, 32	jaoi 858	. . . . . . . . . . . 12 ⊢ ((𝑂 = ∅ ∨ 𝑂 = 1o) → 𝑂 ∈ On)
34	26, 33	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → 𝑂 ∈ On)
35	21, 34	sdomne0d 43844	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → 𝐵 ≠ ∅)
36	3	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → 𝐵 ⊆ 𝐴)
37	24, 35, 36	3jca 1129	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → (𝐵 ∈ Fin ∧ 𝐵 ≠ ∅ ∧ 𝐵 ⊆ 𝐴))
38		fisupcl 9374	. . . . . . . . 9 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ Fin ∧ 𝐵 ≠ ∅ ∧ 𝐵 ⊆ 𝐴)) → sup(𝐵, 𝐴, 𝑅) ∈ 𝐵)
39	1, 37, 38	syl2an2r 686	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → sup(𝐵, 𝐴, 𝑅) ∈ 𝐵)
40		breq2 5090	. . . . . . . . 9 ⊢ (𝑦 = sup(𝐵, 𝐴, 𝑅) → (𝑥𝑅𝑦 ↔ 𝑥𝑅sup(𝐵, 𝐴, 𝑅)))
41	40	ralsng 4620	. . . . . . . 8 ⊢ (sup(𝐵, 𝐴, 𝑅) ∈ 𝐵 → (∀𝑦 ∈ {sup(𝐵, 𝐴, 𝑅)}𝑥𝑅𝑦 ↔ 𝑥𝑅sup(𝐵, 𝐴, 𝑅)))
42	39, 41	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → (∀𝑦 ∈ {sup(𝐵, 𝐴, 𝑅)}𝑥𝑅𝑦 ↔ 𝑥𝑅sup(𝐵, 𝐴, 𝑅)))
43	23, 42	bitrd 279	. . . . . 6 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → (∀𝑦 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)𝑥𝑅𝑦 ↔ 𝑥𝑅sup(𝐵, 𝐴, 𝑅)))
44	43	ralbidv 3161	. . . . 5 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → (∀𝑥 ∈ (𝐵 ∖ {sup(𝐵, 𝐴, 𝑅)})∀𝑦 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)𝑥𝑅𝑦 ↔ ∀𝑥 ∈ (𝐵 ∖ {sup(𝐵, 𝐴, 𝑅)})𝑥𝑅sup(𝐵, 𝐴, 𝑅)))
45		raldifsnb 4740	. . . . 5 ⊢ (∀𝑥 ∈ 𝐵 (𝑥 ≠ sup(𝐵, 𝐴, 𝑅) → 𝑥𝑅sup(𝐵, 𝐴, 𝑅)) ↔ ∀𝑥 ∈ (𝐵 ∖ {sup(𝐵, 𝐴, 𝑅)})𝑥𝑅sup(𝐵, 𝐴, 𝑅))
46	44, 45	bitr4di 289	. . . 4 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → (∀𝑥 ∈ (𝐵 ∖ {sup(𝐵, 𝐴, 𝑅)})∀𝑦 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)𝑥𝑅𝑦 ↔ ∀𝑥 ∈ 𝐵 (𝑥 ≠ sup(𝐵, 𝐴, 𝑅) → 𝑥𝑅sup(𝐵, 𝐴, 𝑅))))
47	20, 46	bitrd 279	. . 3 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → (∀𝑥 ∈ (𝐵 ∖ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵))∀𝑦 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)𝑥𝑅𝑦 ↔ ∀𝑥 ∈ 𝐵 (𝑥 ≠ sup(𝐵, 𝐴, 𝑅) → 𝑥𝑅sup(𝐵, 𝐴, 𝑅))))
48	16, 47	mpbird 257	. 2 ⊢ ((𝜑 ∧ 𝑂 ≺ 𝐵) → ∀𝑥 ∈ (𝐵 ∖ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵))∀𝑦 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)𝑥𝑅𝑦)
49		ral0 4439	. . 3 ⊢ ∀𝑥 ∈ ∅ ∀𝑦 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)𝑥𝑅𝑦
50		iffalse 4476	. . . . . . 7 ⊢ (¬ 𝑂 ≺ 𝐵 → if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) = 𝐵)
51	50	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝑂 ≺ 𝐵) → if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) = 𝐵)
52	51	difeq2d 4067	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑂 ≺ 𝐵) → (𝐵 ∖ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)) = (𝐵 ∖ 𝐵))
53		difid 4317	. . . . 5 ⊢ (𝐵 ∖ 𝐵) = ∅
54	52, 53	eqtrdi 2788	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑂 ≺ 𝐵) → (𝐵 ∖ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)) = ∅)
55	54	raleqdv 3296	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑂 ≺ 𝐵) → (∀𝑥 ∈ (𝐵 ∖ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵))∀𝑦 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)𝑥𝑅𝑦 ↔ ∀𝑥 ∈ ∅ ∀𝑦 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)𝑥𝑅𝑦))
56	49, 55	mpbiri 258	. 2 ⊢ ((𝜑 ∧ ¬ 𝑂 ≺ 𝐵) → ∀𝑥 ∈ (𝐵 ∖ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵))∀𝑦 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)𝑥𝑅𝑦)
57	48, 56	pm2.61dan 813	1 ⊢ (𝜑 → ∀𝑥 ∈ (𝐵 ∖ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵))∀𝑦 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)𝑥𝑅𝑦)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052   ∖ cdif 3887   ⊆ wss 3890  ∅c0 4274  ifcif 4467  {csn 4568   class class class wbr 5086   Or wor 5529  Oncon0 6315  1_oc1o 8389   ≺ csdm 8883  Fincfn 8884  supcsup 9344

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-sep 5231  ax-nul 5241  ax-pow 5300  ax-pr 5368  ax-un 7680

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-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  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-br 5087  df-opab 5149  df-tr 5194  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7315  df-om 7809  df-1o 8396  df-er 8634  df-en 8885  df-dom 8886  df-sdom 8887  df-fin 8888  df-sup 9346

This theorem is referenced by: (None)