opthprc - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > opthprc		Unicode version

Theorem opthprc 4679

Description: Justification theorem for an ordered pair definition that works for any classes, including proper classes. This is a possible definition implied by the footnote in [Jech] p. 78, which says, "The sophisticated reader will not object to our use of a pair of classes." (Contributed by NM, 28-Sep-2003.)

**Assertion**
Ref	Expression
opthprc	$/\$

Proof of Theorem opthprc Dummy variable

is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq2 2241	. . . . 5
2		0ex 4132	. . . . . . . . 9
3	2	snid 3625	. . . . . . . 8
4		opelxp 4658	. . . . . . . 8 $/\$
5	3, 4	mpbiran2 941	. . . . . . 7
6		opelxp 4658	. . . . . . . 8 $/\$
7		0nep0 4167	. . . . . . . . . 10
8	2	elsn 3610	. . . . . . . . . 10
9	7, 8	nemtbir 2436	. . . . . . . . 9
10	9	bianfi 947	. . . . . . . 8 $/\$
11	6, 10	bitr4i 187	. . . . . . 7
12	5, 11	orbi12i 764	. . . . . 6 $\/$ $\/$
13		elun 3278	. . . . . 6 $\/$
14	9	biorfi 746	. . . . . 6 $\/$
15	12, 13, 14	3bitr4ri 213	. . . . 5
16		opelxp 4658	. . . . . . . 8 $/\$
17	3, 16	mpbiran2 941	. . . . . . 7
18		opelxp 4658	. . . . . . . 8 $/\$
19	9	bianfi 947	. . . . . . . 8 $/\$
20	18, 19	bitr4i 187	. . . . . . 7
21	17, 20	orbi12i 764	. . . . . 6 $\/$ $\/$
22		elun 3278	. . . . . 6 $\/$
23	9	biorfi 746	. . . . . 6 $\/$
24	21, 22, 23	3bitr4ri 213	. . . . 5
25	1, 15, 24	3bitr4g 223	. . . 4
26	25	eqrdv 2175	. . 3
27		eleq2 2241	. . . . 5
28		opelxp 4658	. . . . . . . 8 $/\$
29		p0ex 4190	. . . . . . . . . . . 12
30	29	elsn 3610	. . . . . . . . . . 11
31		eqcom 2179	. . . . . . . . . . 11
32	30, 31	bitri 184	. . . . . . . . . 10
33	7, 32	nemtbir 2436	. . . . . . . . 9
34	33	bianfi 947	. . . . . . . 8 $/\$
35	28, 34	bitr4i 187	. . . . . . 7
36	29	snid 3625	. . . . . . . 8
37		opelxp 4658	. . . . . . . 8 $/\$
38	36, 37	mpbiran2 941	. . . . . . 7
39	35, 38	orbi12i 764	. . . . . 6 $\/$ $\/$
40		elun 3278	. . . . . 6 $\/$
41		biorf 744	. . . . . . 7 $\/$
42	33, 41	ax-mp 5	. . . . . 6 $\/$
43	39, 40, 42	3bitr4ri 213	. . . . 5
44		opelxp 4658	. . . . . . . 8 $/\$
45	33	bianfi 947	. . . . . . . 8 $/\$
46	44, 45	bitr4i 187	. . . . . . 7
47		opelxp 4658	. . . . . . . 8 $/\$
48	36, 47	mpbiran2 941	. . . . . . 7
49	46, 48	orbi12i 764	. . . . . 6 $\/$ $\/$
50		elun 3278	. . . . . 6 $\/$
51		biorf 744	. . . . . . 7 $\/$
52	33, 51	ax-mp 5	. . . . . 6 $\/$
53	49, 50, 52	3bitr4ri 213	. . . . 5
54	27, 43, 53	3bitr4g 223	. . . 4
55	54	eqrdv 2175	. . 3
56	26, 55	jca 306	. 2 $/\$
57		xpeq1 4642	. . 3
58		xpeq1 4642	. . 3
59		uneq12 3286	. . 3 $/\$
60	57, 58, 59	syl2an 289	. 2 $/\$
61	56, 60	impbii 126	1 $/\$

Colors of variables: wff set class

Syntax hints:

wn 3 $/\$ wa 104

wb 105 $\/$ wo 708

wceq 1353

wcel 2148

cun 3129

c0 3424

csn 3594

cop 3597

cxp 4626

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-14 2151 ax-ext 2159 ax-sep 4123 ax-nul 4131 ax-pow 4176 ax-pr 4211

This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-ral 2460 df-rex 2461 df-v 2741 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-nul 3425 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-opab 4067 df-xp 4634

This theorem is referenced by: (None)

W3C validator