| 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 2762 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → 𝐸 = 𝐸) | |
| 8 | eqidd 2762 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → 𝑦 = 𝑦) | |
| 9 | 6, 7, 8 | s3eqd 14871 | . . . . . 6 ⊢ (𝑥 = 𝑋 → 〈“𝑥𝐸𝑦”〉 = 〈“𝑋𝐸𝑦”〉) |
| 10 | 9 | breq2d 5109 | . . . . 5 ⊢ (𝑥 = 𝑋 → (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ↔ 〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉)) |
| 11 | breq1 5100 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥(𝐾‘𝐸)𝐷 ↔ 𝑋(𝐾‘𝐸)𝐷)) | |
| 12 | 10, 11 | 3anbi12d 1457 | . . . 4 ⊢ (𝑥 = 𝑋 → ((〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) ↔ (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹))) |
| 13 | eqidd 2762 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → 𝑋 = 𝑋) | |
| 14 | eqidd 2762 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → 𝐸 = 𝐸) | |
| 15 | id 22 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → 𝑦 = 𝑌) | |
| 16 | 13, 14, 15 | s3eqd 14871 | . . . . . 6 ⊢ (𝑦 = 𝑌 → 〈“𝑋𝐸𝑦”〉 = 〈“𝑋𝐸𝑌”〉) |
| 17 | 16 | breq2d 5109 | . . . . 5 ⊢ (𝑦 = 𝑌 → (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉 ↔ 〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉)) |
| 18 | breq1 5100 | . . . . 5 ⊢ (𝑦 = 𝑌 → (𝑦(𝐾‘𝐸)𝐹 ↔ 𝑌(𝐾‘𝐸)𝐹)) | |
| 19 | 17, 18 | 3anbi13d 1458 | . . . 4 ⊢ (𝑦 = 𝑌 → ((〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑦”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) ↔ (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑌(𝐾‘𝐸)𝐹))) |
| 20 | 12, 19 | rspc2ev 3593 | . . 3 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃 ∧ (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑋𝐸𝑌”〉 ∧ 𝑋(𝐾‘𝐸)𝐷 ∧ 𝑌(𝐾‘𝐸)𝐹)) → ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) |
| 21 | 1, 2, 3, 4, 5, 20 | syl113anc 1400 | . 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 28966 | . 2 ⊢ (𝜑 → (〈“𝐴𝐵𝐶”〉(cgrA‘𝐺)〈“𝐷𝐸𝐹”〉 ↔ ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝑥𝐸𝑦”〉 ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹))) |
| 33 | 21, 32 | mpbird 259 | 1 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉(cgrA‘𝐺)〈“𝐷𝐸𝐹”〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ∃wrex 3085 class class class wbr 5097 ‘cfv 6516 〈“cs3 14849 Basecbs 17236 TarskiGcstrkg 28584 Itvcitv 28590 cgrGccgrg 28667 hlGchlg 28757 cgrAccgra 28964 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4903 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-1o 8431 df-er 8672 df-map 8804 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-card 9891 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-nn 12205 df-2 12274 df-3 12275 df-n0 12476 df-z 12563 df-uz 12834 df-fz 13507 df-fzo 13654 df-hash 14338 df-word 14521 df-concat 14578 df-s1 14604 df-s2 14855 df-s3 14856 df-cgra 28965 |
| This theorem is referenced by: cgrahl1 28973 cgrahl2 28974 cgraid 28976 cgrcgra 28978 dfcgra2 28987 sacgr 28988 tgsas2 29013 tgsas3 29014 tgasa1 29015 |
| Copyright terms: Public domain | W3C validator |