MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  symquadlem Structured version   Visualization version   GIF version

Theorem symquadlem 27631
Description: Lemma of the symetrial quadrilateral. The diagonals of quadrilaterals with congruent opposing sides intersect at their middle point. In Euclidean geometry, such quadrilaterals are called parallelograms, as opposing sides are parallel. However, this is not necessarily true in the case of absolute geometry. Lemma 7.21 of [Schwabhauser] p. 52. (Contributed by Thierry Arnoux, 6-Aug-2019.)
Hypotheses
Ref Expression
mirval.p 𝑃 = (Base‘𝐺)
mirval.d = (dist‘𝐺)
mirval.i 𝐼 = (Itv‘𝐺)
mirval.l 𝐿 = (LineG‘𝐺)
mirval.s 𝑆 = (pInvG‘𝐺)
mirval.g (𝜑𝐺 ∈ TarskiG)
symquadlem.m 𝑀 = (𝑆𝑋)
symquadlem.a (𝜑𝐴𝑃)
symquadlem.b (𝜑𝐵𝑃)
symquadlem.c (𝜑𝐶𝑃)
symquadlem.d (𝜑𝐷𝑃)
symquadlem.x (𝜑𝑋𝑃)
symquadlem.1 (𝜑 → ¬ (𝐴 ∈ (𝐵𝐿𝐶) ∨ 𝐵 = 𝐶))
symquadlem.2 (𝜑𝐵𝐷)
symquadlem.3 (𝜑 → (𝐴 𝐵) = (𝐶 𝐷))
symquadlem.4 (𝜑 → (𝐵 𝐶) = (𝐷 𝐴))
symquadlem.5 (𝜑 → (𝑋 ∈ (𝐴𝐿𝐶) ∨ 𝐴 = 𝐶))
symquadlem.6 (𝜑 → (𝑋 ∈ (𝐵𝐿𝐷) ∨ 𝐵 = 𝐷))
Assertion
Ref Expression
symquadlem (𝜑𝐴 = (𝑀𝐶))

