Theorem somin1 6027

Description: Property of a minimum in a strict order. (Contributed by Stefan O'Rear, 17-Jan-2015.)

Assertion

Ref	Expression
somin1	⊢ ((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → if(𝐴𝑅𝐵, 𝐴, 𝐵)(𝑅 ∪ I )𝐴)

Proof of Theorem somin1

Step	Hyp	Ref	Expression
1		iftrue 4462	. . . . 5 ⊢ (𝐴𝑅𝐵 → if(𝐴𝑅𝐵, 𝐴, 𝐵) = 𝐴)
2	1	olcd 870	. . . 4 ⊢ (𝐴𝑅𝐵 → (if(𝐴𝑅𝐵, 𝐴, 𝐵)𝑅𝐴 ∨ if(𝐴𝑅𝐵, 𝐴, 𝐵) = 𝐴))
3	2	adantl 481	. . 3 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) ∧ 𝐴𝑅𝐵) → (if(𝐴𝑅𝐵, 𝐴, 𝐵)𝑅𝐴 ∨ if(𝐴𝑅𝐵, 𝐴, 𝐵) = 𝐴))
4		sotric 5522	. . . . . . 7 ⊢ ((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝑅𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵𝑅𝐴)))
5		orcom 866	. . . . . . . . 9 ⊢ ((𝐴 = 𝐵 ∨ 𝐵𝑅𝐴) ↔ (𝐵𝑅𝐴 ∨ 𝐴 = 𝐵))
6		eqcom 2745	. . . . . . . . . 10 ⊢ (𝐴 = 𝐵 ↔ 𝐵 = 𝐴)
7	6	orbi2i 909	. . . . . . . . 9 ⊢ ((𝐵𝑅𝐴 ∨ 𝐴 = 𝐵) ↔ (𝐵𝑅𝐴 ∨ 𝐵 = 𝐴))
8	5, 7	bitri 274	. . . . . . . 8 ⊢ ((𝐴 = 𝐵 ∨ 𝐵𝑅𝐴) ↔ (𝐵𝑅𝐴 ∨ 𝐵 = 𝐴))
9	8	notbii 319	. . . . . . 7 ⊢ (¬ (𝐴 = 𝐵 ∨ 𝐵𝑅𝐴) ↔ ¬ (𝐵𝑅𝐴 ∨ 𝐵 = 𝐴))
10	4, 9	bitrdi 286	. . . . . 6 ⊢ ((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝑅𝐵 ↔ ¬ (𝐵𝑅𝐴 ∨ 𝐵 = 𝐴)))
11	10	con2bid 354	. . . . 5 ⊢ ((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐵𝑅𝐴 ∨ 𝐵 = 𝐴) ↔ ¬ 𝐴𝑅𝐵))
12	11	biimpar 477	. . . 4 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) ∧ ¬ 𝐴𝑅𝐵) → (𝐵𝑅𝐴 ∨ 𝐵 = 𝐴))
13		iffalse 4465	. . . . . 6 ⊢ (¬ 𝐴𝑅𝐵 → if(𝐴𝑅𝐵, 𝐴, 𝐵) = 𝐵)
14		breq1 5073	. . . . . . 7 ⊢ (if(𝐴𝑅𝐵, 𝐴, 𝐵) = 𝐵 → (if(𝐴𝑅𝐵, 𝐴, 𝐵)𝑅𝐴 ↔ 𝐵𝑅𝐴))
15		eqeq1 2742	. . . . . . 7 ⊢ (if(𝐴𝑅𝐵, 𝐴, 𝐵) = 𝐵 → (if(𝐴𝑅𝐵, 𝐴, 𝐵) = 𝐴 ↔ 𝐵 = 𝐴))
16	14, 15	orbi12d 915	. . . . . 6 ⊢ (if(𝐴𝑅𝐵, 𝐴, 𝐵) = 𝐵 → ((if(𝐴𝑅𝐵, 𝐴, 𝐵)𝑅𝐴 ∨ if(𝐴𝑅𝐵, 𝐴, 𝐵) = 𝐴) ↔ (𝐵𝑅𝐴 ∨ 𝐵 = 𝐴)))
17	13, 16	syl 17	. . . . 5 ⊢ (¬ 𝐴𝑅𝐵 → ((if(𝐴𝑅𝐵, 𝐴, 𝐵)𝑅𝐴 ∨ if(𝐴𝑅𝐵, 𝐴, 𝐵) = 𝐴) ↔ (𝐵𝑅𝐴 ∨ 𝐵 = 𝐴)))
18	17	adantl 481	. . . 4 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) ∧ ¬ 𝐴𝑅𝐵) → ((if(𝐴𝑅𝐵, 𝐴, 𝐵)𝑅𝐴 ∨ if(𝐴𝑅𝐵, 𝐴, 𝐵) = 𝐴) ↔ (𝐵𝑅𝐴 ∨ 𝐵 = 𝐴)))
19	12, 18	mpbird 256	. . 3 ⊢ (((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) ∧ ¬ 𝐴𝑅𝐵) → (if(𝐴𝑅𝐵, 𝐴, 𝐵)𝑅𝐴 ∨ if(𝐴𝑅𝐵, 𝐴, 𝐵) = 𝐴))
20	3, 19	pm2.61dan 809	. 2 ⊢ ((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (if(𝐴𝑅𝐵, 𝐴, 𝐵)𝑅𝐴 ∨ if(𝐴𝑅𝐵, 𝐴, 𝐵) = 𝐴))
21		poleloe 6025	. . 3 ⊢ (𝐴 ∈ 𝑋 → (if(𝐴𝑅𝐵, 𝐴, 𝐵)(𝑅 ∪ I )𝐴 ↔ (if(𝐴𝑅𝐵, 𝐴, 𝐵)𝑅𝐴 ∨ if(𝐴𝑅𝐵, 𝐴, 𝐵) = 𝐴)))
22	21	ad2antrl 724	. 2 ⊢ ((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (if(𝐴𝑅𝐵, 𝐴, 𝐵)(𝑅 ∪ I )𝐴 ↔ (if(𝐴𝑅𝐵, 𝐴, 𝐵)𝑅𝐴 ∨ if(𝐴𝑅𝐵, 𝐴, 𝐵) = 𝐴)))
23	20, 22	mpbird 256	1 ⊢ ((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → if(𝐴𝑅𝐵, 𝐴, 𝐵)(𝑅 ∪ I )𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   ∨ wo 843   = wceq 1539   ∈ wcel 2108   ∪ cun 3881  ifcif 4456   class class class wbr 5070   I cid 5479   Or wor 5493

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-id 5480  df-po 5494  df-so 5495  df-xp 5586  df-rel 5587

This theorem is referenced by:  somin2  6029  soltmin  6030