Theorem wloglei 11829

Description: Form of wlogle 11830 where both sides of the equivalence are proven rather than showing that they are equivalent to each other. (Contributed by Mario Carneiro, 9-Mar-2015.)

Hypotheses

Ref	Expression
wlogle.1	⊢ ((𝑧 = 𝑥 ∧ 𝑤 = 𝑦) → (𝜓 ↔ 𝜒))
wlogle.2	⊢ ((𝑧 = 𝑦 ∧ 𝑤 = 𝑥) → (𝜓 ↔ 𝜃))
wlogle.3	⊢ (𝜑 → 𝑆 ⊆ ℝ)
wloglei.4	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑥 ≤ 𝑦)) → 𝜃)
wloglei.5	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑥 ≤ 𝑦)) → 𝜒)

Assertion

Ref	Expression
wloglei	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → 𝜒)

Distinct variable groups:   𝑥,𝑤,𝑦,𝑧,𝜑   𝑤,𝑆,𝑥,𝑦,𝑧   𝜓,𝑥,𝑦   𝜒,𝑤,𝑧

Allowed substitution hints:   𝜓(𝑧, 𝑤)   𝜒(𝑥, 𝑦)   𝜃(𝑥, 𝑦, 𝑧, 𝑤)

Proof of Theorem wloglei