Proof of Theorem symquadlem
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 symquadlem.1 . . . . . . . 8 (𝜑 → ¬ (𝐴 ∈ (𝐵𝐿𝐶) ∨ 𝐵 = 𝐶))
2 mirval.p . . . . . . . . . . 11 𝑃 = (Base‘𝐺)
3 mirval.l . . . . . . . . . . 11 𝐿 = (LineG‘𝐺)
4 mirval.i . . . . . . . . . . 11 𝐼 = (Itv‘𝐺)
5 mirval.g . . . . . . . . . . 11 (𝜑𝐺 ∈ TarskiG)
6 symquadlem.b . . . . . . . . . . 11 (𝜑𝐵𝑃)
7 symquadlem.a . . . . . . . . . . 11 (𝜑𝐴𝑃)
8 mirval.d . . . . . . . . . . . 12 = (dist‘𝐺)
92, 8, 4, 5, 6, 7tgbtwntriv2 27429 . . . . . . . . . . 11 (𝜑𝐴 ∈ (𝐵𝐼𝐴))
102, 3, 4, 5, 6, 7, 7, 9btwncolg1 27497 . . . . . . . . . 10 (𝜑 → (𝐴 ∈ (𝐵𝐿𝐴) ∨ 𝐵 = 𝐴))
1110adantr 481 . . . . . . . . 9 ((𝜑𝐴 = 𝐶) → (𝐴 ∈ (𝐵𝐿𝐴) ∨ 𝐵 = 𝐴))
12 simpr 485 . . . . . . . . . . . 12 ((𝜑𝐴 = 𝐶) → 𝐴 = 𝐶)
1312oveq2d 7373 . . . . . . . . . . 11 ((𝜑𝐴 = 𝐶) → (𝐵𝐿𝐴) = (𝐵𝐿𝐶))
1413eleq2d 2823 . . . . . . . . . 10 ((𝜑𝐴 = 𝐶) → (𝐴 ∈ (𝐵𝐿𝐴) ↔ 𝐴 ∈ (𝐵𝐿𝐶)))
1512eqeq2d 2747 . . . . . . . . . 10 ((𝜑𝐴 = 𝐶) → (𝐵 = 𝐴𝐵 = 𝐶))
1614, 15orbi12d 917 . . . . . . . . 9 ((𝜑𝐴 = 𝐶) → ((𝐴 ∈ (𝐵𝐿𝐴) ∨ 𝐵 = 𝐴) ↔ (𝐴 ∈ (𝐵𝐿𝐶) ∨ 𝐵 = 𝐶)))
1711, 16mpbid 231 . . . . . . . 8 ((𝜑𝐴 = 𝐶) → (𝐴 ∈ (𝐵𝐿𝐶) ∨ 𝐵 = 𝐶))
181, 17mtand 814 . . . . . . 7 (𝜑 → ¬ 𝐴 = 𝐶)
1918neqned 2950 . . . . . 6 (𝜑𝐴𝐶)
2019ad2antrr 724 . . . . 5 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝐴𝐶)
2120necomd 2999 . . . 4 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝐶𝐴)
2221neneqd 2948 . . 3 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → ¬ 𝐶 = 𝐴)
23 mirval.s . . . . . 6 𝑆 = (pInvG‘𝐺)
245ad2antrr 724 . . . . . 6 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝐺 ∈ TarskiG)
25 symquadlem.m . . . . . 6 𝑀 = (𝑆𝑋)
26 symquadlem.c . . . . . . 7 (𝜑𝐶𝑃)
2726ad2antrr 724 . . . . . 6 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝐶𝑃)
287ad2antrr 724 . . . . . 6 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝐴𝑃)
29 symquadlem.x . . . . . . 7 (𝜑𝑋𝑃)
3029ad2antrr 724 . . . . . 6 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝑋𝑃)
31 symquadlem.5 . . . . . . . 8 (𝜑 → (𝑋 ∈ (𝐴𝐿𝐶) ∨ 𝐴 = 𝐶))
3231ad2antrr 724 . . . . . . 7 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝑋 ∈ (𝐴𝐿𝐶) ∨ 𝐴 = 𝐶))
332, 3, 4, 24, 28, 27, 30, 32colcom 27500 . . . . . 6 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝑋 ∈ (𝐶𝐿𝐴) ∨ 𝐶 = 𝐴))
346ad2antrr 724 . . . . . . . 8 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝐵𝑃)
35 symquadlem.d . . . . . . . . 9 (𝜑𝐷𝑃)
3635ad2antrr 724 . . . . . . . 8 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝐷𝑃)
37 eqid 2736 . . . . . . . 8 (cgrG‘𝐺) = (cgrG‘𝐺)
38 simplr 767 . . . . . . . 8 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝑥𝑃)
39 symquadlem.6 . . . . . . . . . . 11 (𝜑 → (𝑋 ∈ (𝐵𝐿𝐷) ∨ 𝐵 = 𝐷))
402, 3, 4, 5, 6, 35, 29, 39colrot2 27502 . . . . . . . . . 10 (𝜑 → (𝐷 ∈ (𝑋𝐿𝐵) ∨ 𝑋 = 𝐵))
412, 3, 4, 5, 29, 6, 35, 40colcom 27500 . . . . . . . . 9 (𝜑 → (𝐷 ∈ (𝐵𝐿𝑋) ∨ 𝐵 = 𝑋))
4241ad2antrr 724 . . . . . . . 8 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝐷 ∈ (𝐵𝐿𝑋) ∨ 𝐵 = 𝑋))
43 simpr 485 . . . . . . . 8 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩)
44 symquadlem.4 . . . . . . . . 9 (𝜑 → (𝐵 𝐶) = (𝐷 𝐴))
4544ad2antrr 724 . . . . . . . 8 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝐵 𝐶) = (𝐷 𝐴))
46 symquadlem.3 . . . . . . . . . . 11 (𝜑 → (𝐴 𝐵) = (𝐶 𝐷))
472, 8, 4, 5, 7, 6, 26, 35, 46tgcgrcomlr 27422 . . . . . . . . . 10 (𝜑 → (𝐵 𝐴) = (𝐷 𝐶))
4847ad2antrr 724 . . . . . . . . 9 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝐵 𝐴) = (𝐷 𝐶))
4948eqcomd 2742 . . . . . . . 8 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝐷 𝐶) = (𝐵 𝐴))
50 symquadlem.2 . . . . . . . . 9 (𝜑𝐵𝐷)
5150ad2antrr 724 . . . . . . . 8 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝐵𝐷)
522, 3, 4, 24, 34, 36, 30, 37, 36, 34, 8, 27, 38, 28, 42, 43, 45, 49, 51tgfscgr 27510 . . . . . . 7 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝑋 𝐶) = (𝑥 𝐴))
532, 3, 4, 5, 6, 26, 7, 1ncolcom 27503 . . . . . . . . . 10 (𝜑 → ¬ (𝐴 ∈ (𝐶𝐿𝐵) ∨ 𝐶 = 𝐵))
5453ad2antrr 724 . . . . . . . . 9 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → ¬ (𝐴 ∈ (𝐶𝐿𝐵) ∨ 𝐶 = 𝐵))
5531orcomd 869 . . . . . . . . . . . 12 (𝜑 → (𝐴 = 𝐶𝑋 ∈ (𝐴𝐿𝐶)))
5655ord 862 . . . . . . . . . . 11 (𝜑 → (¬ 𝐴 = 𝐶𝑋 ∈ (𝐴𝐿𝐶)))
5718, 56mpd 15 . . . . . . . . . 10 (𝜑𝑋 ∈ (𝐴𝐿𝐶))
5857ad2antrr 724 . . . . . . . . 9 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝑋 ∈ (𝐴𝐿𝐶))
5918ad2antrr 724 . . . . . . . . . 10 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → ¬ 𝐴 = 𝐶)
6045eqcomd 2742 . . . . . . . . . . . . . . . . 17 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝐷 𝐴) = (𝐵 𝐶))
612, 3, 4, 24, 34, 36, 30, 37, 36, 34, 8, 28, 38, 27, 42, 43, 48, 60, 51tgfscgr 27510 . . . . . . . . . . . . . . . 16 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝑋 𝐴) = (𝑥 𝐶))
622, 8, 4, 24, 30, 28, 38, 27, 61tgcgrcomlr 27422 . . . . . . . . . . . . . . 15 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝐴 𝑋) = (𝐶 𝑥))
632, 8, 4, 24, 27, 28axtgcgrrflx 27404 . . . . . . . . . . . . . . 15 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝐶 𝐴) = (𝐴 𝐶))
642, 8, 37, 24, 28, 30, 27, 27, 38, 28, 62, 52, 63trgcgr 27458 . . . . . . . . . . . . . 14 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → ⟨“𝐴𝑋𝐶”⟩(cgrG‘𝐺)⟨“𝐶𝑥𝐴”⟩)
652, 3, 4, 24, 28, 30, 27, 37, 27, 38, 28, 32, 64lnxfr 27508 . . . . . . . . . . . . 13 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝑥 ∈ (𝐶𝐿𝐴) ∨ 𝐶 = 𝐴))
662, 3, 4, 24, 27, 28, 38, 65colcom 27500 . . . . . . . . . . . 12 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝑥 ∈ (𝐴𝐿𝐶) ∨ 𝐴 = 𝐶))
6766orcomd 869 . . . . . . . . . . 11 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝐴 = 𝐶𝑥 ∈ (𝐴𝐿𝐶)))
6867ord 862 . . . . . . . . . 10 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (¬ 𝐴 = 𝐶𝑥 ∈ (𝐴𝐿𝐶)))
6959, 68mpd 15 . . . . . . . . 9 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝑥 ∈ (𝐴𝐿𝐶))
7050neneqd 2948 . . . . . . . . . . 11 (𝜑 → ¬ 𝐵 = 𝐷)
7139orcomd 869 . . . . . . . . . . . 12 (𝜑 → (𝐵 = 𝐷𝑋 ∈ (𝐵𝐿𝐷)))
7271ord 862 . . . . . . . . . . 11 (𝜑 → (¬ 𝐵 = 𝐷𝑋 ∈ (𝐵𝐿𝐷)))
7370, 72mpd 15 . . . . . . . . . 10 (𝜑𝑋 ∈ (𝐵𝐿𝐷))
7473ad2antrr 724 . . . . . . . . 9 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝑋 ∈ (𝐵𝐿𝐷))
7570ad2antrr 724 . . . . . . . . . 10 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → ¬ 𝐵 = 𝐷)
7639ad2antrr 724 . . . . . . . . . . . . . 14 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝑋 ∈ (𝐵𝐿𝐷) ∨ 𝐵 = 𝐷))
772, 8, 4, 37, 24, 34, 36, 30, 36, 34, 38, 43cgr3swap23 27466 . . . . . . . . . . . . . 14 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → ⟨“𝐵𝑋𝐷”⟩(cgrG‘𝐺)⟨“𝐷𝑥𝐵”⟩)
782, 3, 4, 24, 34, 30, 36, 37, 36, 38, 34, 76, 77lnxfr 27508 . . . . . . . . . . . . 13 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝑥 ∈ (𝐷𝐿𝐵) ∨ 𝐷 = 𝐵))
792, 3, 4, 24, 36, 34, 38, 78colcom 27500 . . . . . . . . . . . 12 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝑥 ∈ (𝐵𝐿𝐷) ∨ 𝐵 = 𝐷))
8079orcomd 869 . . . . . . . . . . 11 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝐵 = 𝐷𝑥 ∈ (𝐵𝐿𝐷)))
8180ord 862 . . . . . . . . . 10 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (¬ 𝐵 = 𝐷𝑥 ∈ (𝐵𝐿𝐷)))
8275, 81mpd 15 . . . . . . . . 9 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝑥 ∈ (𝐵𝐿𝐷))
832, 4, 3, 24, 28, 27, 34, 36, 54, 58, 69, 74, 82tglineinteq 27587 . . . . . . . 8 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝑋 = 𝑥)
8483oveq1d 7372 . . . . . . 7 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝑋 𝐴) = (𝑥 𝐴))
8552, 84eqtr4d 2779 . . . . . 6 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝑋 𝐶) = (𝑋 𝐴))
862, 8, 4, 3, 23, 24, 25, 27, 28, 30, 33, 85colmid 27630 . . . . 5 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝐴 = (𝑀𝐶) ∨ 𝐶 = 𝐴))
8786orcomd 869 . . . 4 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (𝐶 = 𝐴𝐴 = (𝑀𝐶)))
8887ord 862 . . 3 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → (¬ 𝐶 = 𝐴𝐴 = (𝑀𝐶)))
8922, 88mpd 15 . 2 (((𝜑𝑥𝑃) ∧ ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩) → 𝐴 = (𝑀𝐶))
902, 8, 4, 5, 6, 35axtgcgrrflx 27404 . . 3 (𝜑 → (𝐵 𝐷) = (𝐷 𝐵))
912, 3, 4, 5, 6, 35, 29, 37, 35, 6, 8, 41, 90lnext 27509 . 2 (𝜑 → ∃𝑥𝑃 ⟨“𝐵𝐷𝑋”⟩(cgrG‘𝐺)⟨“𝐷𝐵𝑥”⟩)
9289, 91r19.29a 3159 1 (𝜑𝐴 = (𝑀𝐶))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  wo 845   = wceq 1541  wcel 2106  wne 2943   class class class wbr 5105  cfv 6496  (class class class)co 7357  ⟨“cs3 14731  Basecbs 17083  distcds 17142  TarskiGcstrkg 27369  Itvcitv 27375  LineGclng 27376  cgrGccgrg 27452  pInvGcmir 27594
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 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128
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 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-tp 4591  df-op 4593  df-uni 4866  df-int 4908  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-1st 7921  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-1o 8412  df-oadd 8416  df-er 8648  df-pm 8768  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-dju 9837  df-card 9875  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-nn 12154  df-2 12216  df-3 12217  df-n0 12414  df-xnn0 12486  df-z 12500  df-uz 12764  df-fz 13425  df-fzo 13568  df-hash 14231  df-word 14403  df-concat 14459  df-s1 14484  df-s2 14737  df-s3 14738  df-trkgc 27390  df-trkgb 27391  df-trkgcb 27392  df-trkg 27395  df-cgrg 27453  df-mir 27595
This theorem is referenced by:  opphllem  27677
  Copyright terms: Public domain W3C validator