opthprc - Intuitionistic Logic Explorer

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

Theorem opthprc 4710

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 2257	. . . . 5
2		0ex 4156	. . . . . . . . 9
3	2	snid 3649	. . . . . . . 8
4		opelxp 4689	. . . . . . . 8 $/\$
5	3, 4	mpbiran2 943	. . . . . . 7
6		opelxp 4689	. . . . . . . 8 $/\$
7		0nep0 4194	. . . . . . . . . 10
8	2	elsn 3634	. . . . . . . . . 10
9	7, 8	nemtbir 2453	. . . . . . . . 9
10	9	bianfi 949	. . . . . . . 8 $/\$
11	6, 10	bitr4i 187	. . . . . . 7
12	5, 11	orbi12i 765	. . . . . 6 $\/$ $\/$
13		elun 3300	. . . . . 6 $\/$
14	9	biorfi 747	. . . . . 6 $\/$
15	12, 13, 14	3bitr4ri 213	. . . . 5
16		opelxp 4689	. . . . . . . 8 $/\$
17	3, 16	mpbiran2 943	. . . . . . 7
18		opelxp 4689	. . . . . . . 8 $/\$
19	9	bianfi 949	. . . . . . . 8 $/\$
20	18, 19	bitr4i 187	. . . . . . 7
21	17, 20	orbi12i 765	. . . . . 6 $\/$ $\/$
22		elun 3300	. . . . . 6 $\/$
23	9	biorfi 747	. . . . . 6 $\/$
24	21, 22, 23	3bitr4ri 213	. . . . 5
25	1, 15, 24	3bitr4g 223	. . . 4
26	25	eqrdv 2191	. . 3
27		eleq2 2257	. . . . 5
28		opelxp 4689	. . . . . . . 8 $/\$
29		p0ex 4217	. . . . . . . . . . . 12
30	29	elsn 3634	. . . . . . . . . . 11
31		eqcom 2195	. . . . . . . . . . 11
32	30, 31	bitri 184	. . . . . . . . . 10
33	7, 32	nemtbir 2453	. . . . . . . . 9
34	33	bianfi 949	. . . . . . . 8 $/\$
35	28, 34	bitr4i 187	. . . . . . 7
36	29	snid 3649	. . . . . . . 8
37		opelxp 4689	. . . . . . . 8 $/\$
38	36, 37	mpbiran2 943	. . . . . . 7
39	35, 38	orbi12i 765	. . . . . 6 $\/$ $\/$
40		elun 3300	. . . . . 6 $\/$
41		biorf 745	. . . . . . 7 $\/$
42	33, 41	ax-mp 5	. . . . . 6 $\/$
43	39, 40, 42	3bitr4ri 213	. . . . 5
44		opelxp 4689	. . . . . . . 8 $/\$
45	33	bianfi 949	. . . . . . . 8 $/\$
46	44, 45	bitr4i 187	. . . . . . 7
47		opelxp 4689	. . . . . . . 8 $/\$
48	36, 47	mpbiran2 943	. . . . . . 7
49	46, 48	orbi12i 765	. . . . . 6 $\/$ $\/$
50		elun 3300	. . . . . 6 $\/$
51		biorf 745	. . . . . . 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 2191	. . 3
56	26, 55	jca 306	. 2 $/\$
57		xpeq1 4673	. . 3
58		xpeq1 4673	. . 3
59		uneq12 3308	. . 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 709

wceq 1364

wcel 2164

cun 3151

c0 3446

csn 3618

cop 3621

cxp 4657

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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-nul 4155 ax-pow 4203 ax-pr 4238

This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-ral 2477 df-rex 2478 df-v 2762 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-opab 4091 df-xp 4665

This theorem is referenced by: (None)

W3C validator