| 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 | . . 3 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉) | |
| 4 | iscgrad.2 | . . 3 ⊢ (𝜑 → 𝑋(𝐾‘𝐸)𝐷) | |
| 5 | iscgrad.3 | . . 3 ⊢ (𝜑 → 𝑌(𝐾‘𝐸)𝐹) | |
| 6 | id 22 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → 𝑥 = 𝑋) | |
| 7 | eqidd 2737 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → 𝐸 = 𝐸) | |
| 8 | eqidd 2737 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → 𝑦 = 𝑦) | |
| 9 | 6, 7, 8 | s3eqd 14787 | . . . . . 6 ⊢ (𝑥 = 𝑋 → 〈“𝑥𝐸𝑦”〉 = 〈“𝑋𝐸𝑦”〉) |
| 10 | 9 | breq2d 5110 | . . . . 5 ⊢ (𝑥 = 𝑋 → (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ↔ 〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉)) |
| 11 | breq1 5101 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥(𝐾‘𝐸)𝐷 ↔ 𝑋(𝐾‘𝐸)𝐷)) | |
| 12 | 10, 11 | 3anbi12d 1439 | . . . 4 ⊢ (𝑥 = 𝑋 → ((〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) ↔ (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹))) |
| 13 | eqidd 2737 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → 𝑋 = 𝑋) | |
| 14 | eqidd 2737 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → 𝐸 = 𝐸) | |
| 15 | id 22 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → 𝑦 = 𝑌) | |
| 16 | 13, 14, 15 | s3eqd 14787 | . . . . . 6 ⊢ (𝑦 = 𝑌 → 〈“𝑋𝐸𝑦”〉 = 〈“𝑋𝐸𝑌”〉) |
| 17 | 16 | breq2d 5110 | . . . . 5 ⊢ (𝑦 = 𝑌 → (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉 ↔ 〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉)) |
| 18 | breq1 5101 | . . . . 5 ⊢ (𝑦 = 𝑌 → (𝑦(𝐾‘𝐸)𝐹 ↔ 𝑌(𝐾‘𝐸)𝐹)) | |
| 19 | 17, 18 | 3anbi13d 1440 | . . . 4 ⊢ (𝑦 = 𝑌 → ((〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) ↔ (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑌(𝐾‘𝐸)𝐹))) |
| 20 | 12, 19 | rspc2ev 3589 | . . 3 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃 ∧ (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑌(𝐾‘𝐸)𝐹)) → ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) |
| 21 | 1, 2, 3, 4, 5, 20 | syl113anc 1384 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) |
| 22 | iscgra.p | . . 3 ⊢ 𝑃 = (Base‘𝐺) | |
| 23 | iscgra.i | . . 3 ⊢ 𝐼 = (Itv‘𝐺) | |
| 24 | iscgra.k | . . 3 ⊢ 𝐾 = (hlG‘𝐺) | |
| 25 | iscgra.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 26 | iscgra.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 27 | iscgra.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 28 | iscgra.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
| 29 | iscgra.d | . . 3 ⊢ (𝜑 → 𝐷 ∈ 𝑃) | |
| 30 | iscgra.e | . . 3 ⊢ (𝜑 → 𝐸 ∈ 𝑃) | |
| 31 | iscgra.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑃) | |
| 32 | 22, 23, 24, 25, 26, 27, 28, 29, 30, 31 | iscgra 28881 | . 2 ⊢ (𝜑 → (〈“𝐴𝐵𝐶”〉(cgrA‘𝐺)〈“𝐷𝐸𝐹”〉 ↔ ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹))) |
| 33 | 21, 32 | mpbird 257 | 1 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉(cgrA‘𝐺)〈“𝐷𝐸𝐹”〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ∃wrex 3060 class class class wbr 5098 ‘cfv 6492 〈“cs3 14765 Basecbs 17136 TarskiGcstrkg 28499 Itvcitv 28505 cgrGccgrg 28582 hlGchlg 28672 cgrAccgra 28879 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-card 9851 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-3 12209 df-n0 12402 df-z 12489 df-uz 12752 df-fz 13424 df-fzo 13571 df-hash 14254 df-word 14437 df-concat 14494 df-s1 14520 df-s2 14771 df-s3 14772 df-cgra 28880 |
| This theorem is referenced by: cgrahl1 28888 cgrahl2 28889 cgraid 28891 cgrcgra 28893 dfcgra2 28902 sacgr 28903 tgsas2 28928 tgsas3 28929 tgasa1 28930 |
| Copyright terms: Public domain | W3C validator |