Theorem frinfm 37743

Description: A subset of a well-founded set has an infimum. (Contributed by Jeff Madsen, 2-Sep-2009.)

Assertion

Ref	Expression
frinfm	⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐶 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥◡𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦◡𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦◡𝑅𝑧)))

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

Allowed substitution hint:   𝐶(𝑧)

Proof of Theorem frinfm

Step	Hyp	Ref	Expression
1		fri 5641	. . . . 5 ⊢ (((𝐵 ∈ 𝐶 ∧ 𝑅 Fr 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)
2	1	ancom1s 653	. . . 4 ⊢ (((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐶) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)
3	2	exp43 436	. . 3 ⊢ (𝑅 Fr 𝐴 → (𝐵 ∈ 𝐶 → (𝐵 ⊆ 𝐴 → (𝐵 ≠ ∅ → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥))))
4	3	3imp2 1349	. 2 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐶 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)
5		ssel2 3977	. . . . . . . 8 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐴)
6	5	adantrr 717	. . . . . . 7 ⊢ ((𝐵 ⊆ 𝐴 ∧ (𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)) → 𝑥 ∈ 𝐴)
7		vex 3483	. . . . . . . . . . . 12 ⊢ 𝑥 ∈ V
8		vex 3483	. . . . . . . . . . . 12 ⊢ 𝑦 ∈ V
9	7, 8	brcnv 5892	. . . . . . . . . . 11 ⊢ (𝑥◡𝑅𝑦 ↔ 𝑦𝑅𝑥)
10	9	biimpi 216	. . . . . . . . . 10 ⊢ (𝑥◡𝑅𝑦 → 𝑦𝑅𝑥)
11	10	con3i 154	. . . . . . . . 9 ⊢ (¬ 𝑦𝑅𝑥 → ¬ 𝑥◡𝑅𝑦)
12	11	ralimi 3082	. . . . . . . 8 ⊢ (∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 → ∀𝑦 ∈ 𝐵 ¬ 𝑥◡𝑅𝑦)
13	12	ad2antll 729	. . . . . . 7 ⊢ ((𝐵 ⊆ 𝐴 ∧ (𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)) → ∀𝑦 ∈ 𝐵 ¬ 𝑥◡𝑅𝑦)
14		breq2 5146	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑥 → (𝑦◡𝑅𝑧 ↔ 𝑦◡𝑅𝑥))
15	14	rspcev 3621	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦◡𝑅𝑥) → ∃𝑧 ∈ 𝐵 𝑦◡𝑅𝑧)
16	15	ex 412	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐵 → (𝑦◡𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦◡𝑅𝑧))
17	16	ralrimivw 3149	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐵 → ∀𝑦 ∈ 𝐴 (𝑦◡𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦◡𝑅𝑧))
18	17	ad2antrl 728	. . . . . . 7 ⊢ ((𝐵 ⊆ 𝐴 ∧ (𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)) → ∀𝑦 ∈ 𝐴 (𝑦◡𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦◡𝑅𝑧))
19	6, 13, 18	jca32 515	. . . . . 6 ⊢ ((𝐵 ⊆ 𝐴 ∧ (𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)) → (𝑥 ∈ 𝐴 ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑥◡𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦◡𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦◡𝑅𝑧))))
20	19	ex 412	. . . . 5 ⊢ (𝐵 ⊆ 𝐴 → ((𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) → (𝑥 ∈ 𝐴 ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑥◡𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦◡𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦◡𝑅𝑧)))))
21	20	reximdv2 3163	. . . 4 ⊢ (𝐵 ⊆ 𝐴 → (∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥◡𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦◡𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦◡𝑅𝑧))))
22	21	adantl 481	. . 3 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥◡𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦◡𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦◡𝑅𝑧))))
23	22	3ad2antr2 1189	. 2 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐶 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → (∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥◡𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦◡𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦◡𝑅𝑧))))
24	4, 23	mpd 15	1 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐶 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥◡𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦◡𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦◡𝑅𝑧)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1086   ∈ wcel 2107   ≠ wne 2939  ∀wral 3060  ∃wrex 3069   ⊆ wss 3950  ∅c0 4332   class class class wbr 5142   Fr wfr 5633  ^◡ccnv 5683

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2707  ax-sep 5295  ax-nul 5305  ax-pr 5431

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2064  df-clab 2714  df-cleq 2728  df-clel 2815  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3436  df-v 3481  df-dif 3953  df-un 3955  df-ss 3967  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-br 5143  df-opab 5205  df-fr 5636  df-cnv 5692

This theorem is referenced by:  welb  37744