fimin2g - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > fimin2g		Structured version Visualization version GIF version

Theorem fimin2g 9516

Description: A finite set has a minimum under a total order. (Contributed by AV, 6-Oct-2020.)

**Assertion**
Ref	Expression
fimin2g	⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦𝑅𝑥)

Distinct variable groups: 𝑥,𝑅,𝑦 𝑥,𝐴,𝑦

**Proof of Theorem fimin2g**
Step	Hyp	Ref	Expression
1		3simpc 1150	. 2 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → (𝐴 ∈ Fin ∧ 𝐴 ≠ ∅))
2		sopo 5585	. . . 4 ⊢ (𝑅 Or 𝐴 → 𝑅 Po 𝐴)
3	2	3ad2ant1 1133	. . 3 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → 𝑅 Po 𝐴)
4		simp2 1137	. . 3 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → 𝐴 ∈ Fin)
5		frfi 9298	. . 3 ⊢ ((𝑅 Po 𝐴 ∧ 𝐴 ∈ Fin) → 𝑅 Fr 𝐴)
6	3, 4, 5	syl2anc 584	. 2 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → 𝑅 Fr 𝐴)
7		ssid 3986	. . . 4 ⊢ 𝐴 ⊆ 𝐴
8		fri 5616	. . . 4 ⊢ (((𝐴 ∈ Fin ∧ 𝑅 Fr 𝐴) ∧ (𝐴 ⊆ 𝐴 ∧ 𝐴 ≠ ∅)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦𝑅𝑥)
9	7, 8	mpanr1 703	. . 3 ⊢ (((𝐴 ∈ Fin ∧ 𝑅 Fr 𝐴) ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦𝑅𝑥)
10	9	an32s 652	. 2 ⊢ (((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) ∧ 𝑅 Fr 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦𝑅𝑥)
11	1, 6, 10	syl2anc 584	1 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦𝑅𝑥)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 ∈ wcel 2109 ≠ wne 2933 ∀wral 3052 ∃wrex 3061 ⊆ wss 3931 ∅c0 4313 class class class wbr 5124 Po wpo 5564 Or wor 5565 Fr wfr 5608 Fincfn 8964

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-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pr 5407 ax-un 7734

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-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-br 5125 df-opab 5187 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-om 7867 df-en 8965 df-fin 8968

This theorem is referenced by: fiming 9517

W3C validator