| 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 1146 | . . 3 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐵 ∧ 𝑋 ≠ 𝐵)) |
| 5 | isinagd.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
| 6 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → 𝑥 = 𝑌) | |
| 7 | eqidd 2764 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝐴𝐼𝐶) = (𝐴𝐼𝐶)) | |
| 8 | 6, 7 | eleq12d 2858 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑥 ∈ (𝐴𝐼𝐶) ↔ 𝑌 ∈ (𝐴𝐼𝐶))) |
| 9 | eqidd 2764 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → 𝐵 = 𝐵) | |
| 10 | 6, 9 | eqeq12d 2779 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑥 = 𝐵 ↔ 𝑌 = 𝐵)) |
| 11 | 6 | breq1d 5118 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑥(𝐾‘𝐵)𝑋 ↔ 𝑌(𝐾‘𝐵)𝑋)) |
| 12 | 10, 11 | orbi12d 932 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → ((𝑥 = 𝐵 ∨ 𝑥(𝐾‘𝐵)𝑋) ↔ (𝑌 = 𝐵 ∨ 𝑌(𝐾‘𝐵)𝑋))) |
| 13 | 8, 12 | anbi12d 644 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → ((𝑥 ∈ (𝐴𝐼𝐶) ∧ (𝑥 = 𝐵 ∨ 𝑥(𝐾‘𝐵)𝑋)) ↔ (𝑌 ∈ (𝐴𝐼𝐶) ∧ (𝑌 = 𝐵 ∨ 𝑌(𝐾‘𝐵)𝑋)))) |
| 14 | isinagd.4 | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ (𝐴𝐼𝐶)) | |
| 15 | isinagd.5 | . . . . 5 ⊢ (𝜑 → (𝑌 = 𝐵 ∨ 𝑌(𝐾‘𝐵)𝑋)) | |
| 16 | 14, 15 | jca 521 | . . . 4 ⊢ (𝜑 → (𝑌 ∈ (𝐴𝐼𝐶) ∧ (𝑌 = 𝐵 ∨ 𝑌(𝐾‘𝐵)𝑋))) |
| 17 | 5, 13, 16 | rspcedvd 3582 | . . 3 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐴𝐼𝐶) ∧ (𝑥 = 𝐵 ∨ 𝑥(𝐾‘𝐵)𝑋))) |
| 18 | 4, 17 | jca 521 | . 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 29414 | . 2 ⊢ (𝜑 → (𝑋(inA‘𝐺)〈“𝐴𝐵𝐶”〉 ↔ ((𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐵 ∧ 𝑋 ≠ 𝐵) ∧ ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐴𝐼𝐶) ∧ (𝑥 = 𝐵 ∨ 𝑥(𝐾‘𝐵)𝑋))))) |
| 28 | 18, 27 | mpbird 260 | 1 ⊢ (𝜑 → 𝑋(inA‘𝐺)〈“𝐴𝐵𝐶”〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∃wrex 3090 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 〈“cs3 15035 Basecbs 17431 Itvcitv 28952 hlGchlg 29120 inAcinag 29411 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 df-concat 14757 df-s1 14784 df-s2 15041 df-s3 15042 df-inag 29413 |
| This theorem is used by: inagflat 29416 inagcgrasubhl 33106 inagcgrasubbtwn 33107 inagcgrabtwn 33108 inagcgratrgmain 33111 tgextalem1inag 33127 |
| Copyright terms: Public domain | W3C validator |