| 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 14826 | . . . . . 6 ⊢ (𝑥 = 𝑋 → 〈“𝑥𝐸𝑦”〉 = 〈“𝑋𝐸𝑦”〉) |
| 10 | 9 | breq2d 5097 | . . . . 5 ⊢ (𝑥 = 𝑋 → (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ↔ 〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉)) |
| 11 | breq1 5088 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥(𝐾‘𝐸)𝐷 ↔ 𝑋(𝐾‘𝐸)𝐷)) | |
| 12 | 10, 11 | 3anbi12d 1440 | . . . 4 ⊢ (𝑥 = 𝑋 → ((〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) ↔ (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹))) |
| 13 | eqidd 2737 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → 𝑋 = 𝑋) | |
| 14 | eqidd 2737 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → 𝐸 = 𝐸) | |
| 15 | id 22 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → 𝑦 = 𝑌) | |
| 16 | 13, 14, 15 | s3eqd 14826 | . . . . . 6 ⊢ (𝑦 = 𝑌 → 〈“𝑋𝐸𝑦”〉 = 〈“𝑋𝐸𝑌”〉) |
| 17 | 16 | breq2d 5097 | . . . . 5 ⊢ (𝑦 = 𝑌 → (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉 ↔ 〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉)) |
| 18 | breq1 5088 | . . . . 5 ⊢ (𝑦 = 𝑌 → (𝑦(𝐾‘𝐸)𝐹 ↔ 𝑌(𝐾‘𝐸)𝐹)) | |
| 19 | 17, 18 | 3anbi13d 1441 | . . . 4 ⊢ (𝑦 = 𝑌 → ((〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) ↔ (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑌(𝐾‘𝐸)𝐹))) |
| 20 | 12, 19 | rspc2ev 3577 | . . 3 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃 ∧ (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑌(𝐾‘𝐸)𝐹)) → ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) |
| 21 | 1, 2, 3, 4, 5, 20 | syl113anc 1385 | . 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 28877 | . 2 ⊢ (𝜑 → (〈“𝐴𝐵𝐶”〉(cgrA‘𝐺)〈“𝐷𝐸𝐹”〉 ↔ ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹))) |
| 33 | 21, 32 | mpbird 257 | 1 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉(cgrA‘𝐺)〈“𝐷𝐸𝐹”〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∃wrex 3061 class class class wbr 5085 ‘cfv 6498 〈“cs3 14804 Basecbs 17179 TarskiGcstrkg 28495 Itvcitv 28501 cgrGccgrg 28578 hlGchlg 28668 cgrAccgra 28875 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 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 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-map 8775 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-z 12525 df-uz 12789 df-fz 13462 df-fzo 13609 df-hash 14293 df-word 14476 df-concat 14533 df-s1 14559 df-s2 14810 df-s3 14811 df-cgra 28876 |
| This theorem is referenced by: cgrahl1 28884 cgrahl2 28885 cgraid 28887 cgrcgra 28889 dfcgra2 28898 sacgr 28899 tgsas2 28924 tgsas3 28925 tgasa1 28926 |
| Copyright terms: Public domain | W3C validator |