xrlemininf - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > xrlemininf		GIF version

Theorem xrlemininf 11072

Description: Two ways of saying a number is less than or equal to the minimum of two others. (Contributed by Mario Carneiro, 18-Jun-2014.) (Revised by Jim Kingdon, 4-May-2023.)

**Assertion**
Ref	Expression
xrlemininf	⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝐴 ≤ inf({𝐵, 𝐶}, ℝ^, < ) ↔ (𝐴 ≤ 𝐵 ∧ 𝐴 ≤ 𝐶)))

**Proof of Theorem xrlemininf**
Step	Hyp	Ref	Expression
1		xrminmax 11066	. . . 4 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → inf({𝐵, 𝐶}, ℝ^, < ) = -_𝑒sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^*, < ))
2	1	breq2d 3949	. . 3 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝐴 ≤ inf({𝐵, 𝐶}, ℝ^, < ) ↔ 𝐴 ≤ -_𝑒sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^*, < )))
3	2	3adant1 1000	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝐴 ≤ inf({𝐵, 𝐶}, ℝ^, < ) ↔ 𝐴 ≤ -_𝑒sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^*, < )))
4		xnegcl 9645	. . . . . 6 ⊢ (𝐵 ∈ ℝ^* → -_𝑒𝐵 ∈ ℝ^*)
5	4	3ad2ant2 1004	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → -_𝑒𝐵 ∈ ℝ^)
6		xnegcl 9645	. . . . . 6 ⊢ (𝐶 ∈ ℝ^* → -_𝑒𝐶 ∈ ℝ^*)
7	6	3ad2ant3 1005	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → -_𝑒𝐶 ∈ ℝ^)
8		xrmaxcl 11053	. . . . 5 ⊢ ((-_𝑒𝐵 ∈ ℝ^* ∧ -_𝑒𝐶 ∈ ℝ^) → sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^, < ) ∈ ℝ^*)
9	5, 7, 8	syl2anc 409	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^, < ) ∈ ℝ^*)
10		xnegcl 9645	. . . . 5 ⊢ (𝐴 ∈ ℝ^* → -_𝑒𝐴 ∈ ℝ^*)
11	10	3ad2ant1 1003	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → -_𝑒𝐴 ∈ ℝ^)
12		xleneg 9650	. . . 4 ⊢ ((sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^, < ) ∈ ℝ^ ∧ -_𝑒𝐴 ∈ ℝ^) → (sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^, < ) ≤ -_𝑒𝐴 ↔ -_𝑒-_𝑒𝐴 ≤ -_𝑒sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^*, < )))
13	9, 11, 12	syl2anc 409	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^, < ) ≤ -_𝑒𝐴 ↔ -_𝑒-_𝑒𝐴 ≤ -_𝑒sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^*, < )))
14		xnegneg 9646	. . . . 5 ⊢ (𝐴 ∈ ℝ^* → -_𝑒-_𝑒𝐴 = 𝐴)
15	14	3ad2ant1 1003	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → -_𝑒-_𝑒𝐴 = 𝐴)
16	15	breq1d 3947	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (-_𝑒-_𝑒𝐴 ≤ -_𝑒sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^, < ) ↔ 𝐴 ≤ -_𝑒sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^*, < )))
17	13, 16	bitrd 187	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^, < ) ≤ -_𝑒𝐴 ↔ 𝐴 ≤ -_𝑒sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^*, < )))
18		xrmaxlesup 11060	. . . 4 ⊢ ((-_𝑒𝐵 ∈ ℝ^* ∧ -_𝑒𝐶 ∈ ℝ^* ∧ -_𝑒𝐴 ∈ ℝ^) → (sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^, < ) ≤ -_𝑒𝐴 ↔ (-_𝑒𝐵 ≤ -_𝑒𝐴 ∧ -_𝑒𝐶 ≤ -_𝑒𝐴)))
19	5, 7, 11, 18	syl3anc 1217	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^, < ) ≤ -_𝑒𝐴 ↔ (-_𝑒𝐵 ≤ -_𝑒𝐴 ∧ -_𝑒𝐶 ≤ -_𝑒𝐴)))
20		xleneg 9650	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 ≤ 𝐵 ↔ -_𝑒𝐵 ≤ -_𝑒𝐴))
21	20	3adant3 1002	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → (𝐴 ≤ 𝐵 ↔ -_𝑒𝐵 ≤ -_𝑒𝐴))
22		xleneg 9650	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → (𝐴 ≤ 𝐶 ↔ -_𝑒𝐶 ≤ -_𝑒𝐴))
23	22	3adant2 1001	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → (𝐴 ≤ 𝐶 ↔ -_𝑒𝐶 ≤ -_𝑒𝐴))
24	21, 23	anbi12d 465	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → ((𝐴 ≤ 𝐵 ∧ 𝐴 ≤ 𝐶) ↔ (-_𝑒𝐵 ≤ -_𝑒𝐴 ∧ -_𝑒𝐶 ≤ -_𝑒𝐴)))
25	19, 24	bitr4d 190	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (sup({-_𝑒𝐵, -_𝑒𝐶}, ℝ^, < ) ≤ -_𝑒𝐴 ↔ (𝐴 ≤ 𝐵 ∧ 𝐴 ≤ 𝐶)))
26	3, 17, 25	3bitr2d 215	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝐴 ≤ inf({𝐵, 𝐶}, ℝ^, < ) ↔ (𝐴 ≤ 𝐵 ∧ 𝐴 ≤ 𝐶)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∧ w3a 963 = wceq 1332 ∈ wcel 1481 {cpr 3533 class class class wbr 3937 supcsup 6877 infcinf 6878 ℝ^*cxr 7823 < clt 7824 ≤ cle 7825 -_𝑒cxne 9586

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-13 1492 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-coll 4051 ax-sep 4054 ax-nul 4062 ax-pow 4106 ax-pr 4139 ax-un 4363 ax-setind 4460 ax-iinf 4510 ax-cnex 7735 ax-resscn 7736 ax-1cn 7737 ax-1re 7738 ax-icn 7739 ax-addcl 7740 ax-addrcl 7741 ax-mulcl 7742 ax-mulrcl 7743 ax-addcom 7744 ax-mulcom 7745 ax-addass 7746 ax-mulass 7747 ax-distr 7748 ax-i2m1 7749 ax-0lt1 7750 ax-1rid 7751 ax-0id 7752 ax-rnegex 7753 ax-precex 7754 ax-cnre 7755 ax-pre-ltirr 7756 ax-pre-ltwlin 7757 ax-pre-lttrn 7758 ax-pre-apti 7759 ax-pre-ltadd 7760 ax-pre-mulgt0 7761 ax-pre-mulext 7762 ax-arch 7763 ax-caucvg 7764

This theorem depends on definitions: df-bi 116 df-dc 821 df-3or 964 df-3an 965 df-tru 1335 df-fal 1338 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ne 2310 df-nel 2405 df-ral 2422 df-rex 2423 df-reu 2424 df-rmo 2425 df-rab 2426 df-v 2691 df-sbc 2914 df-csb 3008 df-dif 3078 df-un 3080 df-in 3082 df-ss 3089 df-nul 3369 df-if 3480 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-int 3780 df-iun 3823 df-br 3938 df-opab 3998 df-mpt 3999 df-tr 4035 df-id 4223 df-po 4226 df-iso 4227 df-iord 4296 df-on 4298 df-ilim 4299 df-suc 4301 df-iom 4513 df-xp 4553 df-rel 4554 df-cnv 4555 df-co 4556 df-dm 4557 df-rn 4558 df-res 4559 df-ima 4560 df-iota 5096 df-fun 5133 df-fn 5134 df-f 5135 df-f1 5136 df-fo 5137 df-f1o 5138 df-fv 5139 df-isom 5140 df-riota 5738 df-ov 5785 df-oprab 5786 df-mpo 5787 df-1st 6046 df-2nd 6047 df-recs 6210 df-frec 6296 df-sup 6879 df-inf 6880 df-pnf 7826 df-mnf 7827 df-xr 7828 df-ltxr 7829 df-le 7830 df-sub 7959 df-neg 7960 df-reap 8361 df-ap 8368 df-div 8457 df-inn 8745 df-2 8803 df-3 8804 df-4 8805 df-n0 9002 df-z 9079 df-uz 9351 df-rp 9471 df-xneg 9589 df-seqfrec 10250 df-exp 10324 df-cj 10646 df-re 10647 df-im 10648 df-rsqrt 10802 df-abs 10803

This theorem is referenced by: xrbdtri 11077 bdxmet 12709 bdmet 12710

W3C validator