| 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 1129 | . . 3 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐵 ∧ 𝑋 ≠ 𝐵)) |
| 5 | isinagd.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
| 6 | simpr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → 𝑥 = 𝑌) | |
| 7 | eqidd 2737 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝐴𝐼𝐶) = (𝐴𝐼𝐶)) | |
| 8 | 6, 7 | eleq12d 2830 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑥 ∈ (𝐴𝐼𝐶) ↔ 𝑌 ∈ (𝐴𝐼𝐶))) |
| 9 | eqidd 2737 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → 𝐵 = 𝐵) | |
| 10 | 6, 9 | eqeq12d 2752 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑥 = 𝐵 ↔ 𝑌 = 𝐵)) |
| 11 | 6 | breq1d 5095 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑥(𝐾‘𝐵)𝑋 ↔ 𝑌(𝐾‘𝐵)𝑋)) |
| 12 | 10, 11 | orbi12d 919 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → ((𝑥 = 𝐵 ∨ 𝑥(𝐾‘𝐵)𝑋) ↔ (𝑌 = 𝐵 ∨ 𝑌(𝐾‘𝐵)𝑋))) |
| 13 | 8, 12 | anbi12d 633 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → ((𝑥 ∈ (𝐴𝐼𝐶) ∧ (𝑥 = 𝐵 ∨ 𝑥(𝐾‘𝐵)𝑋)) ↔ (𝑌 ∈ (𝐴𝐼𝐶) ∧ (𝑌 = 𝐵 ∨ 𝑌(𝐾‘𝐵)𝑋)))) |
| 14 | isinagd.4 | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ (𝐴𝐼𝐶)) | |
| 15 | isinagd.5 | . . . . 5 ⊢ (𝜑 → (𝑌 = 𝐵 ∨ 𝑌(𝐾‘𝐵)𝑋)) | |
| 16 | 14, 15 | jca 511 | . . . 4 ⊢ (𝜑 → (𝑌 ∈ (𝐴𝐼𝐶) ∧ (𝑌 = 𝐵 ∨ 𝑌(𝐾‘𝐵)𝑋))) |
| 17 | 5, 13, 16 | rspcedvd 3566 | . . 3 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐴𝐼𝐶) ∧ (𝑥 = 𝐵 ∨ 𝑥(𝐾‘𝐵)𝑋))) |
| 18 | 4, 17 | jca 511 | . 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 28906 | . 2 ⊢ (𝜑 → (𝑋(inA‘𝐺)〈“𝐴𝐵𝐶”〉 ↔ ((𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐵 ∧ 𝑋 ≠ 𝐵) ∧ ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐴𝐼𝐶) ∧ (𝑥 = 𝐵 ∨ 𝑥(𝐾‘𝐵)𝑋))))) |
| 28 | 18, 27 | mpbird 257 | 1 ⊢ (𝜑 → 𝑋(inA‘𝐺)〈“𝐴𝐵𝐶”〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∨ wo 848 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 ∃wrex 3061 class class class wbr 5085 ‘cfv 6498 (class class class)co 7367 〈“cs3 14804 Basecbs 17179 Itvcitv 28501 hlGchlg 28668 inAcinag 28903 |
| 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-inag 28905 |
| This theorem is referenced by: inagflat 28908 |
| Copyright terms: Public domain | W3C validator |