Theorem frpomin2 33100

Description: Every (possibly proper) subclass of a class 𝐴 with a founded, partial-ordering, set-like relation 𝑅 has a minimal element. The additional condition of partial ordering over frmin 33105 enables avoiding infinity. (Contributed by Scott Fenton, 11-Feb-2022.)

Assertion

Ref	Expression
frpomin2	⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑥 ∈ 𝐵 Pred(𝑅, 𝐵, 𝑥) = ∅)

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

Proof of Theorem frpomin2

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		frpomin 33099	. 2 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)
2		vex 3494	. . . . . 6 ⊢ 𝑥 ∈ V
3	2	dfpred3 6151	. . . . 5 ⊢ Pred(𝑅, 𝐵, 𝑥) = {𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥}
4	3	eqeq1i 2825	. . . 4 ⊢ (Pred(𝑅, 𝐵, 𝑥) = ∅ ↔ {𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} = ∅)
5		rabeq0 4331	. . . 4 ⊢ ({𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} = ∅ ↔ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)
6	4, 5	bitri 277	. . 3 ⊢ (Pred(𝑅, 𝐵, 𝑥) = ∅ ↔ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)
7	6	rexbii 3246	. 2 ⊢ (∃𝑥 ∈ 𝐵 Pred(𝑅, 𝐵, 𝑥) = ∅ ↔ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)
8	1, 7	sylibr 236	1 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑥 ∈ 𝐵 Pred(𝑅, 𝐵, 𝑥) = ∅)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 398   ∧ w3a 1082   = wceq 1536   ≠ wne 3015  ∀wral 3137  ∃wrex 3138  {crab 3141   ⊆ wss 3929  ∅c0 4284   class class class wbr 5059   Po wpo 5465   Fr wfr 5504   Se wse 5505  Predcpred 6140

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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-sep 5196  ax-nul 5203  ax-pr 5323

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ne 3016  df-ral 3142  df-rex 3143  df-rab 3146  df-v 3493  df-sbc 3769  df-dif 3932  df-un 3934  df-in 3936  df-ss 3945  df-nul 4285  df-if 4461  df-sn 4561  df-pr 4563  df-op 4567  df-br 5060  df-opab 5122  df-po 5467  df-fr 5507  df-se 5508  df-xp 5554  df-cnv 5556  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141

This theorem is referenced by:  frpoind  33101  fpr1  33160