![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > iscgrad | Structured version Visualization version GIF version |
Description: Sufficient conditions for angle congruence, deduction version. (Contributed by Thierry Arnoux, 1-Aug-2020.) |
Ref | Expression |
---|---|
iscgra.p | ⊢ 𝑃 = (Base‘𝐺) |
iscgra.i | ⊢ 𝐼 = (Itv‘𝐺) |
iscgra.k | ⊢ 𝐾 = (hlG‘𝐺) |
iscgra.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
iscgra.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
iscgra.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
iscgra.c | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
iscgra.d | ⊢ (𝜑 → 𝐷 ∈ 𝑃) |
iscgra.e | ⊢ (𝜑 → 𝐸 ∈ 𝑃) |
iscgra.f | ⊢ (𝜑 → 𝐹 ∈ 𝑃) |
iscgrad.x | ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
iscgrad.y | ⊢ (𝜑 → 𝑌 ∈ 𝑃) |
iscgrad.1 | ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉) |
iscgrad.2 | ⊢ (𝜑 → 𝑋(𝐾‘𝐸)𝐷) |
iscgrad.3 | ⊢ (𝜑 → 𝑌(𝐾‘𝐸)𝐹) |
Ref | Expression |
---|---|
iscgrad | ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉(cgrA‘𝐺)〈“𝐷𝐸𝐹”〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iscgrad.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
2 | iscgrad.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
3 | iscgrad.1 | . . . 4 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉) | |
4 | iscgrad.2 | . . . 4 ⊢ (𝜑 → 𝑋(𝐾‘𝐸)𝐷) | |
5 | iscgrad.3 | . . . 4 ⊢ (𝜑 → 𝑌(𝐾‘𝐸)𝐹) | |
6 | 3, 4, 5 | 3jca 1122 | . . 3 ⊢ (𝜑 → (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑌(𝐾‘𝐸)𝐹)) |
7 | id 22 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → 𝑥 = 𝑋) | |
8 | eqidd 2772 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → 𝐸 = 𝐸) | |
9 | eqidd 2772 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → 𝑦 = 𝑦) | |
10 | 7, 8, 9 | s3eqd 13818 | . . . . . 6 ⊢ (𝑥 = 𝑋 → 〈“𝑥𝐸𝑦”〉 = 〈“𝑋𝐸𝑦”〉) |
11 | 10 | breq2d 4798 | . . . . 5 ⊢ (𝑥 = 𝑋 → (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ↔ 〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉)) |
12 | breq1 4789 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥(𝐾‘𝐸)𝐷 ↔ 𝑋(𝐾‘𝐸)𝐷)) | |
13 | 11, 12 | 3anbi12d 1548 | . . . 4 ⊢ (𝑥 = 𝑋 → ((〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) ↔ (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹))) |
14 | eqidd 2772 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → 𝑋 = 𝑋) | |
15 | eqidd 2772 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → 𝐸 = 𝐸) | |
16 | id 22 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → 𝑦 = 𝑌) | |
17 | 14, 15, 16 | s3eqd 13818 | . . . . . 6 ⊢ (𝑦 = 𝑌 → 〈“𝑋𝐸𝑦”〉 = 〈“𝑋𝐸𝑌”〉) |
18 | 17 | breq2d 4798 | . . . . 5 ⊢ (𝑦 = 𝑌 → (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉 ↔ 〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉)) |
19 | breq1 4789 | . . . . 5 ⊢ (𝑦 = 𝑌 → (𝑦(𝐾‘𝐸)𝐹 ↔ 𝑌(𝐾‘𝐸)𝐹)) | |
20 | 18, 19 | 3anbi13d 1549 | . . . 4 ⊢ (𝑦 = 𝑌 → ((〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) ↔ (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑌(𝐾‘𝐸)𝐹))) |
21 | 13, 20 | rspc2ev 3474 | . . 3 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃 ∧ (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑌(𝐾‘𝐸)𝐹)) → ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) |
22 | 1, 2, 6, 21 | syl3anc 1476 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) |
23 | iscgra.p | . . 3 ⊢ 𝑃 = (Base‘𝐺) | |
24 | iscgra.i | . . 3 ⊢ 𝐼 = (Itv‘𝐺) | |
25 | iscgra.k | . . 3 ⊢ 𝐾 = (hlG‘𝐺) | |
26 | iscgra.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
27 | iscgra.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
28 | iscgra.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
29 | iscgra.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
30 | iscgra.d | . . 3 ⊢ (𝜑 → 𝐷 ∈ 𝑃) | |
31 | iscgra.e | . . 3 ⊢ (𝜑 → 𝐸 ∈ 𝑃) | |
32 | iscgra.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑃) | |
33 | 23, 24, 25, 26, 27, 28, 29, 30, 31, 32 | iscgra 25922 | . 2 ⊢ (𝜑 → (〈“𝐴𝐵𝐶”〉(cgrA‘𝐺)〈“𝐷𝐸𝐹”〉 ↔ ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹))) |
34 | 22, 33 | mpbird 247 | 1 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉(cgrA‘𝐺)〈“𝐷𝐸𝐹”〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1071 = wceq 1631 ∈ wcel 2145 ∃wrex 3062 class class class wbr 4786 ‘cfv 6031 〈“cs3 13796 Basecbs 16064 TarskiGcstrkg 25550 Itvcitv 25556 cgrGccgrg 25626 hlGchlg 25716 cgrAccgra 25920 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-rep 4904 ax-sep 4915 ax-nul 4923 ax-pow 4974 ax-pr 5034 ax-un 7096 ax-cnex 10194 ax-resscn 10195 ax-1cn 10196 ax-icn 10197 ax-addcl 10198 ax-addrcl 10199 ax-mulcl 10200 ax-mulrcl 10201 ax-mulcom 10202 ax-addass 10203 ax-mulass 10204 ax-distr 10205 ax-i2m1 10206 ax-1ne0 10207 ax-1rid 10208 ax-rnegex 10209 ax-rrecex 10210 ax-cnre 10211 ax-pre-lttri 10212 ax-pre-lttrn 10213 ax-pre-ltadd 10214 ax-pre-mulgt0 10215 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3or 1072 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-pss 3739 df-nul 4064 df-if 4226 df-pw 4299 df-sn 4317 df-pr 4319 df-tp 4321 df-op 4323 df-uni 4575 df-int 4612 df-iun 4656 df-br 4787 df-opab 4847 df-mpt 4864 df-tr 4887 df-id 5157 df-eprel 5162 df-po 5170 df-so 5171 df-fr 5208 df-we 5210 df-xp 5255 df-rel 5256 df-cnv 5257 df-co 5258 df-dm 5259 df-rn 5260 df-res 5261 df-ima 5262 df-pred 5823 df-ord 5869 df-on 5870 df-lim 5871 df-suc 5872 df-iota 5994 df-fun 6033 df-fn 6034 df-f 6035 df-f1 6036 df-fo 6037 df-f1o 6038 df-fv 6039 df-riota 6754 df-ov 6796 df-oprab 6797 df-mpt2 6798 df-om 7213 df-1st 7315 df-2nd 7316 df-wrecs 7559 df-recs 7621 df-rdg 7659 df-1o 7713 df-oadd 7717 df-er 7896 df-map 8011 df-en 8110 df-dom 8111 df-sdom 8112 df-fin 8113 df-card 8965 df-pnf 10278 df-mnf 10279 df-xr 10280 df-ltxr 10281 df-le 10282 df-sub 10470 df-neg 10471 df-nn 11223 df-2 11281 df-3 11282 df-n0 11495 df-z 11580 df-uz 11889 df-fz 12534 df-fzo 12674 df-hash 13322 df-word 13495 df-concat 13497 df-s1 13498 df-s2 13802 df-s3 13803 df-cgra 25921 |
This theorem is referenced by: cgrahl1 25929 cgrahl2 25930 cgraid 25932 cgrcgra 25934 dfcgra2 25942 sacgr 25943 tgsas2 25958 tgsas3 25959 tgasa1 25960 tgsss1 25962 |
Copyright terms: Public domain | W3C validator |