Step	Hyp	Ref	Expression
1		wlogle.3	. . . 4 ⊢ (𝜑 → 𝑆 ⊆ ℝ)
2	1	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → 𝑆 ⊆ ℝ)
3		simprr 785	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → 𝑦 ∈ 𝑆)
4	2, 3	sseldd 3932	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → 𝑦 ∈ ℝ)
5		simprl 783	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → 𝑥 ∈ 𝑆)
6	2, 5	sseldd 3932	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → 𝑥 ∈ ℝ)
7		vex 3455	. . 3 ⊢ 𝑥 ∈ V
8		vex 3455	. . 3 ⊢ 𝑦 ∈ V
9		eleq1w 2844	. . . . . . 7 ⊢ (𝑧 = 𝑥 → (𝑧 ∈ 𝑆 ↔ 𝑥 ∈ 𝑆))
10		eleq1w 2844	. . . . . . 7 ⊢ (𝑤 = 𝑦 → (𝑤 ∈ 𝑆 ↔ 𝑦 ∈ 𝑆))
11	9, 10	bi2anan9 650	. . . . . 6 ⊢ ((𝑧 = 𝑥 ∧ 𝑤 = 𝑦) → ((𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ↔ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)))
12	11	anbi2d 642	. . . . 5 ⊢ ((𝑧 = 𝑥 ∧ 𝑤 = 𝑦) → ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ↔ (𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆))))
13		breq12 5108	. . . . . 6 ⊢ ((𝑤 = 𝑦 ∧ 𝑧 = 𝑥) → (𝑤 ≤ 𝑧 ↔ 𝑦 ≤ 𝑥))
14	13	ancoms 464	. . . . 5 ⊢ ((𝑧 = 𝑥 ∧ 𝑤 = 𝑦) → (𝑤 ≤ 𝑧 ↔ 𝑦 ≤ 𝑥))
15	12, 14	anbi12d 644	. . . 4 ⊢ ((𝑧 = 𝑥 ∧ 𝑤 = 𝑦) → (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ 𝑤 ≤ 𝑧) ↔ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ 𝑦 ≤ 𝑥)))
16		wlogle.1	. . . 4 ⊢ ((𝑧 = 𝑥 ∧ 𝑤 = 𝑦) → (𝜓 ↔ 𝜒))
17	15, 16	imbi12d 347	. . 3 ⊢ ((𝑧 = 𝑥 ∧ 𝑤 = 𝑦) → ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ 𝑤 ≤ 𝑧) → 𝜓) ↔ (((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ 𝑦 ≤ 𝑥) → 𝜒)))
18		vex 3455	. . . 4 ⊢ 𝑧 ∈ V
19		vex 3455	. . . 4 ⊢ 𝑤 ∈ V
20		ancom 466	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ↔ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆))
21		eleq1w 2844	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → (𝑦 ∈ 𝑆 ↔ 𝑧 ∈ 𝑆))
22		eleq1w 2844	. . . . . . . . 9 ⊢ (𝑥 = 𝑤 → (𝑥 ∈ 𝑆 ↔ 𝑤 ∈ 𝑆))
23	21, 22	bi2anan9 650	. . . . . . . 8 ⊢ ((𝑦 = 𝑧 ∧ 𝑥 = 𝑤) → ((𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆) ↔ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)))
24	20, 23	bitrid 286	. . . . . . 7 ⊢ ((𝑦 = 𝑧 ∧ 𝑥 = 𝑤) → ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ↔ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)))
25	24	anbi2d 642	. . . . . 6 ⊢ ((𝑦 = 𝑧 ∧ 𝑥 = 𝑤) → ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ↔ (𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆))))
26		breq12 5108	. . . . . . 7 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑧) → (𝑥 ≤ 𝑦 ↔ 𝑤 ≤ 𝑧))
27	26	ancoms 464	. . . . . 6 ⊢ ((𝑦 = 𝑧 ∧ 𝑥 = 𝑤) → (𝑥 ≤ 𝑦 ↔ 𝑤 ≤ 𝑧))
28	25, 27	anbi12d 644	. . . . 5 ⊢ ((𝑦 = 𝑧 ∧ 𝑥 = 𝑤) → (((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ 𝑥 ≤ 𝑦) ↔ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ 𝑤 ≤ 𝑧)))
29		equcom 2051	. . . . . . 7 ⊢ (𝑦 = 𝑧 ↔ 𝑧 = 𝑦)
30		equcom 2051	. . . . . . 7 ⊢ (𝑥 = 𝑤 ↔ 𝑤 = 𝑥)
31		wlogle.2	. . . . . . 7 ⊢ ((𝑧 = 𝑦 ∧ 𝑤 = 𝑥) → (𝜓 ↔ 𝜃))
32	29, 30, 31	syl2anb 610	. . . . . 6 ⊢ ((𝑦 = 𝑧 ∧ 𝑥 = 𝑤) → (𝜓 ↔ 𝜃))
33	32	bicomd 226	. . . . 5 ⊢ ((𝑦 = 𝑧 ∧ 𝑥 = 𝑤) → (𝜃 ↔ 𝜓))
34	28, 33	imbi12d 347	. . . 4 ⊢ ((𝑦 = 𝑧 ∧ 𝑥 = 𝑤) → ((((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ 𝑥 ≤ 𝑦) → 𝜃) ↔ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ 𝑤 ≤ 𝑧) → 𝜓)))
35		df-3an 1105	. . . . . 6 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑥 ≤ 𝑦) ↔ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ 𝑥 ≤ 𝑦))
36		wloglei.4	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑥 ≤ 𝑦)) → 𝜃)
37	35, 36	sylan2br 607	. . . . 5 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ 𝑥 ≤ 𝑦)) → 𝜃)
38	37	anassrs 473	. . . 4 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ 𝑥 ≤ 𝑦) → 𝜃)
39	18, 19, 34, 38	vtocl2 3527	. . 3 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ 𝑤 ≤ 𝑧) → 𝜓)
40	7, 8, 17, 39	vtocl2 3527	. 2 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ 𝑦 ≤ 𝑥) → 𝜒)
41		wloglei.5	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑥 ≤ 𝑦)) → 𝜒)
42	35, 41	sylan2br 607	. . 3 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ 𝑥 ≤ 𝑦)) → 𝜒)
43	42	anassrs 473	. 2 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ 𝑥 ≤ 𝑦) → 𝜒)
44	4, 6, 40, 43	lecasei 11397	1 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → 𝜒)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2145   ⊆ wss 3899   class class class wbr 5103  ℝcr 11180   ≤ cle 11325

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-resscn 11238  ax-pre-lttri 11255

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-er 8701  df-en 8958  df-dom 8959  df-sdom 8960  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330

This theorem is used by:  wlogle  11830  resconn  35980