| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isinagd | Structured version Visualization version GIF version | ||
| Description: Sufficient conditions for in-angle relation, deduction version. (Contributed by Thierry Arnoux, 20-Oct-2020.) |
| Ref | Expression |
|---|---|
| isinag.p | ⊢ 𝑃 = (Base‘𝐺) |
| isinag.i | ⊢ 𝐼 = (Itv‘𝐺) |
| isinag.k | ⊢ 𝐾 = (hlG‘𝐺) |
| isinag.x | ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
| isinag.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| isinag.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| isinag.c | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
| isinagd.g | ⊢ (𝜑 → 𝐺 ∈ 𝑉) |
| isinagd.y | ⊢ (𝜑 → 𝑌 ∈ 𝑃) |
| isinagd.1 | ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
| isinagd.2 | ⊢ (𝜑 → 𝐶 ≠ 𝐵) |
| isinagd.3 | ⊢ (𝜑 → 𝑋 ≠ 𝐵) |
| isinagd.4 | ⊢ (𝜑 → 𝑌 ∈ (𝐴𝐼𝐶)) |
| isinagd.5 | ⊢ (𝜑 → (𝑌 = 𝐵 ∨ 𝑌(𝐾‘𝐵)𝑋)) |
| Ref | Expression |
|---|---|
| isinagd | ⊢ (𝜑 → 𝑋(inA‘𝐺)〈“𝐴𝐵𝐶”〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isinagd.1 | . . . 4 ⊢ (𝜑 → 𝐴 ≠ 𝐵) | |
| 2 | isinagd.2 | . . . 4 ⊢ (𝜑 → 𝐶 ≠ 𝐵) | |
| 3 | isinagd.3 | . . . 4 ⊢ (𝜑 → 𝑋 ≠ 𝐵) | |
| 4 | 1, 2, 3 | 3jca 1144 | . . 3 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐵 ∧ 𝑋 ≠ 𝐵)) |
| 5 | isinagd.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
| 6 | simpr 489 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → 𝑥 = 𝑌) | |
| 7 | eqidd 2771 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝐴𝐼𝐶) = (𝐴𝐼𝐶)) | |
| 8 | 6, 7 | eleq12d 2864 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑥 ∈ (𝐴𝐼𝐶) ↔ 𝑌 ∈ (𝐴𝐼𝐶))) |
| 9 | eqidd 2771 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → 𝐵 = 𝐵) | |
| 10 | 6, 9 | eqeq12d 2786 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑥 = 𝐵 ↔ 𝑌 = 𝐵)) |
| 11 | 6 | breq1d 5124 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑥(𝐾‘𝐵)𝑋 ↔ 𝑌(𝐾‘𝐵)𝑋)) |
| 12 | 10, 11 | orbi12d 931 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → ((𝑥 = 𝐵 ∨ 𝑥(𝐾‘𝐵)𝑋) ↔ (𝑌 = 𝐵 ∨ 𝑌(𝐾‘𝐵)𝑋))) |
| 13 | 8, 12 | anbi12d 643 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → ((𝑥 ∈ (𝐴𝐼𝐶) ∧ (𝑥 = 𝐵 ∨ 𝑥(𝐾‘𝐵)𝑋)) ↔ (𝑌 ∈ (𝐴𝐼𝐶) ∧ (𝑌 = 𝐵 ∨ 𝑌(𝐾‘𝐵)𝑋)))) |
| 14 | isinagd.4 | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ (𝐴𝐼𝐶)) | |
| 15 | isinagd.5 | . . . . 5 ⊢ (𝜑 → (𝑌 = 𝐵 ∨ 𝑌(𝐾‘𝐵)𝑋)) | |
| 16 | 14, 15 | jca 520 | . . . 4 ⊢ (𝜑 → (𝑌 ∈ (𝐴𝐼𝐶) ∧ (𝑌 = 𝐵 ∨ 𝑌(𝐾‘𝐵)𝑋))) |
| 17 | 5, 13, 16 | rspcedvd 3591 | . . 3 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐴𝐼𝐶) ∧ (𝑥 = 𝐵 ∨ 𝑥(𝐾‘𝐵)𝑋))) |
| 18 | 4, 17 | jca 520 | . 2 ⊢ (𝜑 → ((𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐵 ∧ 𝑋 ≠ 𝐵) ∧ ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐴𝐼𝐶) ∧ (𝑥 = 𝐵 ∨ 𝑥(𝐾‘𝐵)𝑋)))) |
| 19 | isinag.p | . . 3 ⊢ 𝑃 = (Base‘𝐺) | |
| 20 | isinag.i | . . 3 ⊢ 𝐼 = (Itv‘𝐺) | |
| 21 | isinag.k | . . 3 ⊢ 𝐾 = (hlG‘𝐺) | |
| 22 | isinag.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
| 23 | isinag.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 24 | isinag.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 25 | isinag.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
| 26 | isinagd.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑉) | |
| 27 | 19, 20, 21, 22, 23, 24, 25, 26 | isinag 29132 | . 2 ⊢ (𝜑 → (𝑋(inA‘𝐺)〈“𝐴𝐵𝐶”〉 ↔ ((𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐵 ∧ 𝑋 ≠ 𝐵) ∧ ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐴𝐼𝐶) ∧ (𝑥 = 𝐵 ∨ 𝑥(𝐾‘𝐵)𝑋))))) |
| 28 | 18, 27 | mpbird 260 | 1 ⊢ (𝜑 → 𝑋(inA‘𝐺)〈“𝐴𝐵𝐶”〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∨ wo 860 ∧ w3a 1101 = wceq 1568 ∈ wcel 2150 ≠ wne 2965 ∃wrex 3096 class class class wbr 5114 ‘cfv 6540 (class class class)co 7414 〈“cs3 14882 Basecbs 17272 Itvcitv 28682 hlGchlg 28849 inAcinag 29129 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2199 ax-12 2220 ax-ext 2742 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5340 ax-pr 5408 ax-un 7736 ax-cnex 11159 ax-resscn 11160 ax-1cn 11161 ax-icn 11162 ax-addcl 11163 ax-addrcl 11164 ax-mulcl 11165 ax-mulrcl 11166 ax-mulcom 11167 ax-addass 11168 ax-mulass 11169 ax-distr 11170 ax-i2m1 11171 ax-1ne0 11172 ax-1rid 11173 ax-rnegex 11174 ax-rrecex 11175 ax-cnre 11176 ax-pre-lttri 11177 ax-pre-lttrn 11178 ax-pre-ltadd 11179 ax-pre-mulgt0 11180 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2099 df-mo 2574 df-eu 2604 df-clab 2749 df-cleq 2762 df-clel 2845 df-nfc 2919 df-ne 2966 df-nel 3072 df-ral 3087 df-rex 3097 df-reu 3377 df-rab 3424 df-v 3464 df-sbc 3753 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5560 df-eprel 5565 df-po 5573 df-so 5574 df-fr 5618 df-we 5620 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8456 df-er 8697 df-map 8829 df-en 8947 df-dom 8948 df-sdom 8949 df-fin 8950 df-card 9928 df-pnf 11248 df-mnf 11249 df-xr 11250 df-ltxr 11251 df-le 11252 df-sub 11446 df-neg 11447 df-nn 12237 df-2 12306 df-3 12307 df-n0 12508 df-z 12595 df-uz 12866 df-fz 13539 df-fzo 13686 df-hash 14370 df-word 14554 df-concat 14611 df-s1 14637 df-s2 14888 df-s3 14889 df-inag 29131 |
| This theorem is referenced by: inagflat 29134 |
| Copyright terms: Public domain | W3C validator |