xrlttri3 - Intuitionistic Logic Explorer

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

Theorem xrlttri3 10031

Description: Extended real version of lttri3 8258. (Contributed by NM, 9-Feb-2006.)

**Assertion**
Ref	Expression
xrlttri3	⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))

**Proof of Theorem xrlttri3**
Step	Hyp	Ref	Expression
1		elxr 10010	. 2 ⊢ (𝐴 ∈ ℝ^* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2		elxr 10010	. 2 ⊢ (𝐵 ∈ ℝ^* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
3		lttri3 8258	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
4	3	ancoms 268	. . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
5		renepnf 8226	. . . . . . . . . 10 ⊢ (𝐵 ∈ ℝ → 𝐵 ≠ +∞)
6	5	adantr 276	. . . . . . . . 9 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = +∞) → 𝐵 ≠ +∞)
7		neeq2 2416	. . . . . . . . . 10 ⊢ (𝐴 = +∞ → (𝐵 ≠ 𝐴 ↔ 𝐵 ≠ +∞))
8	7	adantl 277	. . . . . . . . 9 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = +∞) → (𝐵 ≠ 𝐴 ↔ 𝐵 ≠ +∞))
9	6, 8	mpbird 167	. . . . . . . 8 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = +∞) → 𝐵 ≠ 𝐴)
10	9	necomd 2488	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = +∞) → 𝐴 ≠ 𝐵)
11	10	neneqd 2423	. . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = +∞) → ¬ 𝐴 = 𝐵)
12		ltpnf 10014	. . . . . . . . 9 ⊢ (𝐵 ∈ ℝ → 𝐵 < +∞)
13	12	adantr 276	. . . . . . . 8 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = +∞) → 𝐵 < +∞)
14		breq2 4092	. . . . . . . . 9 ⊢ (𝐴 = +∞ → (𝐵 < 𝐴 ↔ 𝐵 < +∞))
15	14	adantl 277	. . . . . . . 8 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = +∞) → (𝐵 < 𝐴 ↔ 𝐵 < +∞))
16	13, 15	mpbird 167	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = +∞) → 𝐵 < 𝐴)
17		notnot 634	. . . . . . . . 9 ⊢ ((𝐴 < 𝐵 ∨ 𝐵 < 𝐴) → ¬ ¬ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))
18	17	olcs 743	. . . . . . . 8 ⊢ (𝐵 < 𝐴 → ¬ ¬ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))
19		ioran 759	. . . . . . . 8 ⊢ (¬ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴) ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))
20	18, 19	sylnib 682	. . . . . . 7 ⊢ (𝐵 < 𝐴 → ¬ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))
21	16, 20	syl 14	. . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = +∞) → ¬ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))
22	11, 21	2falsed 709	. . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = +∞) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
23		renemnf 8227	. . . . . . . . . 10 ⊢ (𝐵 ∈ ℝ → 𝐵 ≠ -∞)
24	23	adantr 276	. . . . . . . . 9 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = -∞) → 𝐵 ≠ -∞)
25		neeq2 2416	. . . . . . . . . 10 ⊢ (𝐴 = -∞ → (𝐵 ≠ 𝐴 ↔ 𝐵 ≠ -∞))
26	25	adantl 277	. . . . . . . . 9 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = -∞) → (𝐵 ≠ 𝐴 ↔ 𝐵 ≠ -∞))
27	24, 26	mpbird 167	. . . . . . . 8 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = -∞) → 𝐵 ≠ 𝐴)
28	27	necomd 2488	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = -∞) → 𝐴 ≠ 𝐵)
29	28	neneqd 2423	. . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = -∞) → ¬ 𝐴 = 𝐵)
30		mnflt 10017	. . . . . . . . 9 ⊢ (𝐵 ∈ ℝ → -∞ < 𝐵)
31	30	adantr 276	. . . . . . . 8 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = -∞) → -∞ < 𝐵)
32		breq1 4091	. . . . . . . . 9 ⊢ (𝐴 = -∞ → (𝐴 < 𝐵 ↔ -∞ < 𝐵))
33	32	adantl 277	. . . . . . . 8 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = -∞) → (𝐴 < 𝐵 ↔ -∞ < 𝐵))
34	31, 33	mpbird 167	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = -∞) → 𝐴 < 𝐵)
35		orc 719	. . . . . . 7 ⊢ (𝐴 < 𝐵 → (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))
36		oranim 788	. . . . . . 7 ⊢ ((𝐴 < 𝐵 ∨ 𝐵 < 𝐴) → ¬ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))
37	34, 35, 36	3syl 17	. . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = -∞) → ¬ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))
38	29, 37	2falsed 709	. . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 = -∞) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
39	4, 22, 38	3jaodan 1342	. . . 4 ⊢ ((𝐵 ∈ ℝ ∧ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞)) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
40	39	ancoms 268	. . 3 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) ∧ 𝐵 ∈ ℝ) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
41		renepnf 8226	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞)
42	41	adantl 277	. . . . . . . 8 ⊢ ((𝐵 = +∞ ∧ 𝐴 ∈ ℝ) → 𝐴 ≠ +∞)
43		neeq2 2416	. . . . . . . . 9 ⊢ (𝐵 = +∞ → (𝐴 ≠ 𝐵 ↔ 𝐴 ≠ +∞))
44	43	adantr 276	. . . . . . . 8 ⊢ ((𝐵 = +∞ ∧ 𝐴 ∈ ℝ) → (𝐴 ≠ 𝐵 ↔ 𝐴 ≠ +∞))
45	42, 44	mpbird 167	. . . . . . 7 ⊢ ((𝐵 = +∞ ∧ 𝐴 ∈ ℝ) → 𝐴 ≠ 𝐵)
46	45	neneqd 2423	. . . . . 6 ⊢ ((𝐵 = +∞ ∧ 𝐴 ∈ ℝ) → ¬ 𝐴 = 𝐵)
47		ltpnf 10014	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → 𝐴 < +∞)
48	47	adantl 277	. . . . . . . 8 ⊢ ((𝐵 = +∞ ∧ 𝐴 ∈ ℝ) → 𝐴 < +∞)
49		breq2 4092	. . . . . . . . 9 ⊢ (𝐵 = +∞ → (𝐴 < 𝐵 ↔ 𝐴 < +∞))
50	49	adantr 276	. . . . . . . 8 ⊢ ((𝐵 = +∞ ∧ 𝐴 ∈ ℝ) → (𝐴 < 𝐵 ↔ 𝐴 < +∞))
51	48, 50	mpbird 167	. . . . . . 7 ⊢ ((𝐵 = +∞ ∧ 𝐴 ∈ ℝ) → 𝐴 < 𝐵)
52	51, 35, 36	3syl 17	. . . . . 6 ⊢ ((𝐵 = +∞ ∧ 𝐴 ∈ ℝ) → ¬ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))
53	46, 52	2falsed 709	. . . . 5 ⊢ ((𝐵 = +∞ ∧ 𝐴 ∈ ℝ) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
54		eqtr3 2251	. . . . . . 7 ⊢ ((𝐵 = +∞ ∧ 𝐴 = +∞) → 𝐵 = 𝐴)
55	54	eqcomd 2237	. . . . . 6 ⊢ ((𝐵 = +∞ ∧ 𝐴 = +∞) → 𝐴 = 𝐵)
56		pnfxr 8231	. . . . . . . . 9 ⊢ +∞ ∈ ℝ^*
57		xrltnr 10013	. . . . . . . . 9 ⊢ (+∞ ∈ ℝ^* → ¬ +∞ < +∞)
58	56, 57	ax-mp 5	. . . . . . . 8 ⊢ ¬ +∞ < +∞
59		breq12 4093	. . . . . . . . 9 ⊢ ((𝐴 = +∞ ∧ 𝐵 = +∞) → (𝐴 < 𝐵 ↔ +∞ < +∞))
60	59	ancoms 268	. . . . . . . 8 ⊢ ((𝐵 = +∞ ∧ 𝐴 = +∞) → (𝐴 < 𝐵 ↔ +∞ < +∞))
61	58, 60	mtbiri 681	. . . . . . 7 ⊢ ((𝐵 = +∞ ∧ 𝐴 = +∞) → ¬ 𝐴 < 𝐵)
62		breq12 4093	. . . . . . . 8 ⊢ ((𝐵 = +∞ ∧ 𝐴 = +∞) → (𝐵 < 𝐴 ↔ +∞ < +∞))
63	58, 62	mtbiri 681	. . . . . . 7 ⊢ ((𝐵 = +∞ ∧ 𝐴 = +∞) → ¬ 𝐵 < 𝐴)
64	61, 63	jca 306	. . . . . 6 ⊢ ((𝐵 = +∞ ∧ 𝐴 = +∞) → (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))
65	55, 64	2thd 175	. . . . 5 ⊢ ((𝐵 = +∞ ∧ 𝐴 = +∞) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
66		mnfnepnf 8234	. . . . . . . . 9 ⊢ -∞ ≠ +∞
67		eqeq12 2244	. . . . . . . . . 10 ⊢ ((𝐴 = -∞ ∧ 𝐵 = +∞) → (𝐴 = 𝐵 ↔ -∞ = +∞))
68	67	necon3bid 2443	. . . . . . . . 9 ⊢ ((𝐴 = -∞ ∧ 𝐵 = +∞) → (𝐴 ≠ 𝐵 ↔ -∞ ≠ +∞))
69	66, 68	mpbiri 168	. . . . . . . 8 ⊢ ((𝐴 = -∞ ∧ 𝐵 = +∞) → 𝐴 ≠ 𝐵)
70	69	ancoms 268	. . . . . . 7 ⊢ ((𝐵 = +∞ ∧ 𝐴 = -∞) → 𝐴 ≠ 𝐵)
71	70	neneqd 2423	. . . . . 6 ⊢ ((𝐵 = +∞ ∧ 𝐴 = -∞) → ¬ 𝐴 = 𝐵)
72		mnfltpnf 10019	. . . . . . . . 9 ⊢ -∞ < +∞
73		breq12 4093	. . . . . . . . 9 ⊢ ((𝐴 = -∞ ∧ 𝐵 = +∞) → (𝐴 < 𝐵 ↔ -∞ < +∞))
74	72, 73	mpbiri 168	. . . . . . . 8 ⊢ ((𝐴 = -∞ ∧ 𝐵 = +∞) → 𝐴 < 𝐵)
75	74	ancoms 268	. . . . . . 7 ⊢ ((𝐵 = +∞ ∧ 𝐴 = -∞) → 𝐴 < 𝐵)
76	75, 35, 36	3syl 17	. . . . . 6 ⊢ ((𝐵 = +∞ ∧ 𝐴 = -∞) → ¬ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))
77	71, 76	2falsed 709	. . . . 5 ⊢ ((𝐵 = +∞ ∧ 𝐴 = -∞) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
78	53, 65, 77	3jaodan 1342	. . . 4 ⊢ ((𝐵 = +∞ ∧ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞)) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
79	78	ancoms 268	. . 3 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) ∧ 𝐵 = +∞) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
80		renemnf 8227	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ -∞)
81	80	adantl 277	. . . . . . . 8 ⊢ ((𝐵 = -∞ ∧ 𝐴 ∈ ℝ) → 𝐴 ≠ -∞)
82		neeq2 2416	. . . . . . . . 9 ⊢ (𝐵 = -∞ → (𝐴 ≠ 𝐵 ↔ 𝐴 ≠ -∞))
83	82	adantr 276	. . . . . . . 8 ⊢ ((𝐵 = -∞ ∧ 𝐴 ∈ ℝ) → (𝐴 ≠ 𝐵 ↔ 𝐴 ≠ -∞))
84	81, 83	mpbird 167	. . . . . . 7 ⊢ ((𝐵 = -∞ ∧ 𝐴 ∈ ℝ) → 𝐴 ≠ 𝐵)
85	84	neneqd 2423	. . . . . 6 ⊢ ((𝐵 = -∞ ∧ 𝐴 ∈ ℝ) → ¬ 𝐴 = 𝐵)
86		mnflt 10017	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → -∞ < 𝐴)
87	86	adantl 277	. . . . . . . 8 ⊢ ((𝐵 = -∞ ∧ 𝐴 ∈ ℝ) → -∞ < 𝐴)
88		breq1 4091	. . . . . . . . 9 ⊢ (𝐵 = -∞ → (𝐵 < 𝐴 ↔ -∞ < 𝐴))
89	88	adantr 276	. . . . . . . 8 ⊢ ((𝐵 = -∞ ∧ 𝐴 ∈ ℝ) → (𝐵 < 𝐴 ↔ -∞ < 𝐴))
90	87, 89	mpbird 167	. . . . . . 7 ⊢ ((𝐵 = -∞ ∧ 𝐴 ∈ ℝ) → 𝐵 < 𝐴)
91	90, 20	syl 14	. . . . . 6 ⊢ ((𝐵 = -∞ ∧ 𝐴 ∈ ℝ) → ¬ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))
92	85, 91	2falsed 709	. . . . 5 ⊢ ((𝐵 = -∞ ∧ 𝐴 ∈ ℝ) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
93	66	neii 2404	. . . . . . . . . 10 ⊢ ¬ -∞ = +∞
94		eqeq12 2244	. . . . . . . . . 10 ⊢ ((𝐵 = -∞ ∧ 𝐴 = +∞) → (𝐵 = 𝐴 ↔ -∞ = +∞))
95	93, 94	mtbiri 681	. . . . . . . . 9 ⊢ ((𝐵 = -∞ ∧ 𝐴 = +∞) → ¬ 𝐵 = 𝐴)
96	95	neneqad 2481	. . . . . . . 8 ⊢ ((𝐵 = -∞ ∧ 𝐴 = +∞) → 𝐵 ≠ 𝐴)
97	96	necomd 2488	. . . . . . 7 ⊢ ((𝐵 = -∞ ∧ 𝐴 = +∞) → 𝐴 ≠ 𝐵)
98	97	neneqd 2423	. . . . . 6 ⊢ ((𝐵 = -∞ ∧ 𝐴 = +∞) → ¬ 𝐴 = 𝐵)
99		breq12 4093	. . . . . . . 8 ⊢ ((𝐵 = -∞ ∧ 𝐴 = +∞) → (𝐵 < 𝐴 ↔ -∞ < +∞))
100	72, 99	mpbiri 168	. . . . . . 7 ⊢ ((𝐵 = -∞ ∧ 𝐴 = +∞) → 𝐵 < 𝐴)
101	100, 20	syl 14	. . . . . 6 ⊢ ((𝐵 = -∞ ∧ 𝐴 = +∞) → ¬ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))
102	98, 101	2falsed 709	. . . . 5 ⊢ ((𝐵 = -∞ ∧ 𝐴 = +∞) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
103		eqtr3 2251	. . . . . . 7 ⊢ ((𝐴 = -∞ ∧ 𝐵 = -∞) → 𝐴 = 𝐵)
104	103	ancoms 268	. . . . . 6 ⊢ ((𝐵 = -∞ ∧ 𝐴 = -∞) → 𝐴 = 𝐵)
105		mnfxr 8235	. . . . . . . . 9 ⊢ -∞ ∈ ℝ^*
106		xrltnr 10013	. . . . . . . . 9 ⊢ (-∞ ∈ ℝ^* → ¬ -∞ < -∞)
107	105, 106	ax-mp 5	. . . . . . . 8 ⊢ ¬ -∞ < -∞
108		breq12 4093	. . . . . . . . 9 ⊢ ((𝐴 = -∞ ∧ 𝐵 = -∞) → (𝐴 < 𝐵 ↔ -∞ < -∞))
109	108	ancoms 268	. . . . . . . 8 ⊢ ((𝐵 = -∞ ∧ 𝐴 = -∞) → (𝐴 < 𝐵 ↔ -∞ < -∞))
110	107, 109	mtbiri 681	. . . . . . 7 ⊢ ((𝐵 = -∞ ∧ 𝐴 = -∞) → ¬ 𝐴 < 𝐵)
111		breq12 4093	. . . . . . . 8 ⊢ ((𝐵 = -∞ ∧ 𝐴 = -∞) → (𝐵 < 𝐴 ↔ -∞ < -∞))
112	107, 111	mtbiri 681	. . . . . . 7 ⊢ ((𝐵 = -∞ ∧ 𝐴 = -∞) → ¬ 𝐵 < 𝐴)
113	110, 112	jca 306	. . . . . 6 ⊢ ((𝐵 = -∞ ∧ 𝐴 = -∞) → (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))
114	104, 113	2thd 175	. . . . 5 ⊢ ((𝐵 = -∞ ∧ 𝐴 = -∞) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
115	92, 102, 114	3jaodan 1342	. . . 4 ⊢ ((𝐵 = -∞ ∧ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞)) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
116	115	ancoms 268	. . 3 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) ∧ 𝐵 = -∞) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
117	40, 79, 116	3jaodan 1342	. 2 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))
118	1, 2, 117	syl2anb 291	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 715 ∨ w3o 1003 = wceq 1397 ∈ wcel 2202 ≠ wne 2402 class class class wbr 4088 ℝcr 8030 +∞cpnf 8210 -∞cmnf 8211 ℝ^*cxr 8212 < clt 8213

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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-pre-ltirr 8143 ax-pre-apti 8146

This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-rab 2519 df-v 2804 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-xp 4731 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218

This theorem is referenced by: xrletri3 10038 iccid 10159 xrmaxleim 11804 xrmaxif 11811 xrmaxaddlem 11820 infxrnegsupex 11823 bdxmet 15224

W3C validator