Theorem tosglblem 32966

Description: Lemma for tosglb 32967 and xrsclat 33003. (Contributed by Thierry Arnoux, 17-Feb-2018.) (Revised by NM, 15-Sep-2018.)

Hypotheses

Ref	Expression
tosglb.b	⊢ 𝐵 = (Base‘𝐾)
tosglb.l	⊢ < = (lt‘𝐾)
tosglb.1	⊢ (𝜑 → 𝐾 ∈ Toset)
tosglb.2	⊢ (𝜑 → 𝐴 ⊆ 𝐵)
tosglb.e	⊢ ≤ = (le‘𝐾)

Assertion

Ref	Expression
tosglblem	⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → ((∀𝑏 ∈ 𝐴 𝑎 ≤ 𝑏 ∧ ∀𝑐 ∈ 𝐵 (∀𝑏 ∈ 𝐴 𝑐 ≤ 𝑏 → 𝑐 ≤ 𝑎)) ↔ (∀𝑏 ∈ 𝐴 ¬ 𝑎◡ < 𝑏 ∧ ∀𝑏 ∈ 𝐵 (𝑏◡ < 𝑎 → ∃𝑑 ∈ 𝐴 𝑏◡ < 𝑑))))

Distinct variable groups:   𝑎,𝑏,𝑐,𝑑, <   𝐴,𝑎,𝑏,𝑐,𝑑   𝐵,𝑎,𝑏,𝑐,𝑑   𝐾,𝑎,𝑏,𝑐   𝜑,𝑎,𝑏,𝑐

Allowed substitution hints:   𝜑(𝑑)   𝐾(𝑑)   ≤ (𝑎,𝑏,𝑐,𝑑)

Proof of Theorem tosglblem

