Theorem eqinfd 9446

Description: Sufficient condition for an element to be equal to the infimum. (Contributed by AV, 3-Sep-2020.)

Hypotheses

Ref	Expression
infexd.1	⊢ (𝜑 → 𝑅 Or 𝐴)
eqinfd.2	⊢ (𝜑 → 𝐶 ∈ 𝐴)
eqinfd.3	⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ¬ 𝑦𝑅𝐶)
eqinfd.4	⊢ ((𝜑 ∧ (𝑦 ∈ 𝐴 ∧ 𝐶𝑅𝑦)) → ∃𝑧 ∈ 𝐵 𝑧𝑅𝑦)

Assertion

Ref	Expression
eqinfd	⊢ (𝜑 → inf(𝐵, 𝐴, 𝑅) = 𝐶)

Distinct variable groups:   𝑦,𝐴,𝑧   𝑦,𝐵,𝑧   𝑦,𝑅,𝑧   𝑦,𝐶,𝑧   𝜑,𝑦

Allowed substitution hint:   𝜑(𝑧)

Proof of Theorem eqinfd

Step	Hyp	Ref	Expression
1		eqinfd.2	. 2 ⊢ (𝜑 → 𝐶 ∈ 𝐴)
2		eqinfd.3	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ¬ 𝑦𝑅𝐶)
3	2	ralrimiva 3163	. 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝐶)
4		eqinfd.4	. . . 4 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐴 ∧ 𝐶𝑅𝑦)) → ∃𝑧 ∈ 𝐵 𝑧𝑅𝑦)
5	4	expr 461	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐶𝑅𝑦 → ∃𝑧 ∈ 𝐵 𝑧𝑅𝑦))
6	5	ralrimiva 3163	. 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 (𝐶𝑅𝑦 → ∃𝑧 ∈ 𝐵 𝑧𝑅𝑦))
7		infexd.1	. . 3 ⊢ (𝜑 → 𝑅 Or 𝐴)
8	7	eqinf 9445	. 2 ⊢ (𝜑 → ((𝐶 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝐶 ∧ ∀𝑦 ∈ 𝐴 (𝐶𝑅𝑦 → ∃𝑧 ∈ 𝐵 𝑧𝑅𝑦)) → inf(𝐵, 𝐴, 𝑅) = 𝐶))
9	1, 3, 6, 8	mp3and 1490	1 ⊢ (𝜑 → inf(𝐵, 𝐴, 𝑅) = 𝐶)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1567   ∈ wcel 2149  ∀wral 3085  ∃wrex 3095   class class class wbr 5113   Or wor 5569  infcinf 9401

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-pr 5405

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-po 5570  df-so 5571  df-cnv 5670  df-iota 6493  df-riota 7368  df-sup 9402  df-inf 9403

This theorem is referenced by:  infmin  9456  xrinf0  13365  infmremnf  13370  infmrp1  13371