Theorem soltmin 6101

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 5559	. . . . . 6 ⊢ (𝑅 Or 𝑋 → 𝑅 Po 𝑋)
2	1	ad2antrr 727	. . . . 5 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝑅 Po 𝑋)
3		simplr1 1217	. . . . . 6 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝐴 ∈ 𝑋)
4		simplr2 1218	. . . . . . 7 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝐵 ∈ 𝑋)
5		simplr3 1219	. . . . . . 7 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝐶 ∈ 𝑋)
6	4, 5	ifcld 4528	. . . . . 6 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝑋)
7	3, 6, 4	3jca 1129	. . . . 5 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → (𝐴 ∈ 𝑋 ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋))
8		simpr 484	. . . . 5 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))
9		simpll 767	. . . . . 6 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝑅 Or 𝑋)
10		somin1 6098	. . . . . 6 ⊢ ((𝑅 Or 𝑋 ∧ (𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐵)
11	9, 4, 5, 10	syl12anc 837	. . . . 5 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐵)
12		poltletr 6097	. . . . . 6 ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐵) → 𝐴𝑅𝐵))
13	12	imp 406	. . . . 5 ⊢ (((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) ∧ (𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐵)) → 𝐴𝑅𝐵)
14	2, 7, 8, 11, 13	syl22anc 839	. . . 4 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝐴𝑅𝐵)
15	3, 6, 5	3jca 1129	. . . . 5 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → (𝐴 ∈ 𝑋 ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝑋 ∧ 𝐶 ∈ 𝑋))
16		somin2 6100	. . . . . 6 ⊢ ((𝑅 Or 𝑋 ∧ (𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐶)
17	9, 4, 5, 16	syl12anc 837	. . . . 5 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐶)
18		poltletr 6097	. . . . . 6 ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐶) → 𝐴𝑅𝐶))
19	18	imp 406	. . . . 5 ⊢ (((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ (𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ∧ if(𝐵𝑅𝐶, 𝐵, 𝐶)(𝑅 ∪ I )𝐶)) → 𝐴𝑅𝐶)
20	2, 15, 8, 17, 19	syl22anc 839	. . . 4 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → 𝐴𝑅𝐶)
21	14, 20	jca 511	. . 3 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)) → (𝐴𝑅𝐵 ∧ 𝐴𝑅𝐶))
22	21	ex 412	. 2 ⊢ ((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) → (𝐴𝑅𝐵 ∧ 𝐴𝑅𝐶)))
23		breq2 5104	. . 3 ⊢ (𝐵 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (𝐴𝑅𝐵 ↔ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
24		breq2 5104	. . 3 ⊢ (𝐶 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (𝐴𝑅𝐶 ↔ 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
25	23, 24	ifboth 4521	. 2 ⊢ ((𝐴𝑅𝐵 ∧ 𝐴𝑅𝐶) → 𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))
26	22, 25	impbid1 225	1 ⊢ ((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ↔ (𝐴𝑅𝐵 ∧ 𝐴𝑅𝐶)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   ∈ wcel 2114   ∪ cun 3901  ifcif 4481   class class class wbr 5100   I cid 5526   Po wpo 5538   Or wor 5539

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-ext 2709  ax-sep 5243  ax-pr 5379

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-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-id 5527  df-po 5540  df-so 5541  df-xp 5638  df-rel 5639

This theorem is referenced by:  wemaplem2  9464