Step	Hyp	Ref	Expression
1		tosglb.1	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ Toset)
2	1	ad2antrr 726	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑏 ∈ 𝐴) → 𝐾 ∈ Toset)
3		tosglb.2	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ⊆ 𝐵)
4	3	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝐴 ⊆ 𝐵)
5	4	sselda 3931	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑏 ∈ 𝐴) → 𝑏 ∈ 𝐵)
6		simplr 768	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑏 ∈ 𝐴) → 𝑎 ∈ 𝐵)
7		tosglb.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐾)
8		tosglb.e	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
9		tosglb.l	. . . . . . 7 ⊢ < = (lt‘𝐾)
10	7, 8, 9	tltnle 18336	. . . . . 6 ⊢ ((𝐾 ∈ Toset ∧ 𝑏 ∈ 𝐵 ∧ 𝑎 ∈ 𝐵) → (𝑏 < 𝑎 ↔ ¬ 𝑎 ≤ 𝑏))
11	2, 5, 6, 10	syl3anc 1373	. . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑏 ∈ 𝐴) → (𝑏 < 𝑎 ↔ ¬ 𝑎 ≤ 𝑏))
12	11	con2bid 354	. . . 4 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑏 ∈ 𝐴) → (𝑎 ≤ 𝑏 ↔ ¬ 𝑏 < 𝑎))
13	12	ralbidva 3155	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (∀𝑏 ∈ 𝐴 𝑎 ≤ 𝑏 ↔ ∀𝑏 ∈ 𝐴 ¬ 𝑏 < 𝑎))
14	3	ad2antrr 726	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑐 ∈ 𝐵) ∧ 𝑏 ∈ 𝐴) → 𝐴 ⊆ 𝐵)
15		simpr 484	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑐 ∈ 𝐵) ∧ 𝑏 ∈ 𝐴) → 𝑏 ∈ 𝐴)
16	14, 15	sseldd 3932	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑐 ∈ 𝐵) ∧ 𝑏 ∈ 𝐴) → 𝑏 ∈ 𝐵)
17	7, 8, 9	tltnle 18336	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ Toset ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵) → (𝑏 < 𝑐 ↔ ¬ 𝑐 ≤ 𝑏))
18	1, 17	syl3an1 1163	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵) → (𝑏 < 𝑐 ↔ ¬ 𝑐 ≤ 𝑏))
19	18	3com23 1126	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑏 < 𝑐 ↔ ¬ 𝑐 ≤ 𝑏))
20	19	3expa 1118	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑐 ∈ 𝐵) ∧ 𝑏 ∈ 𝐵) → (𝑏 < 𝑐 ↔ ¬ 𝑐 ≤ 𝑏))
21	20	con2bid 354	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑐 ∈ 𝐵) ∧ 𝑏 ∈ 𝐵) → (𝑐 ≤ 𝑏 ↔ ¬ 𝑏 < 𝑐))
22	16, 21	syldan 591	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑐 ∈ 𝐵) ∧ 𝑏 ∈ 𝐴) → (𝑐 ≤ 𝑏 ↔ ¬ 𝑏 < 𝑐))
23	22	ralbidva 3155	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐵) → (∀𝑏 ∈ 𝐴 𝑐 ≤ 𝑏 ↔ ∀𝑏 ∈ 𝐴 ¬ 𝑏 < 𝑐))
24		breq1 5098	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑑 → (𝑏 < 𝑐 ↔ 𝑑 < 𝑐))
25	24	notbid 318	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑑 → (¬ 𝑏 < 𝑐 ↔ ¬ 𝑑 < 𝑐))
26	25	cbvralvw 3212	. . . . . . . . . 10 ⊢ (∀𝑏 ∈ 𝐴 ¬ 𝑏 < 𝑐 ↔ ∀𝑑 ∈ 𝐴 ¬ 𝑑 < 𝑐)
27		ralnex 3060	. . . . . . . . . 10 ⊢ (∀𝑑 ∈ 𝐴 ¬ 𝑑 < 𝑐 ↔ ¬ ∃𝑑 ∈ 𝐴 𝑑 < 𝑐)
28	26, 27	bitri 275	. . . . . . . . 9 ⊢ (∀𝑏 ∈ 𝐴 ¬ 𝑏 < 𝑐 ↔ ¬ ∃𝑑 ∈ 𝐴 𝑑 < 𝑐)
29	23, 28	bitrdi 287	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐵) → (∀𝑏 ∈ 𝐴 𝑐 ≤ 𝑏 ↔ ¬ ∃𝑑 ∈ 𝐴 𝑑 < 𝑐))
30	29	adantlr 715	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑐 ∈ 𝐵) → (∀𝑏 ∈ 𝐴 𝑐 ≤ 𝑏 ↔ ¬ ∃𝑑 ∈ 𝐴 𝑑 < 𝑐))
31	1	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑐 ∈ 𝐵) → 𝐾 ∈ Toset)
32		simplr 768	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑐 ∈ 𝐵) → 𝑎 ∈ 𝐵)
33		simpr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑐 ∈ 𝐵) → 𝑐 ∈ 𝐵)
34	7, 8, 9	tltnle 18336	. . . . . . . . 9 ⊢ ((𝐾 ∈ Toset ∧ 𝑎 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵) → (𝑎 < 𝑐 ↔ ¬ 𝑐 ≤ 𝑎))
35	31, 32, 33, 34	syl3anc 1373	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑐 ∈ 𝐵) → (𝑎 < 𝑐 ↔ ¬ 𝑐 ≤ 𝑎))
36	35	con2bid 354	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑐 ∈ 𝐵) → (𝑐 ≤ 𝑎 ↔ ¬ 𝑎 < 𝑐))
37	30, 36	imbi12d 344	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑐 ∈ 𝐵) → ((∀𝑏 ∈ 𝐴 𝑐 ≤ 𝑏 → 𝑐 ≤ 𝑎) ↔ (¬ ∃𝑑 ∈ 𝐴 𝑑 < 𝑐 → ¬ 𝑎 < 𝑐)))
38		con34b 316	. . . . . 6 ⊢ ((𝑎 < 𝑐 → ∃𝑑 ∈ 𝐴 𝑑 < 𝑐) ↔ (¬ ∃𝑑 ∈ 𝐴 𝑑 < 𝑐 → ¬ 𝑎 < 𝑐))
39	37, 38	bitr4di 289	. . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ 𝑐 ∈ 𝐵) → ((∀𝑏 ∈ 𝐴 𝑐 ≤ 𝑏 → 𝑐 ≤ 𝑎) ↔ (𝑎 < 𝑐 → ∃𝑑 ∈ 𝐴 𝑑 < 𝑐)))
40	39	ralbidva 3155	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (∀𝑐 ∈ 𝐵 (∀𝑏 ∈ 𝐴 𝑐 ≤ 𝑏 → 𝑐 ≤ 𝑎) ↔ ∀𝑐 ∈ 𝐵 (𝑎 < 𝑐 → ∃𝑑 ∈ 𝐴 𝑑 < 𝑐)))
41		breq2 5099	. . . . . 6 ⊢ (𝑏 = 𝑐 → (𝑎 < 𝑏 ↔ 𝑎 < 𝑐))
42		breq2 5099	. . . . . . 7 ⊢ (𝑏 = 𝑐 → (𝑑 < 𝑏 ↔ 𝑑 < 𝑐))
43	42	rexbidv 3158	. . . . . 6 ⊢ (𝑏 = 𝑐 → (∃𝑑 ∈ 𝐴 𝑑 < 𝑏 ↔ ∃𝑑 ∈ 𝐴 𝑑 < 𝑐))
44	41, 43	imbi12d 344	. . . . 5 ⊢ (𝑏 = 𝑐 → ((𝑎 < 𝑏 → ∃𝑑 ∈ 𝐴 𝑑 < 𝑏) ↔ (𝑎 < 𝑐 → ∃𝑑 ∈ 𝐴 𝑑 < 𝑐)))
45	44	cbvralvw 3212	. . . 4 ⊢ (∀𝑏 ∈ 𝐵 (𝑎 < 𝑏 → ∃𝑑 ∈ 𝐴 𝑑 < 𝑏) ↔ ∀𝑐 ∈ 𝐵 (𝑎 < 𝑐 → ∃𝑑 ∈ 𝐴 𝑑 < 𝑐))
46	40, 45	bitr4di 289	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (∀𝑐 ∈ 𝐵 (∀𝑏 ∈ 𝐴 𝑐 ≤ 𝑏 → 𝑐 ≤ 𝑎) ↔ ∀𝑏 ∈ 𝐵 (𝑎 < 𝑏 → ∃𝑑 ∈ 𝐴 𝑑 < 𝑏)))
47	13, 46	anbi12d 632	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → ((∀𝑏 ∈ 𝐴 𝑎 ≤ 𝑏 ∧ ∀𝑐 ∈ 𝐵 (∀𝑏 ∈ 𝐴 𝑐 ≤ 𝑏 → 𝑐 ≤ 𝑎)) ↔ (∀𝑏 ∈ 𝐴 ¬ 𝑏 < 𝑎 ∧ ∀𝑏 ∈ 𝐵 (𝑎 < 𝑏 → ∃𝑑 ∈ 𝐴 𝑑 < 𝑏))))
48		vex 3442	. . . . . 6 ⊢ 𝑎 ∈ V
49		vex 3442	. . . . . 6 ⊢ 𝑏 ∈ V
50	48, 49	brcnv 5829	. . . . 5 ⊢ (𝑎◡ < 𝑏 ↔ 𝑏 < 𝑎)
51	50	notbii 320	. . . 4 ⊢ (¬ 𝑎◡ < 𝑏 ↔ ¬ 𝑏 < 𝑎)
52	51	ralbii 3080	. . 3 ⊢ (∀𝑏 ∈ 𝐴 ¬ 𝑎◡ < 𝑏 ↔ ∀𝑏 ∈ 𝐴 ¬ 𝑏 < 𝑎)
53	49, 48	brcnv 5829	. . . . 5 ⊢ (𝑏◡ < 𝑎 ↔ 𝑎 < 𝑏)
54		vex 3442	. . . . . . 7 ⊢ 𝑑 ∈ V
55	49, 54	brcnv 5829	. . . . . 6 ⊢ (𝑏◡ < 𝑑 ↔ 𝑑 < 𝑏)
56	55	rexbii 3081	. . . . 5 ⊢ (∃𝑑 ∈ 𝐴 𝑏◡ < 𝑑 ↔ ∃𝑑 ∈ 𝐴 𝑑 < 𝑏)
57	53, 56	imbi12i 350	. . . 4 ⊢ ((𝑏◡ < 𝑎 → ∃𝑑 ∈ 𝐴 𝑏◡ < 𝑑) ↔ (𝑎 < 𝑏 → ∃𝑑 ∈ 𝐴 𝑑 < 𝑏))
58	57	ralbii 3080	. . 3 ⊢ (∀𝑏 ∈ 𝐵 (𝑏◡ < 𝑎 → ∃𝑑 ∈ 𝐴 𝑏◡ < 𝑑) ↔ ∀𝑏 ∈ 𝐵 (𝑎 < 𝑏 → ∃𝑑 ∈ 𝐴 𝑑 < 𝑏))
59	52, 58	anbi12i 628	. 2 ⊢ ((∀𝑏 ∈ 𝐴 ¬ 𝑎◡ < 𝑏 ∧ ∀𝑏 ∈ 𝐵 (𝑏◡ < 𝑎 → ∃𝑑 ∈ 𝐴 𝑏◡ < 𝑑)) ↔ (∀𝑏 ∈ 𝐴 ¬ 𝑏 < 𝑎 ∧ ∀𝑏 ∈ 𝐵 (𝑎 < 𝑏 → ∃𝑑 ∈ 𝐴 𝑑 < 𝑏)))
60	47, 59	bitr4di 289	1 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → ((∀𝑏 ∈ 𝐴 𝑎 ≤ 𝑏 ∧ ∀𝑐 ∈ 𝐵 (∀𝑏 ∈ 𝐴 𝑐 ≤ 𝑏 → 𝑐 ≤ 𝑎)) ↔ (∀𝑏 ∈ 𝐴 ¬ 𝑎◡ < 𝑏 ∧ ∀𝑏 ∈ 𝐵 (𝑏◡ < 𝑎 → ∃𝑑 ∈ 𝐴 𝑏◡ < 𝑑))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2113  ∀wral 3049  ∃wrex 3058   ⊆ wss 3899   class class class wbr 5095  ^◡ccnv 5620  ‘cfv 6489  Basecbs 17130  lecple 17178  ltcplt 18224  Tosetctos 18330

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-sbc 3739  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4285  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-iota 6445  df-fun 6491  df-fv 6497  df-proset 18210  df-poset 18229  df-plt 18244  df-toset 18331

This theorem is referenced by:  tosglb  32967  xrsclat  33003