oduprs - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > oduprs		Structured version Visualization version GIF version

Theorem oduprs 32129

Description: Being a proset is a self-dual property. (Contributed by Thierry Arnoux, 13-Sep-2018.)

**Hypothesis**
Ref	Expression
oduprs.d	⊢ 𝐷 = (ODual‘𝐾)

**Assertion**
Ref	Expression
oduprs	⊢ (𝐾 ∈ Proset → 𝐷 ∈ Proset )

Proof of Theorem oduprs Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2732	. . . . . . . . . . . . . 14 ⊢ (Base‘𝐾) = (Base‘𝐾)
2		eqid 2732	. . . . . . . . . . . . . 14 ⊢ (le‘𝐾) = (le‘𝐾)
3	1, 2	isprs 18249	. . . . . . . . . . . . 13 ⊢ (𝐾 ∈ Proset ↔ (𝐾 ∈ V ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧))))
4	3	simprbi 497	. . . . . . . . . . . 12 ⊢ (𝐾 ∈ Proset → ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧)))
5	4	r19.21bi 3248	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ Proset ∧ 𝑥 ∈ (Base‘𝐾)) → ∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧)))
6	5	r19.21bi 3248	. . . . . . . . . 10 ⊢ (((𝐾 ∈ Proset ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾)) → ∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧)))
7	6	r19.21bi 3248	. . . . . . . . 9 ⊢ ((((𝐾 ∈ Proset ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 ∈ (Base‘𝐾)) → (𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧)))
8	7	simpld 495	. . . . . . . 8 ⊢ ((((𝐾 ∈ Proset ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 ∈ (Base‘𝐾)) → 𝑥(le‘𝐾)𝑥)
9		vex 3478	. . . . . . . . 9 ⊢ 𝑥 ∈ V
10	9, 9	brcnv 5882	. . . . . . . 8 ⊢ (𝑥^◡(le‘𝐾)𝑥 ↔ 𝑥(le‘𝐾)𝑥)
11	8, 10	sylibr 233	. . . . . . 7 ⊢ ((((𝐾 ∈ Proset ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 ∈ (Base‘𝐾)) → 𝑥^◡(le‘𝐾)𝑥)
12	1, 2	isprs 18249	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐾 ∈ Proset ↔ (𝐾 ∈ V ∧ ∀𝑧 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑥 ∈ (Base‘𝐾)(𝑧(le‘𝐾)𝑧 ∧ ((𝑧(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑥) → 𝑧(le‘𝐾)𝑥))))
13	12	simprbi 497	. . . . . . . . . . . . . . . . 17 ⊢ (𝐾 ∈ Proset → ∀𝑧 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑥 ∈ (Base‘𝐾)(𝑧(le‘𝐾)𝑧 ∧ ((𝑧(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑥) → 𝑧(le‘𝐾)𝑥)))
14	13	r19.21bi 3248	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ Proset ∧ 𝑧 ∈ (Base‘𝐾)) → ∀𝑦 ∈ (Base‘𝐾)∀𝑥 ∈ (Base‘𝐾)(𝑧(le‘𝐾)𝑧 ∧ ((𝑧(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑥) → 𝑧(le‘𝐾)𝑥)))
15	14	r19.21bi 3248	. . . . . . . . . . . . . . 15 ⊢ (((𝐾 ∈ Proset ∧ 𝑧 ∈ (Base‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾)) → ∀𝑥 ∈ (Base‘𝐾)(𝑧(le‘𝐾)𝑧 ∧ ((𝑧(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑥) → 𝑧(le‘𝐾)𝑥)))
16	15	r19.21bi 3248	. . . . . . . . . . . . . 14 ⊢ ((((𝐾 ∈ Proset ∧ 𝑧 ∈ (Base‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑧(le‘𝐾)𝑧 ∧ ((𝑧(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑥) → 𝑧(le‘𝐾)𝑥)))
17	16	simprd 496	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ Proset ∧ 𝑧 ∈ (Base‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑥 ∈ (Base‘𝐾)) → ((𝑧(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑥) → 𝑧(le‘𝐾)𝑥))
18	17	an32s 650	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ Proset ∧ 𝑧 ∈ (Base‘𝐾)) ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾)) → ((𝑧(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑥) → 𝑧(le‘𝐾)𝑥))
19	18	ex 413	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ Proset ∧ 𝑧 ∈ (Base‘𝐾)) ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑦 ∈ (Base‘𝐾) → ((𝑧(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑥) → 𝑧(le‘𝐾)𝑥)))
20	19	an32s 650	. . . . . . . . . 10 ⊢ (((𝐾 ∈ Proset ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑧 ∈ (Base‘𝐾)) → (𝑦 ∈ (Base‘𝐾) → ((𝑧(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑥) → 𝑧(le‘𝐾)𝑥)))
21	20	imp 407	. . . . . . . . 9 ⊢ ((((𝐾 ∈ Proset ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑧 ∈ (Base‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾)) → ((𝑧(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑥) → 𝑧(le‘𝐾)𝑥))
22	21	an32s 650	. . . . . . . 8 ⊢ ((((𝐾 ∈ Proset ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 ∈ (Base‘𝐾)) → ((𝑧(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑥) → 𝑧(le‘𝐾)𝑥))
23		vex 3478	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
24	9, 23	brcnv 5882	. . . . . . . . 9 ⊢ (𝑥^◡(le‘𝐾)𝑦 ↔ 𝑦(le‘𝐾)𝑥)
25		vex 3478	. . . . . . . . . 10 ⊢ 𝑧 ∈ V
26	23, 25	brcnv 5882	. . . . . . . . 9 ⊢ (𝑦^◡(le‘𝐾)𝑧 ↔ 𝑧(le‘𝐾)𝑦)
27	24, 26	anbi12ci 628	. . . . . . . 8 ⊢ ((𝑥^◡(le‘𝐾)𝑦 ∧ 𝑦^◡(le‘𝐾)𝑧) ↔ (𝑧(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑥))
28	9, 25	brcnv 5882	. . . . . . . 8 ⊢ (𝑥^◡(le‘𝐾)𝑧 ↔ 𝑧(le‘𝐾)𝑥)
29	22, 27, 28	3imtr4g 295	. . . . . . 7 ⊢ ((((𝐾 ∈ Proset ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 ∈ (Base‘𝐾)) → ((𝑥^◡(le‘𝐾)𝑦 ∧ 𝑦^◡(le‘𝐾)𝑧) → 𝑥^◡(le‘𝐾)𝑧))
30	11, 29	jca 512	. . . . . 6 ⊢ ((((𝐾 ∈ Proset ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 ∈ (Base‘𝐾)) → (𝑥^◡(le‘𝐾)𝑥 ∧ ((𝑥^◡(le‘𝐾)𝑦 ∧ 𝑦^◡(le‘𝐾)𝑧) → 𝑥^◡(le‘𝐾)𝑧)))
31	30	ralrimiva 3146	. . . . 5 ⊢ (((𝐾 ∈ Proset ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑦 ∈ (Base‘𝐾)) → ∀𝑧 ∈ (Base‘𝐾)(𝑥^◡(le‘𝐾)𝑥 ∧ ((𝑥^◡(le‘𝐾)𝑦 ∧ 𝑦^◡(le‘𝐾)𝑧) → 𝑥^◡(le‘𝐾)𝑧)))
32	31	ralrimiva 3146	. . . 4 ⊢ ((𝐾 ∈ Proset ∧ 𝑥 ∈ (Base‘𝐾)) → ∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥^◡(le‘𝐾)𝑥 ∧ ((𝑥^◡(le‘𝐾)𝑦 ∧ 𝑦^◡(le‘𝐾)𝑧) → 𝑥^◡(le‘𝐾)𝑧)))
33	32	ralrimiva 3146	. . 3 ⊢ (𝐾 ∈ Proset → ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥^◡(le‘𝐾)𝑥 ∧ ((𝑥^◡(le‘𝐾)𝑦 ∧ 𝑦^◡(le‘𝐾)𝑧) → 𝑥^◡(le‘𝐾)𝑧)))
34		oduprs.d	. . . 4 ⊢ 𝐷 = (ODual‘𝐾)
35	34	fvexi 6905	. . 3 ⊢ 𝐷 ∈ V
36	33, 35	jctil 520	. 2 ⊢ (𝐾 ∈ Proset → (𝐷 ∈ V ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥^◡(le‘𝐾)𝑥 ∧ ((𝑥^◡(le‘𝐾)𝑦 ∧ 𝑦^◡(le‘𝐾)𝑧) → 𝑥^◡(le‘𝐾)𝑧))))
37	34, 1	odubas 18243	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐷)
38	34, 2	oduleval 18241	. . 3 ⊢ ^◡(le‘𝐾) = (le‘𝐷)
39	37, 38	isprs 18249	. 2 ⊢ (𝐷 ∈ Proset ↔ (𝐷 ∈ V ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥^◡(le‘𝐾)𝑥 ∧ ((𝑥^◡(le‘𝐾)𝑦 ∧ 𝑦^◡(le‘𝐾)𝑧) → 𝑥^◡(le‘𝐾)𝑧))))
40	36, 39	sylibr 233	1 ⊢ (𝐾 ∈ Proset → 𝐷 ∈ Proset )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 Vcvv 3474 class class class wbr 5148 ^◡ccnv 5675 ‘cfv 6543 Basecbs 17143 lecple 17203 ODualcodu 18238 Proset cproset 18245

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7855 df-2nd 7975 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-er 8702 df-en 8939 df-dom 8940 df-sdom 8941 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-nn 12212 df-2 12274 df-3 12275 df-4 12276 df-5 12277 df-6 12278 df-7 12279 df-8 12280 df-9 12281 df-dec 12677 df-sets 17096 df-slot 17114 df-ndx 17126 df-base 17144 df-ple 17216 df-odu 18239 df-proset 18247

This theorem is referenced by: mgccnv 32164 ordtcnvNEW 32895

W3C validator