Theorem soltmin 6130

Description: Being less than a minimum, for a general total order. (Contributed by Stefan O'Rear, 17-Jan-2015.)

Assertion

Ref	Expression
soltmin	⊢ ((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ↔ (𝐴𝑅𝐵 ∧ 𝐴𝑅𝐶)))

Proof of Theorem soltmin

Step	Hyp	Ref	Expression
1		sopo 5585	. . . . . 6 ⊢ (𝑅 Or 𝑋 → 𝑅 Po 𝑋)
2	1	ad2antrr 726	. . . . 5 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝑅 Po 𝑋)
3		simplr1 1216	. . . . . 6 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝐴 ∈ 𝑋)
4		simplr2 1217	. . . . . . 7 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝐵 ∈ 𝑋)
5		simplr3 1218	. . . . . . 7 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝐶 ∈ 𝑋)
6	4, 5	ifcld 4552	. . . . . 6 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝑋)
7	3, 6, 4	3jca 1128	. . . . 5 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → (𝐴 ∈ 𝑋 ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋))
8		simpr 484	. . . . 5 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))
9		simpll 766	. . . . . 6 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝑅 Or 𝑋)
10		somin1 6127	. . . . . 6 ⊢ ((𝑅 Or 𝑋 ∧ (𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐵)
11	9, 4, 5, 10	syl12anc 836	. . . . 5 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐵)
12		poltletr 6126	. . . . . 6 ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐵) → 𝐴𝑅𝐵))
13	12	imp 406	. . . . 5 ⊢ (((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) ∧ (𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐵)) → 𝐴𝑅𝐵)
14	2, 7, 8, 11, 13	syl22anc 838	. . . 4 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝐴𝑅𝐵)
15	3, 6, 5	3jca 1128	. . . . 5 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → (𝐴 ∈ 𝑋 ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝑋 ∧ 𝐶 ∈ 𝑋))
16		somin2 6129	. . . . . 6 ⊢ ((𝑅 Or 𝑋 ∧ (𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐶)
17	9, 4, 5, 16	syl12anc 836	. . . . 5 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐶)
18		poltletr 6126	. . . . . 6 ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐶) → 𝐴𝑅𝐶))
19	18	imp 406	. . . . 5 ⊢ (((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ (𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐶)) → 𝐴𝑅𝐶)
20	2, 15, 8, 17, 19	syl22anc 838	. . . 4 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝐴𝑅𝐶)
21	14, 20	jca 511	. . 3 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → (𝐴𝑅𝐵 ∧ 𝐴𝑅𝐶))
22	21	ex 412	. 2 ⊢ ((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) → (𝐴𝑅𝐵 ∧ 𝐴𝑅𝐶)))
23		breq2 5128	. . 3 ⊢ (𝐵 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (𝐴𝑅𝐵 ↔ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
24		breq2 5128	. . 3 ⊢ (𝐶 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (𝐴𝑅𝐶 ↔ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
25	23, 24	ifboth 4545	. 2 ⊢ ((𝐴𝑅𝐵 ∧ 𝐴𝑅𝐶) → 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))
26	22, 25	impbid1 225	1 ⊢ ((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ↔ (𝐴𝑅𝐵 ∧ 𝐴𝑅𝐶)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   ∈ wcel 2109   ∪ cun 3929  ifcif 4505   class class class wbr 5124   I cid 5552   Po wpo 5564   Or wor 5565

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pr 5407

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2715  df-cleq 2728  df-clel 2810  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-br 5125  df-opab 5187  df-id 5553  df-po 5566  df-so 5567  df-xp 5665  df-rel 5666

This theorem is referenced by:  wemaplem2  9566