Metamath Proof Explorer


Theorem krippen

Description: Krippenlemma (German for crib's lemma) Lemma 7.22 of Schwabhauser p. 53. proven by Gupta 1965 as Theorem 3.45. (Contributed by Thierry Arnoux, 12-Aug-2019)

Ref Expression
Hypotheses mirval.p ⊢ P = Base G
mirval.d ⊢ - ˙ = dist ⁡ G
mirval.i ⊢ I = Itv ⁡ G
mirval.l ⊢ L = Line 𝒢 ⁡ G
mirval.s ⊢ S = pInv 𝒢 ⁡ G
mirval.g ⊢ φ → G ∈ 𝒢 Tarski
krippen.m ⊢ M = S ⁡ X
krippen.n ⊢ N = S ⁡ Y
krippen.a ⊢ φ → A ∈ P
krippen.b ⊢ φ → B ∈ P
krippen.c ⊢ φ → C ∈ P
krippen.e ⊢ φ → E ∈ P
krippen.f ⊢ φ → F ∈ P
krippen.x ⊢ φ → X ∈ P
krippen.y ⊢ φ → Y ∈ P
krippen.1 ⊢ φ → C ∈ A I E
krippen.2 ⊢ φ → C ∈ B I F
krippen.3 ⊢ φ → C - ˙ A = C - ˙ B
krippen.4 ⊢ φ → C - ˙ E = C - ˙ F
krippen.5 ⊢ φ → B = M ⁡ A
krippen.6 ⊢ φ → F = N ⁡ E
Assertion krippen ⊢ φ → C ∈ X I Y

Proof

Step Hyp Ref Expression
1 mirval.p ⊢ P = Base G
2 mirval.d ⊢ - ˙ = dist ⁡ G
3 mirval.i ⊢ I = Itv ⁡ G
4 mirval.l ⊢ L = Line 𝒢 ⁡ G
5 mirval.s ⊢ S = pInv 𝒢 ⁡ G
6 mirval.g ⊢ φ → G ∈ 𝒢 Tarski
7 krippen.m ⊢ M = S ⁡ X
8 krippen.n ⊢ N = S ⁡ Y
9 krippen.a ⊢ φ → A ∈ P
10 krippen.b ⊢ φ → B ∈ P
11 krippen.c ⊢ φ → C ∈ P
12 krippen.e ⊢ φ → E ∈ P
13 krippen.f ⊢ φ → F ∈ P
14 krippen.x ⊢ φ → X ∈ P
15 krippen.y ⊢ φ → Y ∈ P
16 krippen.1 ⊢ φ → C ∈ A I E
17 krippen.2 ⊢ φ → C ∈ B I F
18 krippen.3 ⊢ φ → C - ˙ A = C - ˙ B
19 krippen.4 ⊢ φ → C - ˙ E = C - ˙ F
20 krippen.5 ⊢ φ → B = M ⁡ A
21 krippen.6 ⊢ φ → F = N ⁡ E
22 6 adantr ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → G ∈ 𝒢 Tarski
23 9 adantr ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → A ∈ P
24 10 adantr ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → B ∈ P
25 11 adantr ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → C ∈ P
26 12 adantr ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → E ∈ P
27 13 adantr ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → F ∈ P
28 14 adantr ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → X ∈ P
29 15 adantr ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → Y ∈ P
30 16 adantr ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → C ∈ A I E
31 17 adantr ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → C ∈ B I F
32 18 adantr ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → C - ˙ A = C - ˙ B
33 19 adantr ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → C - ˙ E = C - ˙ F
34 20 adantr ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → B = M ⁡ A
35 21 adantr ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → F = N ⁡ E
36 eqid ⊢ ≤ 𝒢 ⁡ G = ≤ 𝒢 ⁡ G
37 simpr ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E
38 1 2 3 4 5 22 7 8 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 krippenlem ⊢ φ ∧ C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E → C ∈ X I Y
39 6 adantr ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → G ∈ 𝒢 Tarski
40 15 adantr ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → Y ∈ P
41 11 adantr ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → C ∈ P
42 14 adantr ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → X ∈ P
43 12 adantr ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → E ∈ P
44 13 adantr ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → F ∈ P
45 9 adantr ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → A ∈ P
46 10 adantr ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → B ∈ P
47 16 adantr ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → C ∈ A I E
48 1 2 3 39 45 41 43 47 tgbtwncom ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → C ∈ E I A
49 17 adantr ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → C ∈ B I F
50 1 2 3 39 46 41 44 49 tgbtwncom ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → C ∈ F I B
51 19 adantr ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → C - ˙ E = C - ˙ F
52 18 adantr ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → C - ˙ A = C - ˙ B
53 21 adantr ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → F = N ⁡ E
54 20 adantr ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → B = M ⁡ A
55 simpr ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A
56 1 2 3 4 5 39 8 7 43 44 41 45 46 40 42 48 50 51 52 53 54 36 55 krippenlem ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → C ∈ Y I X
57 1 2 3 39 40 41 42 56 tgbtwncom ⊢ φ ∧ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A → C ∈ X I Y
58 1 2 3 36 6 11 9 11 12 legtrid ⊢ φ → C - ˙ A ≤ 𝒢 ⁡ G C - ˙ E ∨ C - ˙ E ≤ 𝒢 ⁡ G C - ˙ A
59 38 57 58 mpjaodan ⊢ φ → C ∈ X I Y